./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label32.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/Problem13_label32.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 da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:01:50,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:01:50,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:01:50,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:01:50,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:01:50,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:01:50,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:01:50,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:01:50,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:01:50,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:01:50,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:01:50,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:01:50,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:01:50,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:01:50,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:01:50,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:01:50,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:01:50,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:50,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:01:50,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:01:50,594 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 -> da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d [2025-03-16 15:01:50,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:01:50,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:01:50,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:01:50,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:01:50,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:01:50,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2025-03-16 15:01:51,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58053dbb4/c05476bec3984ddfb10c434feee5d87b/FLAGe21a33cb9 [2025-03-16 15:01:52,452 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:01:52,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2025-03-16 15:01:52,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58053dbb4/c05476bec3984ddfb10c434feee5d87b/FLAGe21a33cb9 [2025-03-16 15:01:52,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58053dbb4/c05476bec3984ddfb10c434feee5d87b [2025-03-16 15:01:52,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:01:52,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:01:52,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:52,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:01:52,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:01:52,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:52" (1/1) ... [2025-03-16 15:01:52,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:52, skipping insertion in model container [2025-03-16 15:01:52,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:52" (1/1) ... [2025-03-16 15:01:52,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:01:52,761 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/Problem13_label32.c[1533,1546] [2025-03-16 15:01:53,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:53,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:01:53,308 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/Problem13_label32.c[1533,1546] [2025-03-16 15:01:53,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:53,607 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:01:53,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53 WrapperNode [2025-03-16 15:01:53,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:53,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:53,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:01:53,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:01:53,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:53,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,002 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:01:54,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:54,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:01:54,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:01:54,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:01:54,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,285 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 15:01:54,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:01:54,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:01:54,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:01:54,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:01:54,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (1/1) ... [2025-03-16 15:01:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:54,598 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 15:01:54,600 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 15:01:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:01:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:01:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:01:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:01:54,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:01:54,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:01:58,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:01:58,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:01:58,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:01:58,825 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:01:58,825 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:01:58,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:01:58,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:01:58,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:01:58 BoogieIcfgContainer [2025-03-16 15:01:58,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:01:58,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:01:58,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:01:58,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:01:58,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:01:52" (1/3) ... [2025-03-16 15:01:58,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292a1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:01:58, skipping insertion in model container [2025-03-16 15:01:58,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:53" (2/3) ... [2025-03-16 15:01:58,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292a1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:01:58, skipping insertion in model container [2025-03-16 15:01:58,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:01:58" (3/3) ... [2025-03-16 15:01:58,870 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label32.c [2025-03-16 15:01:58,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:01:58,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label32.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:01:58,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:01:58,965 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;@ff1356b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:01:58,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:01:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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 15:01:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:01:58,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:58,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:58,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:58,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 3474800, now seen corresponding path program 1 times [2025-03-16 15:01:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147620918] [2025-03-16 15:01:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:59,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:01:59,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:01:59,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:59,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:59,094 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 15:01:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147620918] [2025-03-16 15:01:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147620918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:59,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574683694] [2025-03-16 15:01:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:59,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:01:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:59,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:01:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:01:59,114 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 15:01:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:59,190 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:01:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:01:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-16 15:01:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:59,203 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:01:59,203 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:01:59,207 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 15:01:59,209 INFO L435 NwaCegarLoop]: 1879 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, 1879 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 15:01:59,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:01:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:01:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:01:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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 15:01:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:01:59,285 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 7 [2025-03-16 15:01:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:01:59,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 15:01:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:01:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:01:59,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:59,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:59,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:01:59,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:59,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 3505552, now seen corresponding path program 1 times [2025-03-16 15:01:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:59,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514756931] [2025-03-16 15:01:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:01:59,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:01:59,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:59,359 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 15:01:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514756931] [2025-03-16 15:01:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514756931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:59,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102970651] [2025-03-16 15:01:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:59,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:59,363 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 15:02:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:02,927 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2025-03-16 15:02:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-16 15:02:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:02,934 INFO L225 Difference]: With dead ends: 2905 [2025-03-16 15:02:02,934 INFO L226 Difference]: Without dead ends: 1872 [2025-03-16 15:02:02,937 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 15:02:02,938 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 881 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:02,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1091 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 15:02:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-03-16 15:02:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2025-03-16 15:02:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 0 states have call successors, (0), 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 15:02:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2025-03-16 15:02:02,992 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 7 [2025-03-16 15:02:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:02,993 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2025-03-16 15:02:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 15:02:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2025-03-16 15:02:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 15:02:02,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:02,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:02,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:02:02,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:02,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1970515613, now seen corresponding path program 1 times [2025-03-16 15:02:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028779988] [2025-03-16 15:02:02,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:03,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 15:02:03,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 15:02:03,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028779988] [2025-03-16 15:02:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028779988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397391412] [2025-03-16 15:02:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:03,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:03,239 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 15:02:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:05,987 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2025-03-16 15:02:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-16 15:02:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:05,998 INFO L225 Difference]: With dead ends: 5316 [2025-03-16 15:02:05,998 INFO L226 Difference]: Without dead ends: 3459 [2025-03-16 15:02:05,999 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 15:02:06,000 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:06,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1191 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:02:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2025-03-16 15:02:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2025-03-16 15:02:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 0 states have call successors, (0), 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 15:02:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2025-03-16 15:02:06,050 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 79 [2025-03-16 15:02:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:06,051 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2025-03-16 15:02:06,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 15:02:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2025-03-16 15:02:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 15:02:06,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:06,052 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:02:06,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:02:06,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1792215595, now seen corresponding path program 1 times [2025-03-16 15:02:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805226664] [2025-03-16 15:02:06,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 15:02:06,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 15:02:06,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:06,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:06,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805226664] [2025-03-16 15:02:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805226664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:06,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271668320] [2025-03-16 15:02:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:06,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:06,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:06,178 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 15:02:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:08,948 INFO L93 Difference]: Finished difference Result 10094 states and 13938 transitions. [2025-03-16 15:02:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-16 15:02:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:08,970 INFO L225 Difference]: With dead ends: 10094 [2025-03-16 15:02:08,970 INFO L226 Difference]: Without dead ends: 6637 [2025-03-16 15:02:08,975 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 15:02:08,976 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:08,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 902 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:02:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2025-03-16 15:02:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6630. [2025-03-16 15:02:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6630 states, 6629 states have (on average 1.2722884296273949) internal successors, (8434), 6629 states have internal predecessors, (8434), 0 states have call successors, (0), 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 15:02:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6630 states to 6630 states and 8434 transitions. [2025-03-16 15:02:09,075 INFO L78 Accepts]: Start accepts. Automaton has 6630 states and 8434 transitions. Word has length 93 [2025-03-16 15:02:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:09,075 INFO L471 AbstractCegarLoop]: Abstraction has 6630 states and 8434 transitions. [2025-03-16 15:02:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 15:02:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6630 states and 8434 transitions. [2025-03-16 15:02:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 15:02:09,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:09,076 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:02:09,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:02:09,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 318735297, now seen corresponding path program 1 times [2025-03-16 15:02:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587265256] [2025-03-16 15:02:09,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 15:02:09,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 15:02:09,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:09,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587265256] [2025-03-16 15:02:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587265256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:09,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:09,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217900113] [2025-03-16 15:02:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:09,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:09,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:09,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:09,188 INFO L87 Difference]: Start difference. First operand 6630 states and 8434 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 15:02:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:11,703 INFO L93 Difference]: Finished difference Result 16436 states and 21418 transitions. [2025-03-16 15:02:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 15:02:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:11,726 INFO L225 Difference]: With dead ends: 16436 [2025-03-16 15:02:11,726 INFO L226 Difference]: Without dead ends: 9807 [2025-03-16 15:02:11,733 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 15:02:11,734 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1029 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:11,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 830 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:02:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9807 states. [2025-03-16 15:02:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9807 to 9796. [2025-03-16 15:02:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9796 states, 9795 states have (on average 1.2739152628892292) internal successors, (12478), 9795 states have internal predecessors, (12478), 0 states have call successors, (0), 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 15:02:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 12478 transitions. [2025-03-16 15:02:11,859 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 12478 transitions. Word has length 96 [2025-03-16 15:02:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 9796 states and 12478 transitions. [2025-03-16 15:02:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 15:02:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 12478 transitions. [2025-03-16 15:02:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 15:02:11,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:11,864 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:02:11,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:02:11,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1449392525, now seen corresponding path program 1 times [2025-03-16 15:02:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844412174] [2025-03-16 15:02:11,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:11,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 15:02:11,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 15:02:11,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:11,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844412174] [2025-03-16 15:02:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844412174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941740772] [2025-03-16 15:02:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:12,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:12,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:12,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:12,399 INFO L87 Difference]: Start difference. First operand 9796 states and 12478 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 15:02:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:16,968 INFO L93 Difference]: Finished difference Result 29890 states and 37879 transitions. [2025-03-16 15:02:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:16,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-16 15:02:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:17,009 INFO L225 Difference]: With dead ends: 29890 [2025-03-16 15:02:17,009 INFO L226 Difference]: Without dead ends: 20095 [2025-03-16 15:02:17,020 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 15:02:17,021 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 2126 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 5795 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 6341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 5795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:17,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 1310 Invalid, 6341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 5795 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:02:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20095 states. [2025-03-16 15:02:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20095 to 20065. [2025-03-16 15:02:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20065 states, 20064 states have (on average 1.1847089314194577) internal successors, (23770), 20064 states have internal predecessors, (23770), 0 states have call successors, (0), 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 15:02:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20065 states to 20065 states and 23770 transitions. [2025-03-16 15:02:17,276 INFO L78 Accepts]: Start accepts. Automaton has 20065 states and 23770 transitions. Word has length 173 [2025-03-16 15:02:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:17,278 INFO L471 AbstractCegarLoop]: Abstraction has 20065 states and 23770 transitions. [2025-03-16 15:02:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 15:02:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20065 states and 23770 transitions. [2025-03-16 15:02:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 15:02:17,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:17,281 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:17,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:02:17,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1547149811, now seen corresponding path program 1 times [2025-03-16 15:02:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:17,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528339272] [2025-03-16 15:02:17,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:17,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 15:02:17,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 15:02:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528339272] [2025-03-16 15:02:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528339272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782970641] [2025-03-16 15:02:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:17,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:17,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:17,456 INFO L87 Difference]: Start difference. First operand 20065 states and 23770 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 15:02:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:19,952 INFO L93 Difference]: Finished difference Result 45652 states and 54285 transitions. [2025-03-16 15:02:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:19,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-03-16 15:02:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:19,988 INFO L225 Difference]: With dead ends: 45652 [2025-03-16 15:02:19,988 INFO L226 Difference]: Without dead ends: 26375 [2025-03-16 15:02:20,002 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 15:02:20,003 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 858 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:20,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 949 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:02:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26375 states. [2025-03-16 15:02:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26375 to 25577. [2025-03-16 15:02:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25577 states, 25576 states have (on average 1.1777447607131686) internal successors, (30122), 25576 states have internal predecessors, (30122), 0 states have call successors, (0), 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 15:02:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25577 states to 25577 states and 30122 transitions. [2025-03-16 15:02:20,235 INFO L78 Accepts]: Start accepts. Automaton has 25577 states and 30122 transitions. Word has length 206 [2025-03-16 15:02:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 25577 states and 30122 transitions. [2025-03-16 15:02:20,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 15:02:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25577 states and 30122 transitions. [2025-03-16 15:02:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 15:02:20,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:20,240 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:02:20,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:20,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1394936700, now seen corresponding path program 1 times [2025-03-16 15:02:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462565861] [2025-03-16 15:02:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:20,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 15:02:20,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 15:02:20,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:20,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462565861] [2025-03-16 15:02:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462565861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967392593] [2025-03-16 15:02:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:20,487 INFO L87 Difference]: Start difference. First operand 25577 states and 30122 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 15:02:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:22,852 INFO L93 Difference]: Finished difference Result 51186 states and 60303 transitions. [2025-03-16 15:02:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-03-16 15:02:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:22,891 INFO L225 Difference]: With dead ends: 51186 [2025-03-16 15:02:22,891 INFO L226 Difference]: Without dead ends: 26397 [2025-03-16 15:02:22,906 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 15:02:22,907 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 722 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:22,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1916 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:02:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26397 states. [2025-03-16 15:02:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26397 to 26365. [2025-03-16 15:02:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26365 states, 26364 states have (on average 1.1612426035502958) internal successors, (30615), 26364 states have internal predecessors, (30615), 0 states have call successors, (0), 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 15:02:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26365 states to 26365 states and 30615 transitions. [2025-03-16 15:02:23,117 INFO L78 Accepts]: Start accepts. Automaton has 26365 states and 30615 transitions. Word has length 269 [2025-03-16 15:02:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:23,118 INFO L471 AbstractCegarLoop]: Abstraction has 26365 states and 30615 transitions. [2025-03-16 15:02:23,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 15:02:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 26365 states and 30615 transitions. [2025-03-16 15:02:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 15:02:23,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:23,123 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:23,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:02:23,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash -775826566, now seen corresponding path program 1 times [2025-03-16 15:02:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:23,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911963112] [2025-03-16 15:02:23,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:23,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 15:02:23,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 15:02:23,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:23,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:02:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911963112] [2025-03-16 15:02:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911963112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918500220] [2025-03-16 15:02:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:23,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:23,321 INFO L87 Difference]: Start difference. First operand 26365 states and 30615 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 15:02:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:28,402 INFO L93 Difference]: Finished difference Result 77343 states and 91882 transitions. [2025-03-16 15:02:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 295 [2025-03-16 15:02:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:28,462 INFO L225 Difference]: With dead ends: 77343 [2025-03-16 15:02:28,463 INFO L226 Difference]: Without dead ends: 51766 [2025-03-16 15:02:28,480 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 15:02:28,484 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1709 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 7166 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 8156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 7166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:28,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1121 Invalid, 8156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 7166 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 15:02:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51766 states. [2025-03-16 15:02:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51766 to 51640. [2025-03-16 15:02:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51640 states, 51639 states have (on average 1.1673347663587599) internal successors, (60280), 51639 states have internal predecessors, (60280), 0 states have call successors, (0), 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 15:02:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51640 states to 51640 states and 60280 transitions. [2025-03-16 15:02:28,908 INFO L78 Accepts]: Start accepts. Automaton has 51640 states and 60280 transitions. Word has length 295 [2025-03-16 15:02:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:28,909 INFO L471 AbstractCegarLoop]: Abstraction has 51640 states and 60280 transitions. [2025-03-16 15:02:28,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 15:02:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51640 states and 60280 transitions. [2025-03-16 15:02:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-16 15:02:28,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:28,912 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:28,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:02:28,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:28,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash -186628351, now seen corresponding path program 1 times [2025-03-16 15:02:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152728295] [2025-03-16 15:02:28,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 15:02:28,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 15:02:28,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 15:02:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152728295] [2025-03-16 15:02:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152728295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925735753] [2025-03-16 15:02:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:29,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:29,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:29,063 INFO L87 Difference]: Start difference. First operand 51640 states and 60280 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:31,868 INFO L93 Difference]: Finished difference Result 115092 states and 136211 transitions. [2025-03-16 15:02:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:31,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-03-16 15:02:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:31,939 INFO L225 Difference]: With dead ends: 115092 [2025-03-16 15:02:31,939 INFO L226 Difference]: Without dead ends: 64240 [2025-03-16 15:02:31,974 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 15:02:31,974 INFO L435 NwaCegarLoop]: 1833 mSDtfsCounter, 848 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:31,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1983 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64240 states. [2025-03-16 15:02:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64240 to 63444. [2025-03-16 15:02:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63444 states, 63443 states have (on average 1.1514430275995775) internal successors, (73051), 63443 states have internal predecessors, (73051), 0 states have call successors, (0), 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 15:02:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63444 states to 63444 states and 73051 transitions. [2025-03-16 15:02:32,712 INFO L78 Accepts]: Start accepts. Automaton has 63444 states and 73051 transitions. Word has length 298 [2025-03-16 15:02:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:32,712 INFO L471 AbstractCegarLoop]: Abstraction has 63444 states and 73051 transitions. [2025-03-16 15:02:32,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63444 states and 73051 transitions. [2025-03-16 15:02:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 15:02:32,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:32,718 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2025-03-16 15:02:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:02:32,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:32,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 727594323, now seen corresponding path program 1 times [2025-03-16 15:02:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932159902] [2025-03-16 15:02:32,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 15:02:32,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 15:02:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:32,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932159902] [2025-03-16 15:02:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932159902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:33,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142978923] [2025-03-16 15:02:33,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:33,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:33,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:33,174 INFO L87 Difference]: Start difference. First operand 63444 states and 73051 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 15:02:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:35,623 INFO L93 Difference]: Finished difference Result 126098 states and 145308 transitions. [2025-03-16 15:02:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:35,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 323 [2025-03-16 15:02:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:35,693 INFO L225 Difference]: With dead ends: 126098 [2025-03-16 15:02:35,693 INFO L226 Difference]: Without dead ends: 63442 [2025-03-16 15:02:35,735 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 15:02:35,735 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1206 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:35,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1453 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:02:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63442 states. [2025-03-16 15:02:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63442 to 63441. [2025-03-16 15:02:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63441 states, 63440 states have (on average 1.1189155107187894) internal successors, (70984), 63440 states have internal predecessors, (70984), 0 states have call successors, (0), 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 15:02:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63441 states to 63441 states and 70984 transitions. [2025-03-16 15:02:36,352 INFO L78 Accepts]: Start accepts. Automaton has 63441 states and 70984 transitions. Word has length 323 [2025-03-16 15:02:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:36,353 INFO L471 AbstractCegarLoop]: Abstraction has 63441 states and 70984 transitions. [2025-03-16 15:02:36,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 15:02:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 63441 states and 70984 transitions. [2025-03-16 15:02:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 15:02:36,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:36,359 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-16 15:02:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:02:36,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1354320021, now seen corresponding path program 1 times [2025-03-16 15:02:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909192721] [2025-03-16 15:02:36,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:36,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-16 15:02:36,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 15:02:36,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909192721] [2025-03-16 15:02:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909192721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650475218] [2025-03-16 15:02:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:36,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:36,726 INFO L87 Difference]: Start difference. First operand 63441 states and 70984 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 15:02:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:39,559 INFO L93 Difference]: Finished difference Result 126107 states and 141204 transitions. [2025-03-16 15:02:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:39,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 401 [2025-03-16 15:02:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:39,626 INFO L225 Difference]: With dead ends: 126107 [2025-03-16 15:02:39,626 INFO L226 Difference]: Without dead ends: 63454 [2025-03-16 15:02:39,654 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 15:02:39,654 INFO L435 NwaCegarLoop]: 1728 mSDtfsCounter, 799 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:39,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1879 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63454 states. [2025-03-16 15:02:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63454 to 62644. [2025-03-16 15:02:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62644 states, 62643 states have (on average 1.0835847580735278) internal successors, (67879), 62643 states have internal predecessors, (67879), 0 states have call successors, (0), 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 15:02:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62644 states to 62644 states and 67879 transitions. [2025-03-16 15:02:40,341 INFO L78 Accepts]: Start accepts. Automaton has 62644 states and 67879 transitions. Word has length 401 [2025-03-16 15:02:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:40,341 INFO L471 AbstractCegarLoop]: Abstraction has 62644 states and 67879 transitions. [2025-03-16 15:02:40,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 15:02:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 62644 states and 67879 transitions. [2025-03-16 15:02:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-16 15:02:40,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:40,350 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:40,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:02:40,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:40,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1163154842, now seen corresponding path program 1 times [2025-03-16 15:02:40,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:40,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686467642] [2025-03-16 15:02:40,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:40,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:40,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-16 15:02:40,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-16 15:02:40,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:40,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:02:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686467642] [2025-03-16 15:02:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686467642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912227352] [2025-03-16 15:02:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:40,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:40,531 INFO L87 Difference]: Start difference. First operand 62644 states and 67879 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 15:02:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:43,600 INFO L93 Difference]: Finished difference Result 163832 states and 178091 transitions. [2025-03-16 15:02:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 429 [2025-03-16 15:02:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:43,702 INFO L225 Difference]: With dead ends: 163832 [2025-03-16 15:02:43,702 INFO L226 Difference]: Without dead ends: 97247 [2025-03-16 15:02:43,879 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 15:02:43,880 INFO L435 NwaCegarLoop]: 1759 mSDtfsCounter, 874 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:43,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1893 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97247 states. [2025-03-16 15:02:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97247 to 92516. [2025-03-16 15:02:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92516 states, 92515 states have (on average 1.073382694698157) internal successors, (99304), 92515 states have internal predecessors, (99304), 0 states have call successors, (0), 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 15:02:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92516 states to 92516 states and 99304 transitions. [2025-03-16 15:02:44,708 INFO L78 Accepts]: Start accepts. Automaton has 92516 states and 99304 transitions. Word has length 429 [2025-03-16 15:02:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:44,708 INFO L471 AbstractCegarLoop]: Abstraction has 92516 states and 99304 transitions. [2025-03-16 15:02:44,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 15:02:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 92516 states and 99304 transitions. [2025-03-16 15:02:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-16 15:02:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:44,716 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:02:44,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:44,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1486979667, now seen corresponding path program 1 times [2025-03-16 15:02:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238619662] [2025-03-16 15:02:44,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:44,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-16 15:02:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-16 15:02:44,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:44,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 252 proven. 110 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:02:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238619662] [2025-03-16 15:02:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238619662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327072681] [2025-03-16 15:02:45,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:45,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:45,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:02:45,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-16 15:02:45,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-16 15:02:45,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:45,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:45,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:02:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:02:46,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:02:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327072681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:46,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:02:46,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:02:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606286087] [2025-03-16 15:02:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:46,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:46,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:46,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:02:46,017 INFO L87 Difference]: Start difference. First operand 92516 states and 99304 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 15:02:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:48,495 INFO L93 Difference]: Finished difference Result 195240 states and 210478 transitions. [2025-03-16 15:02:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 447 [2025-03-16 15:02:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:48,630 INFO L225 Difference]: With dead ends: 195240 [2025-03-16 15:02:48,630 INFO L226 Difference]: Without dead ends: 103512 [2025-03-16 15:02:48,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:02:48,685 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 1120 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:48,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 371 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:02:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103512 states. [2025-03-16 15:02:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103512 to 103512. [2025-03-16 15:02:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103512 states, 103511 states have (on average 1.070717121851784) internal successors, (110831), 103511 states have internal predecessors, (110831), 0 states have call successors, (0), 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 15:02:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103512 states to 103512 states and 110831 transitions. [2025-03-16 15:02:49,725 INFO L78 Accepts]: Start accepts. Automaton has 103512 states and 110831 transitions. Word has length 447 [2025-03-16 15:02:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 103512 states and 110831 transitions. [2025-03-16 15:02:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 15:02:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103512 states and 110831 transitions. [2025-03-16 15:02:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-16 15:02:49,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:49,732 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2025-03-16 15:02:49,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:02:49,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:02:49,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:49,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash -316652835, now seen corresponding path program 1 times [2025-03-16 15:02:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754225782] [2025-03-16 15:02:49,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:49,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:49,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-16 15:02:49,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-16 15:02:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754225782] [2025-03-16 15:02:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754225782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:02:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561210712] [2025-03-16 15:02:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:50,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:50,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:50,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:50,241 INFO L87 Difference]: Start difference. First operand 103512 states and 110831 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 15:02:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:55,548 INFO L93 Difference]: Finished difference Result 278048 states and 297930 transitions. [2025-03-16 15:02:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:55,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 453 [2025-03-16 15:02:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:55,749 INFO L225 Difference]: With dead ends: 278048 [2025-03-16 15:02:55,749 INFO L226 Difference]: Without dead ends: 175324 [2025-03-16 15:02:55,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:02:55,834 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1908 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6072 mSolverCounterSat, 1105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 7177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1105 IncrementalHoareTripleChecker+Valid, 6072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:55,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 629 Invalid, 7177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1105 Valid, 6072 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:02:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175324 states. [2025-03-16 15:02:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175324 to 164934. [2025-03-16 15:02:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164934 states, 164933 states have (on average 1.0691674801282944) internal successors, (176341), 164933 states have internal predecessors, (176341), 0 states have call successors, (0), 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 15:02:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164934 states to 164934 states and 176341 transitions. [2025-03-16 15:02:57,789 INFO L78 Accepts]: Start accepts. Automaton has 164934 states and 176341 transitions. Word has length 453 [2025-03-16 15:02:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:57,789 INFO L471 AbstractCegarLoop]: Abstraction has 164934 states and 176341 transitions. [2025-03-16 15:02:57,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 15:02:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 164934 states and 176341 transitions. [2025-03-16 15:02:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-16 15:02:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:57,801 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:02:57,802 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 341684811, now seen corresponding path program 1 times [2025-03-16 15:02:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165922288] [2025-03-16 15:02:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-16 15:02:57,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-16 15:02:57,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:57,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:02:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165922288] [2025-03-16 15:02:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165922288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264854473] [2025-03-16 15:02:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:58,574 INFO L87 Difference]: Start difference. First operand 164934 states and 176341 transitions. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 15:03:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:01,854 INFO L93 Difference]: Finished difference Result 338526 states and 361657 transitions. [2025-03-16 15:03:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:03:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 474 [2025-03-16 15:03:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:02,254 INFO L225 Difference]: With dead ends: 338526 [2025-03-16 15:03:02,254 INFO L226 Difference]: Without dead ends: 172016 [2025-03-16 15:03:02,326 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 15:03:02,326 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1506 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4169 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 4596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 4169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:02,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 951 Invalid, 4596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 4169 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172016 states. [2025-03-16 15:03:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172016 to 170439. [2025-03-16 15:03:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170439 states, 170438 states have (on average 1.0619873502387964) internal successors, (181003), 170438 states have internal predecessors, (181003), 0 states have call successors, (0), 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 15:03:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170439 states to 170439 states and 181003 transitions. [2025-03-16 15:03:04,398 INFO L78 Accepts]: Start accepts. Automaton has 170439 states and 181003 transitions. Word has length 474 [2025-03-16 15:03:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:04,398 INFO L471 AbstractCegarLoop]: Abstraction has 170439 states and 181003 transitions. [2025-03-16 15:03:04,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 15:03:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 170439 states and 181003 transitions. [2025-03-16 15:03:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-16 15:03:04,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:04,406 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:04,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:03:04,407 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:04,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1305128164, now seen corresponding path program 1 times [2025-03-16 15:03:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:04,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797480211] [2025-03-16 15:03:04,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-16 15:03:04,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-16 15:03:04,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:04,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:03:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797480211] [2025-03-16 15:03:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797480211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813594028] [2025-03-16 15:03:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:04,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:04,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:04,749 INFO L87 Difference]: Start difference. First operand 170439 states and 181003 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 2 states have internal predecessors, (395), 0 states have call successors, (0), 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 15:03:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:08,283 INFO L93 Difference]: Finished difference Result 420398 states and 446632 transitions. [2025-03-16 15:03:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 2 states have internal predecessors, (395), 0 states have call successors, (0), 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 494 [2025-03-16 15:03:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:08,834 INFO L225 Difference]: With dead ends: 420398 [2025-03-16 15:03:08,834 INFO L226 Difference]: Without dead ends: 250747 [2025-03-16 15:03:08,903 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 15:03:08,903 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 583 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:08,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 654 Invalid, 3167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250747 states. [2025-03-16 15:03:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250747 to 238141. [2025-03-16 15:03:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238141 states, 238140 states have (on average 1.0600361132107163) internal successors, (252437), 238140 states have internal predecessors, (252437), 0 states have call successors, (0), 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 15:03:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238141 states to 238141 states and 252437 transitions. [2025-03-16 15:03:11,603 INFO L78 Accepts]: Start accepts. Automaton has 238141 states and 252437 transitions. Word has length 494 [2025-03-16 15:03:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:11,604 INFO L471 AbstractCegarLoop]: Abstraction has 238141 states and 252437 transitions. [2025-03-16 15:03:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 2 states have internal predecessors, (395), 0 states have call successors, (0), 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 15:03:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 238141 states and 252437 transitions. [2025-03-16 15:03:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-16 15:03:11,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:11,613 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:03:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:03:11,613 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash 92113992, now seen corresponding path program 1 times [2025-03-16 15:03:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948942429] [2025-03-16 15:03:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:11,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-16 15:03:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-16 15:03:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:03:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948942429] [2025-03-16 15:03:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948942429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058941273] [2025-03-16 15:03:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:11,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:11,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:11,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:11,833 INFO L87 Difference]: Start difference. First operand 238141 states and 252437 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)