./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label41.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee947e38812a78047df5e0d4c922466fc041cf3c45dbdc3424cead9945ce22c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:57:06,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:57:06,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:57:06,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:57:06,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:57:06,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:57:06,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:57:06,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:57:06,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:57:06,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:57:06,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:57:06,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:57:06,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:57:06,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:57:06,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:57:06,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:57:06,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:06,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:06,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:57:06,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee947e38812a78047df5e0d4c922466fc041cf3c45dbdc3424cead9945ce22c5 [2025-01-08 22:57:07,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:57:07,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:57:07,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:57:07,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:57:07,109 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:57:07,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label41.c [2025-01-08 22:57:08,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dd7c021/220180d6e4084ecaad83064a57afd94f/FLAG6e5307714 [2025-01-08 22:57:08,643 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:57:08,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label41.c [2025-01-08 22:57:08,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dd7c021/220180d6e4084ecaad83064a57afd94f/FLAG6e5307714 [2025-01-08 22:57:08,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dd7c021/220180d6e4084ecaad83064a57afd94f [2025-01-08 22:57:08,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:57:08,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:57:08,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:08,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:57:08,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:57:08,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:08" (1/1) ... [2025-01-08 22:57:08,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:08, skipping insertion in model container [2025-01-08 22:57:08,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:08" (1/1) ... [2025-01-08 22:57:08,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:57:09,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label41.c[58800,58813] [2025-01-08 22:57:09,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:09,292 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:57:09,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label41.c[58800,58813] [2025-01-08 22:57:09,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:09,458 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:57:09,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09 WrapperNode [2025-01-08 22:57:09,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:09,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:09,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:57:09,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:57:09,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,557 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:57:09,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:09,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:57:09,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:57:09,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:57:09,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,617 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-01-08 22:57:09,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:57:09,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:57:09,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:57:09,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:57:09,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (1/1) ... [2025-01-08 22:57:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:09,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:57:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:57:09,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:57:09,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:57:09,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:57:09,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:57:09,864 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:57:09,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:57:11,288 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:57:11,289 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:57:11,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:57:11,309 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:57:11,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:11 BoogieIcfgContainer [2025-01-08 22:57:11,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:57:11,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:57:11,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:57:11,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:57:11,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:57:08" (1/3) ... [2025-01-08 22:57:11,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:11, skipping insertion in model container [2025-01-08 22:57:11,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:09" (2/3) ... [2025-01-08 22:57:11,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:11, skipping insertion in model container [2025-01-08 22:57:11,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:11" (3/3) ... [2025-01-08 22:57:11,317 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label41.c [2025-01-08 22:57:11,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:57:11,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label41.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:57:11,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:57:11,395 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;@c15dea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:57:11,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:57:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-08 22:57:11,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:11,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:11,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -553915462, now seen corresponding path program 1 times [2025-01-08 22:57:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887524726] [2025-01-08 22:57:11,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:11,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-08 22:57:11,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-08 22:57:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887524726] [2025-01-08 22:57:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887524726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384670974] [2025-01-08 22:57:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:12,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:12,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:12,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:12,257 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:13,143 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-01-08 22:57:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-01-08 22:57:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:13,154 INFO L225 Difference]: With dead ends: 860 [2025-01-08 22:57:13,154 INFO L226 Difference]: Without dead ends: 465 [2025-01-08 22:57:13,157 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-01-08 22:57:13,159 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 122 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:13,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 169 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:57:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-08 22:57:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-01-08 22:57:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-01-08 22:57:13,204 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 182 [2025-01-08 22:57:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:13,205 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-01-08 22:57:13,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-01-08 22:57:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-08 22:57:13,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:13,207 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:57:13,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:57:13,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:13,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1170988647, now seen corresponding path program 1 times [2025-01-08 22:57:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551501672] [2025-01-08 22:57:13,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:13,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-08 22:57:13,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-08 22:57:13,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:13,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551501672] [2025-01-08 22:57:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551501672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541345482] [2025-01-08 22:57:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:13,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:13,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:13,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:13,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:13,373 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:14,019 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-01-08 22:57:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2025-01-08 22:57:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:14,023 INFO L225 Difference]: With dead ends: 1343 [2025-01-08 22:57:14,023 INFO L226 Difference]: Without dead ends: 886 [2025-01-08 22:57:14,024 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-01-08 22:57:14,024 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:14,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-08 22:57:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-01-08 22:57:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.532871972318339) internal successors, (1329), 867 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1329 transitions. [2025-01-08 22:57:14,048 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1329 transitions. Word has length 190 [2025-01-08 22:57:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:14,048 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1329 transitions. [2025-01-08 22:57:14,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1329 transitions. [2025-01-08 22:57:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 22:57:14,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:14,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:14,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:57:14,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:14,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1075274959, now seen corresponding path program 1 times [2025-01-08 22:57:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:14,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622500206] [2025-01-08 22:57:14,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:14,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 22:57:14,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:57:14,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:14,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:14,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622500206] [2025-01-08 22:57:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622500206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:14,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:14,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646442955] [2025-01-08 22:57:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:14,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:14,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:14,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:14,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:14,225 INFO L87 Difference]: Start difference. First operand 868 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:14,863 INFO L93 Difference]: Finished difference Result 2570 states and 3939 transitions. [2025-01-08 22:57:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2025-01-08 22:57:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:14,871 INFO L225 Difference]: With dead ends: 2570 [2025-01-08 22:57:14,872 INFO L226 Difference]: Without dead ends: 1704 [2025-01-08 22:57:14,874 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-01-08 22:57:14,874 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:14,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 148 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-01-08 22:57:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1700. [2025-01-08 22:57:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.4484991171277222) internal successors, (2461), 1699 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2461 transitions. [2025-01-08 22:57:14,916 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2461 transitions. Word has length 195 [2025-01-08 22:57:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2461 transitions. [2025-01-08 22:57:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2461 transitions. [2025-01-08 22:57:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-08 22:57:14,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:14,921 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-01-08 22:57:14,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:57:14,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:14,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 269570566, now seen corresponding path program 1 times [2025-01-08 22:57:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:14,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517001784] [2025-01-08 22:57:14,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:14,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-08 22:57:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-08 22:57:14,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:14,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:57:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517001784] [2025-01-08 22:57:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517001784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:15,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:15,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815567975] [2025-01-08 22:57:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:15,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:15,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:15,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:15,325 INFO L87 Difference]: Start difference. First operand 1700 states and 2461 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:16,010 INFO L93 Difference]: Finished difference Result 4245 states and 6131 transitions. [2025-01-08 22:57:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:16,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 199 [2025-01-08 22:57:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:16,018 INFO L225 Difference]: With dead ends: 4245 [2025-01-08 22:57:16,019 INFO L226 Difference]: Without dead ends: 2547 [2025-01-08 22:57:16,021 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-01-08 22:57:16,026 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 226 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:16,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 179 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2025-01-08 22:57:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2536. [2025-01-08 22:57:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 1.4323471400394476) internal successors, (3631), 2535 states have internal predecessors, (3631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3631 transitions. [2025-01-08 22:57:16,070 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3631 transitions. Word has length 199 [2025-01-08 22:57:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3631 transitions. [2025-01-08 22:57:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3631 transitions. [2025-01-08 22:57:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:57:16,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:16,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-01-08 22:57:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:57:16,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:16,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -828788032, now seen corresponding path program 1 times [2025-01-08 22:57:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880124888] [2025-01-08 22:57:16,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:16,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:57:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:57:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:57:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880124888] [2025-01-08 22:57:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880124888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742718339] [2025-01-08 22:57:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:16,219 INFO L87 Difference]: Start difference. First operand 2536 states and 3631 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:16,445 INFO L93 Difference]: Finished difference Result 7560 states and 10834 transitions. [2025-01-08 22:57:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 202 [2025-01-08 22:57:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:16,460 INFO L225 Difference]: With dead ends: 7560 [2025-01-08 22:57:16,460 INFO L226 Difference]: Without dead ends: 5026 [2025-01-08 22:57:16,464 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-01-08 22:57:16,464 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 361 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:16,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 586 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:57:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2025-01-08 22:57:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 5016. [2025-01-08 22:57:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5016 states, 5015 states have (on average 1.4327018943170489) internal successors, (7185), 5015 states have internal predecessors, (7185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5016 states to 5016 states and 7185 transitions. [2025-01-08 22:57:16,582 INFO L78 Accepts]: Start accepts. Automaton has 5016 states and 7185 transitions. Word has length 202 [2025-01-08 22:57:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:16,582 INFO L471 AbstractCegarLoop]: Abstraction has 5016 states and 7185 transitions. [2025-01-08 22:57:16,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5016 states and 7185 transitions. [2025-01-08 22:57:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-08 22:57:16,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:16,590 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2025-01-08 22:57:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:57:16,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1770129467, now seen corresponding path program 1 times [2025-01-08 22:57:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036969870] [2025-01-08 22:57:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:16,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-08 22:57:16,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-08 22:57:16,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:16,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:57:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036969870] [2025-01-08 22:57:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036969870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:16,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309918493] [2025-01-08 22:57:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:16,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:16,708 INFO L87 Difference]: Start difference. First operand 5016 states and 7185 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:17,341 INFO L93 Difference]: Finished difference Result 10023 states and 14356 transitions. [2025-01-08 22:57:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:17,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 204 [2025-01-08 22:57:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:17,355 INFO L225 Difference]: With dead ends: 10023 [2025-01-08 22:57:17,356 INFO L226 Difference]: Without dead ends: 5009 [2025-01-08 22:57:17,361 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-01-08 22:57:17,362 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 269 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:17,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 376 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2025-01-08 22:57:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 5006. [2025-01-08 22:57:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 5005 states have (on average 1.3392607392607392) internal successors, (6703), 5005 states have internal predecessors, (6703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 6703 transitions. [2025-01-08 22:57:17,462 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 6703 transitions. Word has length 204 [2025-01-08 22:57:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:17,462 INFO L471 AbstractCegarLoop]: Abstraction has 5006 states and 6703 transitions. [2025-01-08 22:57:17,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 6703 transitions. [2025-01-08 22:57:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:57:17,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:17,469 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2025-01-08 22:57:17,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:57:17,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1610594304, now seen corresponding path program 2 times [2025-01-08 22:57:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660856002] [2025-01-08 22:57:17,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:57:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:17,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes. [2025-01-08 22:57:17,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:57:17,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:57:17,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:57:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660856002] [2025-01-08 22:57:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660856002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:57:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644258793] [2025-01-08 22:57:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:57:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:17,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:57:17,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:17,914 INFO L87 Difference]: Start difference. First operand 5006 states and 6703 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:19,103 INFO L93 Difference]: Finished difference Result 15640 states and 21026 transitions. [2025-01-08 22:57:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:57:19,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 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-01-08 22:57:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:19,133 INFO L225 Difference]: With dead ends: 15640 [2025-01-08 22:57:19,133 INFO L226 Difference]: Without dead ends: 10636 [2025-01-08 22:57:19,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:57:19,140 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 1190 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:19,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 92 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:57:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10636 states. [2025-01-08 22:57:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10636 to 10094. [2025-01-08 22:57:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10094 states, 10093 states have (on average 1.2952541365302686) internal successors, (13073), 10093 states have internal predecessors, (13073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10094 states to 10094 states and 13073 transitions. [2025-01-08 22:57:19,344 INFO L78 Accepts]: Start accepts. Automaton has 10094 states and 13073 transitions. Word has length 206 [2025-01-08 22:57:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:19,345 INFO L471 AbstractCegarLoop]: Abstraction has 10094 states and 13073 transitions. [2025-01-08 22:57:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10094 states and 13073 transitions. [2025-01-08 22:57:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-08 22:57:19,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:19,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:57:19,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:19,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1526308645, now seen corresponding path program 1 times [2025-01-08 22:57:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474694710] [2025-01-08 22:57:19,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:19,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-08 22:57:19,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-08 22:57:19,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:19,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:57:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474694710] [2025-01-08 22:57:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474694710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180357705] [2025-01-08 22:57:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:19,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:19,730 INFO L87 Difference]: Start difference. First operand 10094 states and 13073 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:20,468 INFO L93 Difference]: Finished difference Result 24634 states and 31907 transitions. [2025-01-08 22:57:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 333 [2025-01-08 22:57:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:20,494 INFO L225 Difference]: With dead ends: 24634 [2025-01-08 22:57:20,494 INFO L226 Difference]: Without dead ends: 14542 [2025-01-08 22:57:20,505 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-01-08 22:57:20,506 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 486 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:20,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 45 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14542 states. [2025-01-08 22:57:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14542 to 14542. [2025-01-08 22:57:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14541 states have (on average 1.2715769204318823) internal successors, (18490), 14541 states have internal predecessors, (18490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 18490 transitions. [2025-01-08 22:57:20,759 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 18490 transitions. Word has length 333 [2025-01-08 22:57:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:20,760 INFO L471 AbstractCegarLoop]: Abstraction has 14542 states and 18490 transitions. [2025-01-08 22:57:20,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 18490 transitions. [2025-01-08 22:57:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-08 22:57:20,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:20,781 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:57:20,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:20,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -138705421, now seen corresponding path program 1 times [2025-01-08 22:57:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997238393] [2025-01-08 22:57:20,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:20,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-08 22:57:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-08 22:57:20,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:20,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-08 22:57:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997238393] [2025-01-08 22:57:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997238393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002135141] [2025-01-08 22:57:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:21,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:21,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:21,051 INFO L87 Difference]: Start difference. First operand 14542 states and 18490 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:22,152 INFO L93 Difference]: Finished difference Result 56869 states and 72355 transitions. [2025-01-08 22:57:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 362 [2025-01-08 22:57:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:22,224 INFO L225 Difference]: With dead ends: 56869 [2025-01-08 22:57:22,224 INFO L226 Difference]: Without dead ends: 42532 [2025-01-08 22:57:22,245 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-01-08 22:57:22,246 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 886 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:22,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 63 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:57:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42532 states. [2025-01-08 22:57:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42532 to 42519. [2025-01-08 22:57:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42519 states, 42518 states have (on average 1.2692506703043418) internal successors, (53966), 42518 states have internal predecessors, (53966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42519 states to 42519 states and 53966 transitions. [2025-01-08 22:57:22,855 INFO L78 Accepts]: Start accepts. Automaton has 42519 states and 53966 transitions. Word has length 362 [2025-01-08 22:57:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:22,855 INFO L471 AbstractCegarLoop]: Abstraction has 42519 states and 53966 transitions. [2025-01-08 22:57:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 42519 states and 53966 transitions. [2025-01-08 22:57:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 22:57:22,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:22,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:22,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:57:22,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:22,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 339352556, now seen corresponding path program 1 times [2025-01-08 22:57:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673608367] [2025-01-08 22:57:22,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 22:57:23,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 22:57:23,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:23,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 22:57:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673608367] [2025-01-08 22:57:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673608367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55982304] [2025-01-08 22:57:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:23,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:23,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:23,362 INFO L87 Difference]: Start difference. First operand 42519 states and 53966 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) [2025-01-08 22:57:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:24,185 INFO L93 Difference]: Finished difference Result 109092 states and 137911 transitions. [2025-01-08 22:57:24,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:24,186 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 409 [2025-01-08 22:57:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:24,291 INFO L225 Difference]: With dead ends: 109092 [2025-01-08 22:57:24,291 INFO L226 Difference]: Without dead ends: 66575 [2025-01-08 22:57:24,333 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-01-08 22:57:24,334 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 145 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:24,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 343 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66575 states. [2025-01-08 22:57:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66575 to 66473. [2025-01-08 22:57:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66473 states, 66472 states have (on average 1.2247412444337464) internal successors, (81411), 66472 states have internal predecessors, (81411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66473 states to 66473 states and 81411 transitions. [2025-01-08 22:57:25,190 INFO L78 Accepts]: Start accepts. Automaton has 66473 states and 81411 transitions. Word has length 409 [2025-01-08 22:57:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 66473 states and 81411 transitions. [2025-01-08 22:57:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-01-08 22:57:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 66473 states and 81411 transitions. [2025-01-08 22:57:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-08 22:57:25,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:25,260 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:25,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:57:25,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 633702064, now seen corresponding path program 1 times [2025-01-08 22:57:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644380449] [2025-01-08 22:57:25,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:25,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-08 22:57:25,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-08 22:57:25,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:25,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-01-08 22:57:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644380449] [2025-01-08 22:57:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644380449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914929784] [2025-01-08 22:57:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:25,629 INFO L87 Difference]: Start difference. First operand 66473 states and 81411 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:26,968 INFO L93 Difference]: Finished difference Result 178234 states and 218611 transitions. [2025-01-08 22:57:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-01-08 22:57:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:27,115 INFO L225 Difference]: With dead ends: 178234 [2025-01-08 22:57:27,116 INFO L226 Difference]: Without dead ends: 112169 [2025-01-08 22:57:27,152 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-01-08 22:57:27,153 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:27,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 376 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112169 states. [2025-01-08 22:57:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112169 to 109103. [2025-01-08 22:57:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109103 states, 109102 states have (on average 1.1612069439606973) internal successors, (126690), 109102 states have internal predecessors, (126690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109103 states to 109103 states and 126690 transitions. [2025-01-08 22:57:28,625 INFO L78 Accepts]: Start accepts. Automaton has 109103 states and 126690 transitions. Word has length 415 [2025-01-08 22:57:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:28,626 INFO L471 AbstractCegarLoop]: Abstraction has 109103 states and 126690 transitions. [2025-01-08 22:57:28,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 109103 states and 126690 transitions. [2025-01-08 22:57:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-08 22:57:28,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:28,718 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:28,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:57:28,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1960463087, now seen corresponding path program 1 times [2025-01-08 22:57:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126099523] [2025-01-08 22:57:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:28,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-08 22:57:28,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-08 22:57:28,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:28,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-08 22:57:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126099523] [2025-01-08 22:57:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126099523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060064320] [2025-01-08 22:57:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:29,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:29,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:29,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:29,139 INFO L87 Difference]: Start difference. First operand 109103 states and 126690 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:30,550 INFO L93 Difference]: Finished difference Result 260324 states and 301461 transitions. [2025-01-08 22:57:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-01-08 22:57:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:30,749 INFO L225 Difference]: With dead ends: 260324 [2025-01-08 22:57:30,749 INFO L226 Difference]: Without dead ends: 151832 [2025-01-08 22:57:30,787 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-01-08 22:57:30,788 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 190 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:30,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 123 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151832 states. [2025-01-08 22:57:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151832 to 137619. [2025-01-08 22:57:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137619 states, 137618 states have (on average 1.1520222645293494) internal successors, (158539), 137618 states have internal predecessors, (158539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137619 states to 137619 states and 158539 transitions. [2025-01-08 22:57:32,604 INFO L78 Accepts]: Start accepts. Automaton has 137619 states and 158539 transitions. Word has length 435 [2025-01-08 22:57:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:32,604 INFO L471 AbstractCegarLoop]: Abstraction has 137619 states and 158539 transitions. [2025-01-08 22:57:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 137619 states and 158539 transitions. [2025-01-08 22:57:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-08 22:57:32,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:32,692 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:57:32,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -114287605, now seen corresponding path program 1 times [2025-01-08 22:57:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475798759] [2025-01-08 22:57:32,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-08 22:57:32,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-08 22:57:32,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:32,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 141 proven. 6 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-08 22:57:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475798759] [2025-01-08 22:57:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475798759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936518527] [2025-01-08 22:57:33,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:33,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:33,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:57:33,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-08 22:57:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-08 22:57:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:33,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:33,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 22:57:33,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936518527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:33,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:33,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32994267] [2025-01-08 22:57:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:33,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:33,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:33,863 INFO L87 Difference]: Start difference. First operand 137619 states and 158539 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:35,090 INFO L93 Difference]: Finished difference Result 320526 states and 372045 transitions. [2025-01-08 22:57:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 442 [2025-01-08 22:57:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:35,343 INFO L225 Difference]: With dead ends: 320526 [2025-01-08 22:57:35,344 INFO L226 Difference]: Without dead ends: 183112 [2025-01-08 22:57:35,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:35,456 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:35,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 133 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183112 states. [2025-01-08 22:57:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183112 to 167054. [2025-01-08 22:57:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167054 states, 167053 states have (on average 1.1330176650524084) internal successors, (189274), 167053 states have internal predecessors, (189274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167054 states to 167054 states and 189274 transitions. [2025-01-08 22:57:37,999 INFO L78 Accepts]: Start accepts. Automaton has 167054 states and 189274 transitions. Word has length 442 [2025-01-08 22:57:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:38,000 INFO L471 AbstractCegarLoop]: Abstraction has 167054 states and 189274 transitions. [2025-01-08 22:57:38,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 167054 states and 189274 transitions. [2025-01-08 22:57:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-08 22:57:38,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:38,064 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:38,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:57:38,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 22:57:38,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1630686273, now seen corresponding path program 1 times [2025-01-08 22:57:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616228245] [2025-01-08 22:57:38,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:38,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-08 22:57:38,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-08 22:57:38,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:38,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 148 proven. 6 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2025-01-08 22:57:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616228245] [2025-01-08 22:57:38,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616228245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665431672] [2025-01-08 22:57:38,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:38,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:38,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:38,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:38,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:57:38,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-08 22:57:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-08 22:57:39,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:39,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:39,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:39,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-08 22:57:39,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665431672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:39,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192739293] [2025-01-08 22:57:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:39,243 INFO L87 Difference]: Start difference. First operand 167054 states and 189274 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 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-01-08 22:57:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:40,546 INFO L93 Difference]: Finished difference Result 336563 states and 381057 transitions. [2025-01-08 22:57:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:40,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 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 470 [2025-01-08 22:57:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:40,769 INFO L225 Difference]: With dead ends: 336563 [2025-01-08 22:57:40,769 INFO L226 Difference]: Without dead ends: 169714 [2025-01-08 22:57:40,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:40,850 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 134 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:40,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 47 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:57:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169714 states. [2025-01-08 22:57:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169714 to 167460. [2025-01-08 22:57:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167460 states, 167459 states have (on average 1.1322054950764067) internal successors, (189598), 167459 states have internal predecessors, (189598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167460 states to 167460 states and 189598 transitions. [2025-01-08 22:57:42,933 INFO L78 Accepts]: Start accepts. Automaton has 167460 states and 189598 transitions. Word has length 470 [2025-01-08 22:57:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:42,933 INFO L471 AbstractCegarLoop]: Abstraction has 167460 states and 189598 transitions. [2025-01-08 22:57:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 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-01-08 22:57:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 167460 states and 189598 transitions. [2025-01-08 22:57:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-08 22:57:43,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:43,032 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:43,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:57:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:43,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -947570798, now seen corresponding path program 1 times [2025-01-08 22:57:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008079414] [2025-01-08 22:57:43,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:43,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-08 22:57:43,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-08 22:57:43,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:43,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-01-08 22:57:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008079414] [2025-01-08 22:57:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008079414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194182526] [2025-01-08 22:57:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:44,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:44,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:57:44,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-08 22:57:44,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-08 22:57:44,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:44,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:44,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:57:44,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-08 22:57:44,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194182526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455765285] [2025-01-08 22:57:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:44,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:44,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:44,427 INFO L87 Difference]: Start difference. First operand 167460 states and 189598 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:45,840 INFO L93 Difference]: Finished difference Result 299722 states and 338587 transitions. [2025-01-08 22:57:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:45,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 535 [2025-01-08 22:57:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:46,038 INFO L225 Difference]: With dead ends: 299722 [2025-01-08 22:57:46,038 INFO L226 Difference]: Without dead ends: 132467 [2025-01-08 22:57:46,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:46,091 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 218 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:46,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 342 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132467 states. [2025-01-08 22:57:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132467 to 132435. [2025-01-08 22:57:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132435 states, 132434 states have (on average 1.1149478230665841) internal successors, (147657), 132434 states have internal predecessors, (147657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132435 states to 132435 states and 147657 transitions. [2025-01-08 22:57:47,780 INFO L78 Accepts]: Start accepts. Automaton has 132435 states and 147657 transitions. Word has length 535 [2025-01-08 22:57:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:47,780 INFO L471 AbstractCegarLoop]: Abstraction has 132435 states and 147657 transitions. [2025-01-08 22:57:47,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132435 states and 147657 transitions. [2025-01-08 22:57:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-01-08 22:57:47,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:47,846 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:47,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:57:48,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:48,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:48,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash 574830312, now seen corresponding path program 1 times [2025-01-08 22:57:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439005003] [2025-01-08 22:57:48,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:48,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-01-08 22:57:48,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-01-08 22:57:48,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:48,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-01-08 22:57:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:48,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439005003] [2025-01-08 22:57:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439005003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:48,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:48,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478943002] [2025-01-08 22:57:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:48,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:48,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:48,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:48,290 INFO L87 Difference]: Start difference. First operand 132435 states and 147657 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:49,543 INFO L93 Difference]: Finished difference Result 293818 states and 327232 transitions. [2025-01-08 22:57:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 540 [2025-01-08 22:57:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:49,760 INFO L225 Difference]: With dead ends: 293818 [2025-01-08 22:57:49,760 INFO L226 Difference]: Without dead ends: 161588 [2025-01-08 22:57:49,857 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-01-08 22:57:49,858 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:49,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 150 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161588 states. [2025-01-08 22:57:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161588 to 144209. [2025-01-08 22:57:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144209 states, 144208 states have (on average 1.1136830134250526) internal successors, (160602), 144208 states have internal predecessors, (160602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144209 states to 144209 states and 160602 transitions. [2025-01-08 22:57:51,739 INFO L78 Accepts]: Start accepts. Automaton has 144209 states and 160602 transitions. Word has length 540 [2025-01-08 22:57:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:51,739 INFO L471 AbstractCegarLoop]: Abstraction has 144209 states and 160602 transitions. [2025-01-08 22:57:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 144209 states and 160602 transitions. [2025-01-08 22:57:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-08 22:57:51,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:51,807 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:57:51,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -322633057, now seen corresponding path program 1 times [2025-01-08 22:57:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416706954] [2025-01-08 22:57:51,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:51,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-08 22:57:52,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-08 22:57:52,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:52,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2025-01-08 22:57:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416706954] [2025-01-08 22:57:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416706954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636958208] [2025-01-08 22:57:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:52,262 INFO L87 Difference]: Start difference. First operand 144209 states and 160602 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-01-08 22:57:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:53,503 INFO L93 Difference]: Finished difference Result 264998 states and 295001 transitions. [2025-01-08 22:57:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:53,503 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 545 [2025-01-08 22:57:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:53,658 INFO L225 Difference]: With dead ends: 264998 [2025-01-08 22:57:53,658 INFO L226 Difference]: Without dead ends: 120791 [2025-01-08 22:57:53,702 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-01-08 22:57:53,702 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 251 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:53,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 324 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:57:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120791 states. [2025-01-08 22:57:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120791 to 86016. [2025-01-08 22:57:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86016 states, 86015 states have (on average 1.0918909492530373) internal successors, (93919), 86015 states have internal predecessors, (93919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86016 states to 86016 states and 93919 transitions. [2025-01-08 22:57:55,086 INFO L78 Accepts]: Start accepts. Automaton has 86016 states and 93919 transitions. Word has length 545 [2025-01-08 22:57:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:55,087 INFO L471 AbstractCegarLoop]: Abstraction has 86016 states and 93919 transitions. [2025-01-08 22:57:55,087 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-01-08 22:57:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 86016 states and 93919 transitions. [2025-01-08 22:57:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-01-08 22:57:55,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:55,136 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:57:55,136 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -376857805, now seen corresponding path program 1 times [2025-01-08 22:57:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459567766] [2025-01-08 22:57:55,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:55,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-01-08 22:57:55,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-01-08 22:57:55,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-01-08 22:57:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459567766] [2025-01-08 22:57:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459567766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632740104] [2025-01-08 22:57:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:55,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:55,331 INFO L87 Difference]: Start difference. First operand 86016 states and 93919 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:56,099 INFO L93 Difference]: Finished difference Result 236019 states and 257623 transitions. [2025-01-08 22:57:56,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:56,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 551 [2025-01-08 22:57:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:56,280 INFO L225 Difference]: With dead ends: 236019 [2025-01-08 22:57:56,280 INFO L226 Difference]: Without dead ends: 150005 [2025-01-08 22:57:56,345 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-01-08 22:57:56,346 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 299 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:56,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 857 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:57:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150005 states. [2025-01-08 22:57:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150005 to 138243. [2025-01-08 22:57:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138243 states, 138242 states have (on average 1.086124332691946) internal successors, (150148), 138242 states have internal predecessors, (150148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)