./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label39.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f59006dbd942eedfc81642ab0c427fb651af56da6014792192339fc11dd9e46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:22:38,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:22:38,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:22:38,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:22:38,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:22:38,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:22:38,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:22:38,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:22:38,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:22:38,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:22:38,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:22:38,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:22:38,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:22:38,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:22:38,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:22:38,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:22:38,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:22:38,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:22:38,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:22:38,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:22:38,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:22:38,707 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f59006dbd942eedfc81642ab0c427fb651af56da6014792192339fc11dd9e46 [2025-03-08 02:22:38,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:22:38,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:22:38,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:22:38,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:22:38,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:22:38,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label39.c [2025-03-08 02:22:40,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce8acc241/64071db567394174b28f8532b083c450/FLAG3daab079b [2025-03-08 02:22:40,619 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:22:40,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c [2025-03-08 02:22:40,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce8acc241/64071db567394174b28f8532b083c450/FLAG3daab079b [2025-03-08 02:22:41,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce8acc241/64071db567394174b28f8532b083c450 [2025-03-08 02:22:41,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:22:41,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:22:41,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:22:41,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:22:41,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:22:41,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:41" (1/1) ... [2025-03-08 02:22:41,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:41, skipping insertion in model container [2025-03-08 02:22:41,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:41" (1/1) ... [2025-03-08 02:22:41,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:22:41,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c[4313,4326] [2025-03-08 02:22:42,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:22:42,189 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:22:42,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c[4313,4326] [2025-03-08 02:22:42,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:22:42,692 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:22:42,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42 WrapperNode [2025-03-08 02:22:42,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:22:42,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:22:42,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:22:42,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:22:42,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:42,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:43,288 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:22:43,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:22:43,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:22:43,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:22:43,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:22:43,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:43,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:43,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:43,724 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:22:43,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:43,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:22:44,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:22:44,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:22:44,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:22:44,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (1/1) ... [2025-03-08 02:22:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:22:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:22:44,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:22:44,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:22:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:22:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:22:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:22:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:22:44,212 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:22:44,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:22:49,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:22:49,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:22:49,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:22:49,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:22:49,921 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:22:50,164 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:22:50,164 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:22:50,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:22:50,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:22:50,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:50 BoogieIcfgContainer [2025-03-08 02:22:50,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:22:50,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:22:50,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:22:50,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:22:50,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:22:41" (1/3) ... [2025-03-08 02:22:50,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b13b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:50, skipping insertion in model container [2025-03-08 02:22:50,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:42" (2/3) ... [2025-03-08 02:22:50,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b13b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:50, skipping insertion in model container [2025-03-08 02:22:50,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:50" (3/3) ... [2025-03-08 02:22:50,204 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label39.c [2025-03-08 02:22:50,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:22:50,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label39.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:22:50,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:22:50,319 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;@52f76ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:22:50,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:22:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 02:22:50,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:50,339 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] [2025-03-08 02:22:50,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2009847195, now seen corresponding path program 1 times [2025-03-08 02:22:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68505508] [2025-03-08 02:22:50,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:50,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 02:22:50,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 02:22:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:50,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68505508] [2025-03-08 02:22:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68505508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480510210] [2025-03-08 02:22:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:50,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:50,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:50,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:50,602 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:55,761 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-03-08 02:22:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-08 02:22:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:55,784 INFO L225 Difference]: With dead ends: 4919 [2025-03-08 02:22:55,784 INFO L226 Difference]: Without dead ends: 3107 [2025-03-08 02:22:55,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:55,800 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1522 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:55,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 02:22:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-03-08 02:22:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-03-08 02:22:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-03-08 02:22:55,909 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 31 [2025-03-08 02:22:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-03-08 02:22:55,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-03-08 02:22:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 02:22:55,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:55,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:55,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:22:55,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:55,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:55,914 INFO L85 PathProgramCache]: Analyzing trace with hash 7885080, now seen corresponding path program 1 times [2025-03-08 02:22:55,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:55,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167132988] [2025-03-08 02:22:55,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:55,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 02:22:55,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 02:22:55,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167132988] [2025-03-08 02:22:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167132988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868091447] [2025-03-08 02:22:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:56,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:56,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:56,128 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:01,367 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-03-08 02:23:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-08 02:23:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:01,393 INFO L225 Difference]: With dead ends: 9097 [2025-03-08 02:23:01,393 INFO L226 Difference]: Without dead ends: 5993 [2025-03-08 02:23:01,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:01,398 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:01,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 02:23:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-03-08 02:23:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-03-08 02:23:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 1.606176961602671) internal successors, (9621), 5990 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-03-08 02:23:01,535 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 100 [2025-03-08 02:23:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-03-08 02:23:01,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-03-08 02:23:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 02:23:01,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:01,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:23:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:23:01,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1839782448, now seen corresponding path program 1 times [2025-03-08 02:23:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289564867] [2025-03-08 02:23:01,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:01,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 02:23:01,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 02:23:01,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:01,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:23:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289564867] [2025-03-08 02:23:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289564867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:23:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36440132] [2025-03-08 02:23:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:01,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:01,710 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:06,242 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-03-08 02:23:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-08 02:23:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:06,272 INFO L225 Difference]: With dead ends: 17559 [2025-03-08 02:23:06,272 INFO L226 Difference]: Without dead ends: 11570 [2025-03-08 02:23:06,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:06,278 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:06,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1732 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:23:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-03-08 02:23:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-03-08 02:23:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4296630774574506) internal successors, (16464), 11516 states have internal predecessors, (16464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16464 transitions. [2025-03-08 02:23:06,431 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16464 transitions. Word has length 105 [2025-03-08 02:23:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16464 transitions. [2025-03-08 02:23:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16464 transitions. [2025-03-08 02:23:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 02:23:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:06,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:23:06,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:23:06,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1453324754, now seen corresponding path program 1 times [2025-03-08 02:23:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59821846] [2025-03-08 02:23:06,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:06,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 02:23:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 02:23:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:23:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59821846] [2025-03-08 02:23:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59821846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:06,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:23:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224070685] [2025-03-08 02:23:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:06,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:06,603 INFO L87 Difference]: Start difference. First operand 11517 states and 16464 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:11,234 INFO L93 Difference]: Finished difference Result 34168 states and 48911 transitions. [2025-03-08 02:23:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-08 02:23:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:11,274 INFO L225 Difference]: With dead ends: 34168 [2025-03-08 02:23:11,275 INFO L226 Difference]: Without dead ends: 22653 [2025-03-08 02:23:11,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:11,287 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:11,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2076 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:23:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-03-08 02:23:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 21271. [2025-03-08 02:23:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21271 states, 21270 states have (on average 1.2866478608368594) internal successors, (27367), 21270 states have internal predecessors, (27367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 27367 transitions. [2025-03-08 02:23:11,661 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 27367 transitions. Word has length 128 [2025-03-08 02:23:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 21271 states and 27367 transitions. [2025-03-08 02:23:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 27367 transitions. [2025-03-08 02:23:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 02:23:11,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:11,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:23:11,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:23:11,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:11,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1315058498, now seen corresponding path program 1 times [2025-03-08 02:23:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882509253] [2025-03-08 02:23:11,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:11,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 02:23:11,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 02:23:11,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:11,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:23:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882509253] [2025-03-08 02:23:11,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882509253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:11,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:11,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:23:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151273472] [2025-03-08 02:23:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:11,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:11,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:11,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:11,829 INFO L87 Difference]: Start difference. First operand 21271 states and 27367 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:16,658 INFO L93 Difference]: Finished difference Result 63159 states and 81269 transitions. [2025-03-08 02:23:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-08 02:23:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:16,721 INFO L225 Difference]: With dead ends: 63159 [2025-03-08 02:23:16,722 INFO L226 Difference]: Without dead ends: 41890 [2025-03-08 02:23:16,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:16,747 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1469 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:16,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1886 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 02:23:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41890 states. [2025-03-08 02:23:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41890 to 41838. [2025-03-08 02:23:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41838 states, 41837 states have (on average 1.1881110022229127) internal successors, (49707), 41837 states have internal predecessors, (49707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41838 states to 41838 states and 49707 transitions. [2025-03-08 02:23:17,210 INFO L78 Accepts]: Start accepts. Automaton has 41838 states and 49707 transitions. Word has length 169 [2025-03-08 02:23:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 41838 states and 49707 transitions. [2025-03-08 02:23:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41838 states and 49707 transitions. [2025-03-08 02:23:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 02:23:17,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:17,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:23:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:23:17,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1857014939, now seen corresponding path program 1 times [2025-03-08 02:23:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729814681] [2025-03-08 02:23:17,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:17,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 02:23:17,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 02:23:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:23:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729814681] [2025-03-08 02:23:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729814681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:23:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702157824] [2025-03-08 02:23:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:17,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:17,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:17,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:17,420 INFO L87 Difference]: Start difference. First operand 41838 states and 49707 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:22,144 INFO L93 Difference]: Finished difference Result 102810 states and 123628 transitions. [2025-03-08 02:23:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:22,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-08 02:23:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:22,219 INFO L225 Difference]: With dead ends: 102810 [2025-03-08 02:23:22,220 INFO L226 Difference]: Without dead ends: 59607 [2025-03-08 02:23:22,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:22,239 INFO L435 NwaCegarLoop]: 3088 mSDtfsCounter, 1449 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:22,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 3278 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1895 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:23:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59607 states. [2025-03-08 02:23:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59607 to 59596. [2025-03-08 02:23:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59596 states, 59595 states have (on average 1.1474452554744525) internal successors, (68382), 59595 states have internal predecessors, (68382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59596 states to 59596 states and 68382 transitions. [2025-03-08 02:23:22,774 INFO L78 Accepts]: Start accepts. Automaton has 59596 states and 68382 transitions. Word has length 238 [2025-03-08 02:23:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:22,774 INFO L471 AbstractCegarLoop]: Abstraction has 59596 states and 68382 transitions. [2025-03-08 02:23:22,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 59596 states and 68382 transitions. [2025-03-08 02:23:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 02:23:22,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:22,778 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:23:22,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:23:22,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:22,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 379951839, now seen corresponding path program 1 times [2025-03-08 02:23:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687783675] [2025-03-08 02:23:22,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:22,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 02:23:22,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 02:23:22,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:22,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 02:23:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:24,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687783675] [2025-03-08 02:23:24,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687783675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:24,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:23:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2259976] [2025-03-08 02:23:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:24,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:23:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:24,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:23:24,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:23:24,080 INFO L87 Difference]: Start difference. First operand 59596 states and 68382 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:30,781 INFO L93 Difference]: Finished difference Result 146570 states and 166169 transitions. [2025-03-08 02:23:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:23:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 457 [2025-03-08 02:23:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:30,893 INFO L225 Difference]: With dead ends: 146570 [2025-03-08 02:23:30,893 INFO L226 Difference]: Without dead ends: 86976 [2025-03-08 02:23:30,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:23:30,925 INFO L435 NwaCegarLoop]: 1796 mSDtfsCounter, 3758 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9419 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 9687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 9419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:30,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 2151 Invalid, 9687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 9419 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-08 02:23:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86976 states. [2025-03-08 02:23:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86976 to 82838. [2025-03-08 02:23:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82838 states, 82837 states have (on average 1.1196446032569987) internal successors, (92748), 82837 states have internal predecessors, (92748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82838 states to 82838 states and 92748 transitions. [2025-03-08 02:23:31,757 INFO L78 Accepts]: Start accepts. Automaton has 82838 states and 92748 transitions. Word has length 457 [2025-03-08 02:23:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:31,757 INFO L471 AbstractCegarLoop]: Abstraction has 82838 states and 92748 transitions. [2025-03-08 02:23:31,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 82838 states and 92748 transitions. [2025-03-08 02:23:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 02:23:31,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:31,766 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 02:23:31,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:23:31,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:31,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1508792945, now seen corresponding path program 1 times [2025-03-08 02:23:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:31,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538693779] [2025-03-08 02:23:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-08 02:23:31,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 02:23:31,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:31,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 02:23:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538693779] [2025-03-08 02:23:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538693779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:23:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392867931] [2025-03-08 02:23:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:32,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:23:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:32,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:23:32,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:23:32,580 INFO L87 Difference]: Start difference. First operand 82838 states and 92748 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:38,047 INFO L93 Difference]: Finished difference Result 168435 states and 188273 transitions. [2025-03-08 02:23:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:23:38,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 485 [2025-03-08 02:23:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:38,154 INFO L225 Difference]: With dead ends: 168435 [2025-03-08 02:23:38,155 INFO L226 Difference]: Without dead ends: 85568 [2025-03-08 02:23:38,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:23:38,216 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 7321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:38,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2111 Invalid, 7321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7313 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 02:23:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85568 states. [2025-03-08 02:23:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85568 to 85568. [2025-03-08 02:23:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85568 states, 85567 states have (on average 1.1158857970946743) internal successors, (95483), 85567 states have internal predecessors, (95483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85568 states to 85568 states and 95483 transitions. [2025-03-08 02:23:39,104 INFO L78 Accepts]: Start accepts. Automaton has 85568 states and 95483 transitions. Word has length 485 [2025-03-08 02:23:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:39,106 INFO L471 AbstractCegarLoop]: Abstraction has 85568 states and 95483 transitions. [2025-03-08 02:23:39,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 85568 states and 95483 transitions. [2025-03-08 02:23:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 02:23:39,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:39,111 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:23:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:23:39,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1877429707, now seen corresponding path program 1 times [2025-03-08 02:23:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179364640] [2025-03-08 02:23:39,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:39,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 02:23:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 02:23:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 02:23:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179364640] [2025-03-08 02:23:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179364640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:23:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568296999] [2025-03-08 02:23:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:39,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:39,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:39,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:39,446 INFO L87 Difference]: Start difference. First operand 85568 states and 95483 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:44,156 INFO L93 Difference]: Finished difference Result 187543 states and 209862 transitions. [2025-03-08 02:23:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 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 603 [2025-03-08 02:23:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:44,286 INFO L225 Difference]: With dead ends: 187543 [2025-03-08 02:23:44,286 INFO L226 Difference]: Without dead ends: 104707 [2025-03-08 02:23:44,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:44,322 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1386 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:44,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 751 Invalid, 5593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1668 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:23:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104707 states. [2025-03-08 02:23:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104707 to 104684. [2025-03-08 02:23:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104684 states, 104683 states have (on average 1.098143920216272) internal successors, (114957), 104683 states have internal predecessors, (114957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104684 states to 104684 states and 114957 transitions. [2025-03-08 02:23:45,534 INFO L78 Accepts]: Start accepts. Automaton has 104684 states and 114957 transitions. Word has length 603 [2025-03-08 02:23:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:45,535 INFO L471 AbstractCegarLoop]: Abstraction has 104684 states and 114957 transitions. [2025-03-08 02:23:45,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 104684 states and 114957 transitions. [2025-03-08 02:23:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2025-03-08 02:23:45,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:45,539 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:23:45,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:23:45,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:45,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1047933440, now seen corresponding path program 1 times [2025-03-08 02:23:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966278245] [2025-03-08 02:23:45,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:45,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:45,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes. [2025-03-08 02:23:45,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements. [2025-03-08 02:23:45,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:45,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 57 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:23:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966278245] [2025-03-08 02:23:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966278245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:23:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187794559] [2025-03-08 02:23:47,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:23:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:23:47,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:23:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:23:47,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes. [2025-03-08 02:23:47,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements. [2025-03-08 02:23:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:47,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:23:47,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:23:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 02:23:47,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:23:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187794559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:23:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-08 02:23:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627993064] [2025-03-08 02:23:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:47,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:23:47,655 INFO L87 Difference]: Start difference. First operand 104684 states and 114957 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:53,132 INFO L93 Difference]: Finished difference Result 257278 states and 285055 transitions. [2025-03-08 02:23:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 737 [2025-03-08 02:23:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:53,317 INFO L225 Difference]: With dead ends: 257278 [2025-03-08 02:23:53,317 INFO L226 Difference]: Without dead ends: 155326 [2025-03-08 02:23:53,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:23:53,376 INFO L435 NwaCegarLoop]: 3209 mSDtfsCounter, 1445 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 6082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:53,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 3382 Invalid, 6082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 02:23:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155326 states. [2025-03-08 02:23:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155326 to 152480. [2025-03-08 02:23:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152480 states, 152479 states have (on average 1.0865233901061786) internal successors, (165672), 152479 states have internal predecessors, (165672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152480 states to 152480 states and 165672 transitions. [2025-03-08 02:23:54,891 INFO L78 Accepts]: Start accepts. Automaton has 152480 states and 165672 transitions. Word has length 737 [2025-03-08 02:23:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:54,892 INFO L471 AbstractCegarLoop]: Abstraction has 152480 states and 165672 transitions. [2025-03-08 02:23:54,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:23:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 152480 states and 165672 transitions. [2025-03-08 02:23:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-08 02:23:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:54,898 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:23:54,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:23:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 02:23:55,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:55,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1822767549, now seen corresponding path program 1 times [2025-03-08 02:23:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068252833] [2025-03-08 02:23:55,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:55,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-08 02:23:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-08 02:23:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:23:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068252833] [2025-03-08 02:23:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068252833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:23:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535633871] [2025-03-08 02:23:55,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:55,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:23:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:55,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:23:55,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:23:55,682 INFO L87 Difference]: Start difference. First operand 152480 states and 165672 transitions. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)