./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label29.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/Problem13_label29.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 8f598b1db7f2b2cd1017a328f20419506fd47df23c7e336ea67891b462314c30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:53:08,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:53:08,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:53:08,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:53:08,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:53:08,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:53:08,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:53:08,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:53:08,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:53:08,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:53:08,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:53:08,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:53:08,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:53:08,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:53:08,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:53:08,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:53:08,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:53:08,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:53:08,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:53:08,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:53:08,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:08,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:08,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:08,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:53:08,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:53:08,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:53:08,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:53:08,656 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 -> 8f598b1db7f2b2cd1017a328f20419506fd47df23c7e336ea67891b462314c30 [2025-01-08 23:53:08,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:53:08,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:53:08,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:53:08,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:53:08,945 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:53:08,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label29.c [2025-01-08 23:53:10,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3d67763/a281542ab7d24558b2d4ea40281864e4/FLAG7cbcd6ede [2025-01-08 23:53:10,726 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:53:10,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label29.c [2025-01-08 23:53:10,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3d67763/a281542ab7d24558b2d4ea40281864e4/FLAG7cbcd6ede [2025-01-08 23:53:11,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3d67763/a281542ab7d24558b2d4ea40281864e4 [2025-01-08 23:53:11,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:53:11,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:53:11,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:11,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:53:11,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:53:11,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:11" (1/1) ... [2025-01-08 23:53:11,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b30b193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:11, skipping insertion in model container [2025-01-08 23:53:11,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:11" (1/1) ... [2025-01-08 23:53:11,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:53:11,552 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/Problem13_label29.c[2333,2346] [2025-01-08 23:53:12,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:12,206 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:53:12,221 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/Problem13_label29.c[2333,2346] [2025-01-08 23:53:12,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:12,606 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:53:12,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12 WrapperNode [2025-01-08 23:53:12,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:12,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:12,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:53:12,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:53:12,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:12,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,226 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:53:13,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:13,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:53:13,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:53:13,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:53:13,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,577 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 23:53:13,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:53:13,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:53:13,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:53:13,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:53:13,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (1/1) ... [2025-01-08 23:53:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:53:13,955 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 23:53:13,958 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 23:53:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:53:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:53:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:53:13,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:53:14,043 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:53:14,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:53:19,656 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:53:19,657 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:53:19,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:53:19,702 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:53:19,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:19 BoogieIcfgContainer [2025-01-08 23:53:19,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:53:19,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:53:19,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:53:19,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:53:19,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:53:11" (1/3) ... [2025-01-08 23:53:19,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e68012c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:19, skipping insertion in model container [2025-01-08 23:53:19,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:12" (2/3) ... [2025-01-08 23:53:19,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e68012c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:19, skipping insertion in model container [2025-01-08 23:53:19,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:19" (3/3) ... [2025-01-08 23:53:19,713 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label29.c [2025-01-08 23:53:19,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:53:19,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label29.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:53:19,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:53:19,839 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;@7d09c83a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:53:19,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:53:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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 23:53:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 23:53:19,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:19,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:19,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -649285462, now seen corresponding path program 1 times [2025-01-08 23:53:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335388063] [2025-01-08 23:53:19,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 23:53:19,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 23:53:19,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:20,097 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 23:53:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335388063] [2025-01-08 23:53:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335388063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466689665] [2025-01-08 23:53:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:20,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:20,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:20,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:20,123 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 23:53:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:23,820 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-01-08 23:53:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-01-08 23:53:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:23,850 INFO L225 Difference]: With dead ends: 3035 [2025-01-08 23:53:23,852 INFO L226 Difference]: Without dead ends: 1873 [2025-01-08 23:53:23,861 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 23:53:23,864 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 891 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:23,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:53:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-08 23:53:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-01-08 23:53:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 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 23:53:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-01-08 23:53:23,972 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 14 [2025-01-08 23:53:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:23,972 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-01-08 23:53:23,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 23:53:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-01-08 23:53:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-08 23:53:23,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:23,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:23,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:53:23,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 718875669, now seen corresponding path program 1 times [2025-01-08 23:53:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846200502] [2025-01-08 23:53:23,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:23,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-08 23:53:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-08 23:53:24,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:24,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:24,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846200502] [2025-01-08 23:53:24,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846200502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:24,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:24,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:24,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232427938] [2025-01-08 23:53:24,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:24,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:24,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:24,316 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 23:53:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:28,357 INFO L93 Difference]: Finished difference Result 5405 states and 8404 transitions. [2025-01-08 23:53:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-08 23:53:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:28,372 INFO L225 Difference]: With dead ends: 5405 [2025-01-08 23:53:28,372 INFO L226 Difference]: Without dead ends: 3548 [2025-01-08 23:53:28,374 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 23:53:28,375 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 862 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:28,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1040 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:53:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-01-08 23:53:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3476. [2025-01-08 23:53:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.4897841726618706) internal successors, (5177), 3475 states have internal predecessors, (5177), 0 states have call successors, (0), 0 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 23:53:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5177 transitions. [2025-01-08 23:53:28,442 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5177 transitions. Word has length 86 [2025-01-08 23:53:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5177 transitions. [2025-01-08 23:53:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 23:53:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5177 transitions. [2025-01-08 23:53:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:53:28,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:28,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:53:28,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -57226644, now seen corresponding path program 1 times [2025-01-08 23:53:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785728506] [2025-01-08 23:53:28,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:28,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:53:28,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:53:28,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:28,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785728506] [2025-01-08 23:53:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785728506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978683091] [2025-01-08 23:53:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:28,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:28,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:28,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:28,656 INFO L87 Difference]: Start difference. First operand 3476 states and 5177 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 23:53:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:31,497 INFO L93 Difference]: Finished difference Result 10140 states and 15128 transitions. [2025-01-08 23:53:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:31,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-08 23:53:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:31,524 INFO L225 Difference]: With dead ends: 10140 [2025-01-08 23:53:31,525 INFO L226 Difference]: Without dead ends: 6666 [2025-01-08 23:53:31,530 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 23:53:31,533 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 964 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:31,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 847 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:53:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2025-01-08 23:53:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6659. [2025-01-08 23:53:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.364373685791529) internal successors, (9084), 6658 states have internal predecessors, (9084), 0 states have call successors, (0), 0 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 23:53:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 9084 transitions. [2025-01-08 23:53:31,655 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 9084 transitions. Word has length 100 [2025-01-08 23:53:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:31,655 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 9084 transitions. [2025-01-08 23:53:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 23:53:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 9084 transitions. [2025-01-08 23:53:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-08 23:53:31,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:31,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:53:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:53:31,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1131288527, now seen corresponding path program 1 times [2025-01-08 23:53:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579835704] [2025-01-08 23:53:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:31,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-08 23:53:31,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-08 23:53:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 23:53:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579835704] [2025-01-08 23:53:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579835704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:31,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956617867] [2025-01-08 23:53:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:31,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:31,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:31,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:31,870 INFO L87 Difference]: Start difference. First operand 6659 states and 9084 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:53:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:34,866 INFO L93 Difference]: Finished difference Result 19670 states and 26834 transitions. [2025-01-08 23:53:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:34,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-08 23:53:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:34,905 INFO L225 Difference]: With dead ends: 19670 [2025-01-08 23:53:34,905 INFO L226 Difference]: Without dead ends: 13013 [2025-01-08 23:53:34,916 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 23:53:34,916 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 920 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:34,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 595 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:53:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13013 states. [2025-01-08 23:53:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13013 to 13006. [2025-01-08 23:53:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13006 states, 13005 states have (on average 1.3021914648212225) internal successors, (16935), 13005 states have internal predecessors, (16935), 0 states have call successors, (0), 0 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 23:53:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13006 states to 13006 states and 16935 transitions. [2025-01-08 23:53:35,146 INFO L78 Accepts]: Start accepts. Automaton has 13006 states and 16935 transitions. Word has length 103 [2025-01-08 23:53:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:35,147 INFO L471 AbstractCegarLoop]: Abstraction has 13006 states and 16935 transitions. [2025-01-08 23:53:35,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:53:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13006 states and 16935 transitions. [2025-01-08 23:53:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 23:53:35,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:35,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:53:35,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:53:35,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1060408617, now seen corresponding path program 1 times [2025-01-08 23:53:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:35,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397425362] [2025-01-08 23:53:35,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:35,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 23:53:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 23:53:35,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:35,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:35,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:35,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397425362] [2025-01-08 23:53:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397425362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:35,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124843540] [2025-01-08 23:53:35,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:35,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:53:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:35,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:53:35,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:53:35,603 INFO L87 Difference]: Start difference. First operand 13006 states and 16935 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 23:53:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:39,988 INFO L93 Difference]: Finished difference Result 37824 states and 49430 transitions. [2025-01-08 23:53:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:53:39,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-08 23:53:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:40,044 INFO L225 Difference]: With dead ends: 37824 [2025-01-08 23:53:40,044 INFO L226 Difference]: Without dead ends: 24820 [2025-01-08 23:53:40,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:53:40,059 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 2536 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 4146 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 4936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 4146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:40,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 1014 Invalid, 4936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 4146 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-08 23:53:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2025-01-08 23:53:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 24819. [2025-01-08 23:53:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24819 states, 24818 states have (on average 1.2425255862680313) internal successors, (30837), 24818 states have internal predecessors, (30837), 0 states have call successors, (0), 0 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 23:53:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24819 states to 24819 states and 30837 transitions. [2025-01-08 23:53:40,540 INFO L78 Accepts]: Start accepts. Automaton has 24819 states and 30837 transitions. Word has length 119 [2025-01-08 23:53:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:40,542 INFO L471 AbstractCegarLoop]: Abstraction has 24819 states and 30837 transitions. [2025-01-08 23:53:40,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 23:53:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24819 states and 30837 transitions. [2025-01-08 23:53:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-08 23:53:40,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:40,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 23:53:40,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:53:40,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -726988864, now seen corresponding path program 1 times [2025-01-08 23:53:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507608554] [2025-01-08 23:53:40,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-08 23:53:40,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-08 23:53:40,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:40,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 23:53:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507608554] [2025-01-08 23:53:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507608554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:41,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:41,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675911844] [2025-01-08 23:53:41,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:41,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:41,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:41,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:41,048 INFO L87 Difference]: Start difference. First operand 24819 states and 30837 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 23:53:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:44,205 INFO L93 Difference]: Finished difference Result 70094 states and 87845 transitions. [2025-01-08 23:53:44,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:44,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 188 [2025-01-08 23:53:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:44,295 INFO L225 Difference]: With dead ends: 70094 [2025-01-08 23:53:44,295 INFO L226 Difference]: Without dead ends: 46064 [2025-01-08 23:53:44,318 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 23:53:44,320 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 884 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:44,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 985 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:53:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46064 states. [2025-01-08 23:53:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46064 to 41334. [2025-01-08 23:53:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41334 states, 41333 states have (on average 1.1938886603924226) internal successors, (49347), 41333 states have internal predecessors, (49347), 0 states have call successors, (0), 0 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 23:53:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41334 states to 41334 states and 49347 transitions. [2025-01-08 23:53:44,947 INFO L78 Accepts]: Start accepts. Automaton has 41334 states and 49347 transitions. Word has length 188 [2025-01-08 23:53:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 41334 states and 49347 transitions. [2025-01-08 23:53:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 23:53:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41334 states and 49347 transitions. [2025-01-08 23:53:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 23:53:44,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:44,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 23:53:44,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:53:44,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:44,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1226056881, now seen corresponding path program 1 times [2025-01-08 23:53:44,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:44,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917780176] [2025-01-08 23:53:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 23:53:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 23:53:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917780176] [2025-01-08 23:53:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917780176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:53:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819287849] [2025-01-08 23:53:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:53:45,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:53:45,616 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 23:53:45,618 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 23:53:45,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 23:53:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 23:53:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:45,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:53:45,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:53:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:46,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:53:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819287849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:53:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:53:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079366631] [2025-01-08 23:53:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:46,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:46,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:53:46,268 INFO L87 Difference]: Start difference. First operand 41334 states and 49347 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 23:53:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:49,708 INFO L93 Difference]: Finished difference Result 105481 states and 127970 transitions. [2025-01-08 23:53:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-01-08 23:53:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:49,819 INFO L225 Difference]: With dead ends: 105481 [2025-01-08 23:53:49,820 INFO L226 Difference]: Without dead ends: 71242 [2025-01-08 23:53:49,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:53:49,851 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 727 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:49,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1175 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:53:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71242 states. [2025-01-08 23:53:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71242 to 65730. [2025-01-08 23:53:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65730 states, 65729 states have (on average 1.147895145217484) internal successors, (75450), 65729 states have internal predecessors, (75450), 0 states have call successors, (0), 0 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 23:53:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65730 states to 65730 states and 75450 transitions. [2025-01-08 23:53:50,657 INFO L78 Accepts]: Start accepts. Automaton has 65730 states and 75450 transitions. Word has length 226 [2025-01-08 23:53:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:50,657 INFO L471 AbstractCegarLoop]: Abstraction has 65730 states and 75450 transitions. [2025-01-08 23:53:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 23:53:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 65730 states and 75450 transitions. [2025-01-08 23:53:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-08 23:53:50,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:50,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:53:50,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:53:50,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:53:50,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:50,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1712843174, now seen corresponding path program 1 times [2025-01-08 23:53:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165919471] [2025-01-08 23:53:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-08 23:53:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-08 23:53:50,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:50,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 23:53:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165919471] [2025-01-08 23:53:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165919471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019681338] [2025-01-08 23:53:51,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:51,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:51,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:51,200 INFO L87 Difference]: Start difference. First operand 65730 states and 75450 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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 23:53:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:54,880 INFO L93 Difference]: Finished difference Result 159014 states and 184732 transitions. [2025-01-08 23:53:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 250 [2025-01-08 23:53:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:55,044 INFO L225 Difference]: With dead ends: 159014 [2025-01-08 23:53:55,044 INFO L226 Difference]: Without dead ends: 94073 [2025-01-08 23:53:55,100 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 23:53:55,101 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 887 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:55,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 927 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:53:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94073 states. [2025-01-08 23:53:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94073 to 63344. [2025-01-08 23:53:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63344 states, 63343 states have (on average 1.161059627741029) internal successors, (73545), 63343 states have internal predecessors, (73545), 0 states have call successors, (0), 0 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 23:53:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63344 states to 63344 states and 73545 transitions. [2025-01-08 23:53:55,967 INFO L78 Accepts]: Start accepts. Automaton has 63344 states and 73545 transitions. Word has length 250 [2025-01-08 23:53:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:55,967 INFO L471 AbstractCegarLoop]: Abstraction has 63344 states and 73545 transitions. [2025-01-08 23:53:55,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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 23:53:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 63344 states and 73545 transitions. [2025-01-08 23:53:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-08 23:53:55,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:55,972 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:55,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:53:55,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:55,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash -813769660, now seen corresponding path program 1 times [2025-01-08 23:53:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:55,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162794864] [2025-01-08 23:53:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-08 23:53:56,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-08 23:53:56,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:56,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 23:53:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162794864] [2025-01-08 23:53:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162794864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572381449] [2025-01-08 23:53:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:53:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:56,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:53:56,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:53:56,208 INFO L87 Difference]: Start difference. First operand 63344 states and 73545 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:02,463 INFO L93 Difference]: Finished difference Result 182771 states and 213966 transitions. [2025-01-08 23:54:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:54:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2025-01-08 23:54:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:02,600 INFO L225 Difference]: With dead ends: 182771 [2025-01-08 23:54:02,601 INFO L226 Difference]: Without dead ends: 120216 [2025-01-08 23:54:02,637 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 23:54:02,637 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1719 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 6948 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 7970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 6948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:02,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 962 Invalid, 7970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1022 Valid, 6948 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-08 23:54:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120216 states. [2025-01-08 23:54:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120216 to 119308. [2025-01-08 23:54:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119308 states, 119307 states have (on average 1.1524051396816617) internal successors, (137490), 119307 states have internal predecessors, (137490), 0 states have call successors, (0), 0 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 23:54:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119308 states to 119308 states and 137490 transitions. [2025-01-08 23:54:03,670 INFO L78 Accepts]: Start accepts. Automaton has 119308 states and 137490 transitions. Word has length 302 [2025-01-08 23:54:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:03,670 INFO L471 AbstractCegarLoop]: Abstraction has 119308 states and 137490 transitions. [2025-01-08 23:54:03,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 119308 states and 137490 transitions. [2025-01-08 23:54:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-08 23:54:03,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:03,673 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:54:03,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:54:03,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1906415295, now seen corresponding path program 1 times [2025-01-08 23:54:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949831039] [2025-01-08 23:54:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:03,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-08 23:54:03,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-08 23:54:03,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:03,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:54:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949831039] [2025-01-08 23:54:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949831039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:04,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732023804] [2025-01-08 23:54:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:04,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:04,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:04,527 INFO L87 Difference]: Start difference. First operand 119308 states and 137490 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 23:54:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:07,738 INFO L93 Difference]: Finished difference Result 237825 states and 274185 transitions. [2025-01-08 23:54:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 339 [2025-01-08 23:54:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:07,873 INFO L225 Difference]: With dead ends: 237825 [2025-01-08 23:54:07,873 INFO L226 Difference]: Without dead ends: 119306 [2025-01-08 23:54:07,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:07,906 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1196 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:07,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1440 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:54:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119306 states. [2025-01-08 23:54:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119306 to 116944. [2025-01-08 23:54:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116944 states, 116943 states have (on average 1.1113106385162002) internal successors, (129960), 116943 states have internal predecessors, (129960), 0 states have call successors, (0), 0 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 23:54:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116944 states to 116944 states and 129960 transitions. [2025-01-08 23:54:09,212 INFO L78 Accepts]: Start accepts. Automaton has 116944 states and 129960 transitions. Word has length 339 [2025-01-08 23:54:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:09,212 INFO L471 AbstractCegarLoop]: Abstraction has 116944 states and 129960 transitions. [2025-01-08 23:54:09,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 23:54:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116944 states and 129960 transitions. [2025-01-08 23:54:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-08 23:54:09,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:09,222 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:09,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:54:09,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1857794310, now seen corresponding path program 1 times [2025-01-08 23:54:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279494832] [2025-01-08 23:54:09,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:09,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-08 23:54:09,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-08 23:54:09,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 321 proven. 113 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:54:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279494832] [2025-01-08 23:54:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279494832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249976821] [2025-01-08 23:54:10,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:10,855 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 23:54:10,857 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 23:54:10,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-08 23:54:10,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-08 23:54:10,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:10,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:10,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:54:10,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-08 23:54:11,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249976821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-01-08 23:54:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710964054] [2025-01-08 23:54:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:11,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:11,624 INFO L87 Difference]: Start difference. First operand 116944 states and 129960 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 23:54:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:14,466 INFO L93 Difference]: Finished difference Result 237048 states and 263255 transitions. [2025-01-08 23:54:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 405 [2025-01-08 23:54:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:14,774 INFO L225 Difference]: With dead ends: 237048 [2025-01-08 23:54:14,774 INFO L226 Difference]: Without dead ends: 120893 [2025-01-08 23:54:14,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:14,817 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 685 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:14,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1184 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:54:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120893 states. [2025-01-08 23:54:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120893 to 118522. [2025-01-08 23:54:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118522 states, 118521 states have (on average 1.1106301836805292) internal successors, (131633), 118521 states have internal predecessors, (131633), 0 states have call successors, (0), 0 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 23:54:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118522 states to 118522 states and 131633 transitions. [2025-01-08 23:54:16,085 INFO L78 Accepts]: Start accepts. Automaton has 118522 states and 131633 transitions. Word has length 405 [2025-01-08 23:54:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:16,085 INFO L471 AbstractCegarLoop]: Abstraction has 118522 states and 131633 transitions. [2025-01-08 23:54:16,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 23:54:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 118522 states and 131633 transitions. [2025-01-08 23:54:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-08 23:54:16,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:16,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:16,103 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 23:54:16,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:16,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:16,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1214011468, now seen corresponding path program 1 times [2025-01-08 23:54:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:16,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381654237] [2025-01-08 23:54:16,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-08 23:54:16,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-08 23:54:16,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:16,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:54:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381654237] [2025-01-08 23:54:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381654237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181183626] [2025-01-08 23:54:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:16,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:16,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:16,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:16,829 INFO L87 Difference]: Start difference. First operand 118522 states and 131633 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 23:54:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:20,280 INFO L93 Difference]: Finished difference Result 274047 states and 307295 transitions. [2025-01-08 23:54:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2025-01-08 23:54:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:20,453 INFO L225 Difference]: With dead ends: 274047 [2025-01-08 23:54:20,453 INFO L226 Difference]: Without dead ends: 156314 [2025-01-08 23:54:20,512 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 23:54:20,513 INFO L435 NwaCegarLoop]: 1836 mSDtfsCounter, 770 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:20,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1988 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:54:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156314 states. [2025-01-08 23:54:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156314 to 150787. [2025-01-08 23:54:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150787 states, 150786 states have (on average 1.0951480906715478) internal successors, (165133), 150786 states have internal predecessors, (165133), 0 states have call successors, (0), 0 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 23:54:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150787 states to 150787 states and 165133 transitions. [2025-01-08 23:54:22,443 INFO L78 Accepts]: Start accepts. Automaton has 150787 states and 165133 transitions. Word has length 408 [2025-01-08 23:54:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 150787 states and 165133 transitions. [2025-01-08 23:54:22,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 23:54:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 150787 states and 165133 transitions. [2025-01-08 23:54:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-08 23:54:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:22,450 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:22,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:54:22,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash -135018778, now seen corresponding path program 1 times [2025-01-08 23:54:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919637475] [2025-01-08 23:54:22,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:22,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-08 23:54:22,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-08 23:54:22,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:22,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-08 23:54:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919637475] [2025-01-08 23:54:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919637475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:22,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:22,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335698355] [2025-01-08 23:54:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:22,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:22,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:22,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:22,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:22,731 INFO L87 Difference]: Start difference. First operand 150787 states and 165133 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)