./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label57.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/Problem12_label57.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 6b5f9be82810a895126d332df54c5a2750e68d4ab931247c71898627df874adb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:49:39,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:49:40,025 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:49:40,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:49:40,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:49:40,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:49:40,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:49:40,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:49:40,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:49:40,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:49:40,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:49:40,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:49:40,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:49:40,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:49:40,052 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:49:40,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:49:40,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:49:40,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:49:40,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:49:40,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:40,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:40,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:40,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:49:40,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:49:40,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:49:40,056 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 -> 6b5f9be82810a895126d332df54c5a2750e68d4ab931247c71898627df874adb [2025-01-08 23:49:40,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:49:40,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:49:40,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:49:40,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:49:40,320 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:49:40,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label57.c [2025-01-08 23:49:41,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85f4ad16b/542dc0b038a044229262ccdf26bdd843/FLAGeab2fc492 [2025-01-08 23:49:42,235 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:49:42,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label57.c [2025-01-08 23:49:42,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85f4ad16b/542dc0b038a044229262ccdf26bdd843/FLAGeab2fc492 [2025-01-08 23:49:42,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85f4ad16b/542dc0b038a044229262ccdf26bdd843 [2025-01-08 23:49:42,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:49:42,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:49:42,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:42,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:49:42,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:49:42,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:42" (1/1) ... [2025-01-08 23:49:42,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee4a37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:42, skipping insertion in model container [2025-01-08 23:49:42,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:42" (1/1) ... [2025-01-08 23:49:42,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:49:43,066 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/Problem12_label57.c[4795,4808] [2025-01-08 23:49:43,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:43,698 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:49:43,721 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/Problem12_label57.c[4795,4808] [2025-01-08 23:49:44,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:44,079 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:49:44,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44 WrapperNode [2025-01-08 23:49:44,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:44,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:44,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:49:44,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:49:44,090 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:49:44" (1/1) ... [2025-01-08 23:49:44,134 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:49:44" (1/1) ... [2025-01-08 23:49:44,450 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:49:44,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:44,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:49:44,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:49:44,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:49:44,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,683 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:49:44,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:44,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:45,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:49:45,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:49:45,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:49:45,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:49:45,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (1/1) ... [2025-01-08 23:49:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:49:45,046 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:49:45,049 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:49:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:49:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:49:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:49:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:49:45,135 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:49:45,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:49:49,561 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:49:49,562 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:49:49,596 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:49:49,596 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:49:49,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:49 BoogieIcfgContainer [2025-01-08 23:49:49,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:49:49,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:49:49,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:49:49,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:49:49,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:49:42" (1/3) ... [2025-01-08 23:49:49,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0c1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:49, skipping insertion in model container [2025-01-08 23:49:49,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:44" (2/3) ... [2025-01-08 23:49:49,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0c1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:49, skipping insertion in model container [2025-01-08 23:49:49,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:49" (3/3) ... [2025-01-08 23:49:49,612 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label57.c [2025-01-08 23:49:49,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:49:49,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label57.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:49:49,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:49:49,733 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;@3df277ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:49:49,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:49:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 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:49:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 23:49:49,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:49,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:49,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:49,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1047782724, now seen corresponding path program 1 times [2025-01-08 23:49:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131770047] [2025-01-08 23:49:49,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:49,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:49,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 23:49:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 23:49:49,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:50,115 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:49:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131770047] [2025-01-08 23:49:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131770047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836913321] [2025-01-08 23:49:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:50,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:50,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:50,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:50,150 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:49:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:53,856 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-01-08 23:49:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-01-08 23:49:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:53,874 INFO L225 Difference]: With dead ends: 2404 [2025-01-08 23:49:53,875 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:49:53,881 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:49:53,883 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 783 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:53,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:49:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:49:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:49:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 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:49:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-01-08 23:49:54,002 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 37 [2025-01-08 23:49:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:54,002 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-01-08 23:49:54,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:49:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-01-08 23:49:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 23:49:54,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:54,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:49:54,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1435065669, now seen corresponding path program 1 times [2025-01-08 23:49:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253944054] [2025-01-08 23:49:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:54,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 23:49:54,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 23:49:54,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:54,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253944054] [2025-01-08 23:49:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253944054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771738873] [2025-01-08 23:49:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:54,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:54,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:54,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:54,296 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 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:49:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:57,321 INFO L93 Difference]: Finished difference Result 4512 states and 7249 transitions. [2025-01-08 23:49:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:57,324 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 112 [2025-01-08 23:49:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:57,336 INFO L225 Difference]: With dead ends: 4512 [2025-01-08 23:49:57,337 INFO L226 Difference]: Without dead ends: 3008 [2025-01-08 23:49:57,340 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:49:57,341 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:57,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 449 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:49:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-08 23:49:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-08 23:49:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4156967076820752) internal successors, (4257), 3007 states have internal predecessors, (4257), 0 states have call successors, (0), 0 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:49:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4257 transitions. [2025-01-08 23:49:57,419 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4257 transitions. Word has length 112 [2025-01-08 23:49:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:57,420 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4257 transitions. [2025-01-08 23:49:57,420 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:49:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4257 transitions. [2025-01-08 23:49:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 23:49:57,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:57,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:49:57,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:57,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash -985532726, now seen corresponding path program 1 times [2025-01-08 23:49:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328079501] [2025-01-08 23:49:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:57,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-08 23:49:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-08 23:49:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328079501] [2025-01-08 23:49:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328079501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257410625] [2025-01-08 23:49:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:49:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:57,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:49:57,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:49:57,781 INFO L87 Difference]: Start difference. First operand 3008 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 28.5) 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:50:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:01,768 INFO L93 Difference]: Finished difference Result 9769 states and 13601 transitions. [2025-01-08 23:50:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) 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 114 [2025-01-08 23:50:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:01,798 INFO L225 Difference]: With dead ends: 9769 [2025-01-08 23:50:01,799 INFO L226 Difference]: Without dead ends: 6763 [2025-01-08 23:50:01,805 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:50:01,806 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:01,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-08 23:50:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-08 23:50:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-01-08 23:50:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3510795622596865) internal successors, (9136), 6762 states have internal predecessors, (9136), 0 states have call successors, (0), 0 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:50:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9136 transitions. [2025-01-08 23:50:01,936 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9136 transitions. Word has length 114 [2025-01-08 23:50:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:01,937 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9136 transitions. [2025-01-08 23:50:01,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) 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:50:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9136 transitions. [2025-01-08 23:50:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 23:50:01,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:01,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:50:01,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1500407658, now seen corresponding path program 1 times [2025-01-08 23:50:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395967290] [2025-01-08 23:50:01,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:01,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 23:50:02,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 23:50:02,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:02,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 23:50:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395967290] [2025-01-08 23:50:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395967290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857585228] [2025-01-08 23:50:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:02,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:02,495 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:50:02,497 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:50:02,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 23:50:02,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 23:50:02,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:02,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:02,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:02,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:50:02,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857585228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:02,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:50:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224308566] [2025-01-08 23:50:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:02,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:02,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:50:02,857 INFO L87 Difference]: Start difference. First operand 6763 states and 9136 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:50:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:05,338 INFO L93 Difference]: Finished difference Result 18781 states and 25889 transitions. [2025-01-08 23:50:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 178 [2025-01-08 23:50:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:05,369 INFO L225 Difference]: With dead ends: 18781 [2025-01-08 23:50:05,369 INFO L226 Difference]: Without dead ends: 12771 [2025-01-08 23:50:05,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:50:05,379 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 635 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:05,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 613 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:50:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2025-01-08 23:50:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12020. [2025-01-08 23:50:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2758964972127464) internal successors, (15335), 12019 states have internal predecessors, (15335), 0 states have call successors, (0), 0 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:50:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 15335 transitions. [2025-01-08 23:50:05,639 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 15335 transitions. Word has length 178 [2025-01-08 23:50:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 15335 transitions. [2025-01-08 23:50:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:50:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 15335 transitions. [2025-01-08 23:50:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-08 23:50:05,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:05,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:05,653 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:50:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:05,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1652771261, now seen corresponding path program 1 times [2025-01-08 23:50:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821233236] [2025-01-08 23:50:05,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:05,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-08 23:50:05,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-08 23:50:05,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:05,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 23:50:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821233236] [2025-01-08 23:50:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821233236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830238088] [2025-01-08 23:50:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:06,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:06,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:06,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:06,174 INFO L87 Difference]: Start difference. First operand 12020 states and 15335 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:50:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:09,109 INFO L93 Difference]: Finished difference Result 27830 states and 35168 transitions. [2025-01-08 23:50:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-01-08 23:50:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:09,144 INFO L225 Difference]: With dead ends: 27830 [2025-01-08 23:50:09,145 INFO L226 Difference]: Without dead ends: 16526 [2025-01-08 23:50:09,152 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:50:09,153 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:09,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:50:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-01-08 23:50:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15775. [2025-01-08 23:50:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2119310257385572) internal successors, (19117), 15774 states have internal predecessors, (19117), 0 states have call successors, (0), 0 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:50:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19117 transitions. [2025-01-08 23:50:09,387 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19117 transitions. Word has length 189 [2025-01-08 23:50:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:09,388 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19117 transitions. [2025-01-08 23:50:09,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:50:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19117 transitions. [2025-01-08 23:50:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-08 23:50:09,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:09,395 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:50:09,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -67469995, now seen corresponding path program 1 times [2025-01-08 23:50:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48733754] [2025-01-08 23:50:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:09,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-08 23:50:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-08 23:50:09,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:50:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48733754] [2025-01-08 23:50:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48733754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010985855] [2025-01-08 23:50:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:09,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:09,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:09,765 INFO L87 Difference]: Start difference. First operand 15775 states and 19117 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:50:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:13,171 INFO L93 Difference]: Finished difference Result 42138 states and 51907 transitions. [2025-01-08 23:50:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 249 [2025-01-08 23:50:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:13,238 INFO L225 Difference]: With dead ends: 42138 [2025-01-08 23:50:13,238 INFO L226 Difference]: Without dead ends: 27042 [2025-01-08 23:50:13,254 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:50:13,256 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 775 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:13,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 324 Invalid, 4259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3717 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:50:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27042 states. [2025-01-08 23:50:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27042 to 25538. [2025-01-08 23:50:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25538 states, 25537 states have (on average 1.1716333163644908) internal successors, (29920), 25537 states have internal predecessors, (29920), 0 states have call successors, (0), 0 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:50:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 29920 transitions. [2025-01-08 23:50:13,641 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 29920 transitions. Word has length 249 [2025-01-08 23:50:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 25538 states and 29920 transitions. [2025-01-08 23:50:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:50:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 29920 transitions. [2025-01-08 23:50:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-08 23:50:13,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:13,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:50:13,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1441026478, now seen corresponding path program 1 times [2025-01-08 23:50:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515109839] [2025-01-08 23:50:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-08 23:50:13,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-08 23:50:13,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:13,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:50:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:13,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515109839] [2025-01-08 23:50:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515109839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:13,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311892656] [2025-01-08 23:50:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:13,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:13,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:13,836 INFO L87 Difference]: Start difference. First operand 25538 states and 29920 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:50:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:16,542 INFO L93 Difference]: Finished difference Result 62339 states and 74258 transitions. [2025-01-08 23:50:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 267 [2025-01-08 23:50:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:16,602 INFO L225 Difference]: With dead ends: 62339 [2025-01-08 23:50:16,602 INFO L226 Difference]: Without dead ends: 37554 [2025-01-08 23:50:16,625 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:50:16,626 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 745 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:16,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 460 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:50:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-01-08 23:50:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 36052. [2025-01-08 23:50:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36052 states, 36051 states have (on average 1.171590247149871) internal successors, (42237), 36051 states have internal predecessors, (42237), 0 states have call successors, (0), 0 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:50:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36052 states to 36052 states and 42237 transitions. [2025-01-08 23:50:17,057 INFO L78 Accepts]: Start accepts. Automaton has 36052 states and 42237 transitions. Word has length 267 [2025-01-08 23:50:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:17,057 INFO L471 AbstractCegarLoop]: Abstraction has 36052 states and 42237 transitions. [2025-01-08 23:50:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:50:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36052 states and 42237 transitions. [2025-01-08 23:50:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 23:50:17,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:17,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:17,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:50:17,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1561217534, now seen corresponding path program 1 times [2025-01-08 23:50:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:17,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240973971] [2025-01-08 23:50:17,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:17,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 23:50:17,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 23:50:17,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:17,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:50:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240973971] [2025-01-08 23:50:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240973971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747793821] [2025-01-08 23:50:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:17,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:17,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:17,290 INFO L87 Difference]: Start difference. First operand 36052 states and 42237 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:50:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:20,028 INFO L93 Difference]: Finished difference Result 90877 states and 107574 transitions. [2025-01-08 23:50:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 299 [2025-01-08 23:50:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:20,102 INFO L225 Difference]: With dead ends: 90877 [2025-01-08 23:50:20,102 INFO L226 Difference]: Without dead ends: 55578 [2025-01-08 23:50:20,135 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:50:20,136 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 745 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:20,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1321 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:50:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55578 states. [2025-01-08 23:50:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55578 to 53325. [2025-01-08 23:50:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.1462005851023929) internal successors, (61120), 53324 states have internal predecessors, (61120), 0 states have call successors, (0), 0 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:50:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 61120 transitions. [2025-01-08 23:50:20,883 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 61120 transitions. Word has length 299 [2025-01-08 23:50:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:20,884 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 61120 transitions. [2025-01-08 23:50:20,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:50:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 61120 transitions. [2025-01-08 23:50:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-08 23:50:20,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:20,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:50:20,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:20,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1087133756, now seen corresponding path program 1 times [2025-01-08 23:50:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506209711] [2025-01-08 23:50:20,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:20,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-08 23:50:20,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-08 23:50:20,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:20,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:50:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506209711] [2025-01-08 23:50:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506209711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396192824] [2025-01-08 23:50:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:21,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:21,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:21,178 INFO L87 Difference]: Start difference. First operand 53325 states and 61120 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:50:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:24,065 INFO L93 Difference]: Finished difference Result 123170 states and 140289 transitions. [2025-01-08 23:50:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 368 [2025-01-08 23:50:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:24,140 INFO L225 Difference]: With dead ends: 123170 [2025-01-08 23:50:24,140 INFO L226 Difference]: Without dead ends: 64590 [2025-01-08 23:50:24,172 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:50:24,173 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 758 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:24,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1316 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:50:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64590 states. [2025-01-08 23:50:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64590 to 57831. [2025-01-08 23:50:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57831 states, 57830 states have (on average 1.1300190212692374) internal successors, (65349), 57830 states have internal predecessors, (65349), 0 states have call successors, (0), 0 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:50:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57831 states to 57831 states and 65349 transitions. [2025-01-08 23:50:24,974 INFO L78 Accepts]: Start accepts. Automaton has 57831 states and 65349 transitions. Word has length 368 [2025-01-08 23:50:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:24,974 INFO L471 AbstractCegarLoop]: Abstraction has 57831 states and 65349 transitions. [2025-01-08 23:50:24,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:50:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 57831 states and 65349 transitions. [2025-01-08 23:50:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-08 23:50:24,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:24,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:50:24,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:24,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2132585616, now seen corresponding path program 1 times [2025-01-08 23:50:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:24,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168540541] [2025-01-08 23:50:24,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:25,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-08 23:50:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-08 23:50:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:25,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-08 23:50:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168540541] [2025-01-08 23:50:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168540541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:25,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515844164] [2025-01-08 23:50:25,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:25,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:25,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:25,230 INFO L87 Difference]: Start difference. First operand 57831 states and 65349 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:50:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:27,870 INFO L93 Difference]: Finished difference Result 139692 states and 159831 transitions. [2025-01-08 23:50:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 369 [2025-01-08 23:50:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:27,959 INFO L225 Difference]: With dead ends: 139692 [2025-01-08 23:50:27,959 INFO L226 Difference]: Without dead ends: 82614 [2025-01-08 23:50:27,995 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:50:27,996 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:27,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1194 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82614 states. [2025-01-08 23:50:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82614 to 75855. [2025-01-08 23:50:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75855 states, 75854 states have (on average 1.1168692488201017) internal successors, (84719), 75854 states have internal predecessors, (84719), 0 states have call successors, (0), 0 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:50:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 84719 transitions. [2025-01-08 23:50:28,773 INFO L78 Accepts]: Start accepts. Automaton has 75855 states and 84719 transitions. Word has length 369 [2025-01-08 23:50:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:28,773 INFO L471 AbstractCegarLoop]: Abstraction has 75855 states and 84719 transitions. [2025-01-08 23:50:28,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:50:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 75855 states and 84719 transitions. [2025-01-08 23:50:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-08 23:50:28,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:28,778 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:50:28,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 102953629, now seen corresponding path program 1 times [2025-01-08 23:50:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25132023] [2025-01-08 23:50:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-08 23:50:28,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-08 23:50:28,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:28,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-08 23:50:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25132023] [2025-01-08 23:50:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25132023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939008914] [2025-01-08 23:50:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:29,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:29,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:29,542 INFO L87 Difference]: Start difference. First operand 75855 states and 84719 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:50:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:31,983 INFO L93 Difference]: Finished difference Result 150957 states and 168680 transitions. [2025-01-08 23:50:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 387 [2025-01-08 23:50:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:32,068 INFO L225 Difference]: With dead ends: 150957 [2025-01-08 23:50:32,068 INFO L226 Difference]: Without dead ends: 75855 [2025-01-08 23:50:32,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:50:32,115 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 818 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:32,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 893 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75855 states. [2025-01-08 23:50:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75855 to 75855. [2025-01-08 23:50:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75855 states, 75854 states have (on average 1.1057162443641733) internal successors, (83873), 75854 states have internal predecessors, (83873), 0 states have call successors, (0), 0 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:50:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 83873 transitions. [2025-01-08 23:50:33,284 INFO L78 Accepts]: Start accepts. Automaton has 75855 states and 83873 transitions. Word has length 387 [2025-01-08 23:50:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 75855 states and 83873 transitions. [2025-01-08 23:50:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:50:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 75855 states and 83873 transitions. [2025-01-08 23:50:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-08 23:50:33,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:33,299 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-08 23:50:33,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:50:33,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash 781890398, now seen corresponding path program 1 times [2025-01-08 23:50:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113617717] [2025-01-08 23:50:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-08 23:50:33,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-08 23:50:33,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:33,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-01-08 23:50:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:33,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113617717] [2025-01-08 23:50:33,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113617717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:33,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:33,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:33,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744631240] [2025-01-08 23:50:33,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:33,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:33,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:33,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:33,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:33,790 INFO L87 Difference]: Start difference. First operand 75855 states and 83873 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:50:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:36,845 INFO L93 Difference]: Finished difference Result 190009 states and 209912 transitions. [2025-01-08 23:50:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 534 [2025-01-08 23:50:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:37,005 INFO L225 Difference]: With dead ends: 190009 [2025-01-08 23:50:37,006 INFO L226 Difference]: Without dead ends: 114907 [2025-01-08 23:50:37,057 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:50:37,058 INFO L435 NwaCegarLoop]: 1202 mSDtfsCounter, 723 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1210 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:50:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114907 states. [2025-01-08 23:50:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114907 to 107397. [2025-01-08 23:50:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107397 states, 107396 states have (on average 1.1020708406272115) internal successors, (118358), 107396 states have internal predecessors, (118358), 0 states have call successors, (0), 0 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:50:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107397 states to 107397 states and 118358 transitions. [2025-01-08 23:50:38,389 INFO L78 Accepts]: Start accepts. Automaton has 107397 states and 118358 transitions. Word has length 534 [2025-01-08 23:50:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:38,390 INFO L471 AbstractCegarLoop]: Abstraction has 107397 states and 118358 transitions. [2025-01-08 23:50:38,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:50:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 107397 states and 118358 transitions. [2025-01-08 23:50:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-01-08 23:50:38,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:38,407 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:38,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:50:38,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:38,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash -772647905, now seen corresponding path program 1 times [2025-01-08 23:50:38,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:38,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52648277] [2025-01-08 23:50:38,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:38,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-01-08 23:50:38,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-01-08 23:50:38,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:38,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-08 23:50:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52648277] [2025-01-08 23:50:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52648277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:39,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:39,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611892380] [2025-01-08 23:50:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:39,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:39,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:39,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:39,022 INFO L87 Difference]: Start difference. First operand 107397 states and 118358 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:50:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:41,889 INFO L93 Difference]: Finished difference Result 249338 states and 276118 transitions. [2025-01-08 23:50:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 553 [2025-01-08 23:50:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:42,041 INFO L225 Difference]: With dead ends: 249338 [2025-01-08 23:50:42,041 INFO L226 Difference]: Without dead ends: 142694 [2025-01-08 23:50:42,108 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:50:42,109 INFO L435 NwaCegarLoop]: 1244 mSDtfsCounter, 582 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:42,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1251 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:50:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142694 states. [2025-01-08 23:50:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142694 to 132180. [2025-01-08 23:50:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132180 states, 132179 states have (on average 1.091610618933416) internal successors, (144288), 132179 states have internal predecessors, (144288), 0 states have call successors, (0), 0 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:50:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132180 states to 132180 states and 144288 transitions. [2025-01-08 23:50:43,805 INFO L78 Accepts]: Start accepts. Automaton has 132180 states and 144288 transitions. Word has length 553 [2025-01-08 23:50:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 132180 states and 144288 transitions. [2025-01-08 23:50:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:50:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 132180 states and 144288 transitions. [2025-01-08 23:50:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-01-08 23:50:43,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:43,846 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:50:43,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -966539109, now seen corresponding path program 1 times [2025-01-08 23:50:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661187379] [2025-01-08 23:50:43,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-08 23:50:44,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-08 23:50:44,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:44,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 1176 proven. 120 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-08 23:50:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661187379] [2025-01-08 23:50:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661187379] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831824664] [2025-01-08 23:50:45,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:45,131 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:50:45,133 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:50:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-08 23:50:45,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-08 23:50:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:45,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:45,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 714 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-01-08 23:50:45,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831824664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:45,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-08 23:50:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335662209] [2025-01-08 23:50:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:45,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:45,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:50:45,598 INFO L87 Difference]: Start difference. First operand 132180 states and 144288 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:50:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:48,517 INFO L93 Difference]: Finished difference Result 289892 states and 316181 transitions. [2025-01-08 23:50:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:48,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 762 [2025-01-08 23:50:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:48,708 INFO L225 Difference]: With dead ends: 289892 [2025-01-08 23:50:48,708 INFO L226 Difference]: Without dead ends: 153959 [2025-01-08 23:50:48,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:50:48,796 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 754 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:48,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 328 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153959 states. [2025-01-08 23:50:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153959 to 108148. [2025-01-08 23:50:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108148 states, 108147 states have (on average 1.0632010134354166) internal successors, (114982), 108147 states have internal predecessors, (114982), 0 states have call successors, (0), 0 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:50:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108148 states to 108148 states and 114982 transitions. [2025-01-08 23:50:50,467 INFO L78 Accepts]: Start accepts. Automaton has 108148 states and 114982 transitions. Word has length 762 [2025-01-08 23:50:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:50,468 INFO L471 AbstractCegarLoop]: Abstraction has 108148 states and 114982 transitions. [2025-01-08 23:50:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:50:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 108148 states and 114982 transitions. [2025-01-08 23:50:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-01-08 23:50:50,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:50,493 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:50,499 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:50:50,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:50,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1392605072, now seen corresponding path program 1 times [2025-01-08 23:50:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:50,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481591882] [2025-01-08 23:50:50,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:50,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-08 23:50:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-08 23:50:50,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:50,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1509 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-01-08 23:50:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481591882] [2025-01-08 23:50:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481591882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212624367] [2025-01-08 23:50:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:51,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:51,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:51,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:51,224 INFO L87 Difference]: Start difference. First operand 108148 states and 114982 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:50:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:53,933 INFO L93 Difference]: Finished difference Result 229812 states and 243906 transitions. [2025-01-08 23:50:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:53,934 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 796 [2025-01-08 23:50:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:54,050 INFO L225 Difference]: With dead ends: 229812 [2025-01-08 23:50:54,050 INFO L226 Difference]: Without dead ends: 122417 [2025-01-08 23:50:54,088 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:50:54,089 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 734 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:54,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1159 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122417 states. [2025-01-08 23:50:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122417 to 116409. [2025-01-08 23:50:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116409 states, 116408 states have (on average 1.0557951343550271) internal successors, (122903), 116408 states have internal predecessors, (122903), 0 states have call successors, (0), 0 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:50:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116409 states to 116409 states and 122903 transitions. [2025-01-08 23:50:55,144 INFO L78 Accepts]: Start accepts. Automaton has 116409 states and 122903 transitions. Word has length 796 [2025-01-08 23:50:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 116409 states and 122903 transitions. [2025-01-08 23:50:55,145 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:50:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 116409 states and 122903 transitions. [2025-01-08 23:50:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2025-01-08 23:50:55,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:55,471 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:50:55,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash -855780054, now seen corresponding path program 1 times [2025-01-08 23:50:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816100813] [2025-01-08 23:50:55,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-01-08 23:50:55,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-01-08 23:50:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:55,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-01-08 23:50:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816100813] [2025-01-08 23:50:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816100813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:55,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194193475] [2025-01-08 23:50:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:55,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:55,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:55,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:55,968 INFO L87 Difference]: Start difference. First operand 116409 states and 122903 transitions. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)