./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.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 7669776db00f6295c4028d825bdd51b22a88fb95e78feea7b33da1a0ac83f7c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:58:03,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:58:03,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:58:03,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:58:03,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:58:03,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:58:03,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:58:03,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:58:03,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:58:03,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:58:03,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:58:03,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:58:03,565 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:58:03,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:58:03,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:58:03,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:58:03,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:58:03,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:58:03,568 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 -> 7669776db00f6295c4028d825bdd51b22a88fb95e78feea7b33da1a0ac83f7c3 [2025-03-08 05:58:03,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:58:03,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:58:03,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:58:03,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:58:03,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:58:03,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2025-03-08 05:58:04,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18090721/b4cf0c6f191549389624205bbf08a2bf/FLAG99d15cbfc [2025-03-08 05:58:05,252 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:58:05,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2025-03-08 05:58:05,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18090721/b4cf0c6f191549389624205bbf08a2bf/FLAG99d15cbfc [2025-03-08 05:58:05,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18090721/b4cf0c6f191549389624205bbf08a2bf [2025-03-08 05:58:05,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:58:05,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:58:05,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:58:05,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:58:05,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:58:05,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:05,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca44fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05, skipping insertion in model container [2025-03-08 05:58:05,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:05,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:58:05,818 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/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c[28368,28381] [2025-03-08 05:58:05,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:58:05,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:58:05,909 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/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c[28368,28381] [2025-03-08 05:58:05,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:58:05,928 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:58:05,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05 WrapperNode [2025-03-08 05:58:05,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:58:05,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:58:05,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:58:05,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:58:05,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:05,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:05,986 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 956 [2025-03-08 05:58:05,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:58:05,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:58:05,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:58:05,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:58:06,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,041 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 05:58:06,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:58:06,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:58:06,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:58:06,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:58:06,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (1/1) ... [2025-03-08 05:58:06,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:58:06,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:58:06,102 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 05:58:06,105 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 05:58:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:58:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:58:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:58:06,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:58:06,230 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:58:06,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:58:06,987 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-08 05:58:06,987 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:58:07,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:58:07,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:58:07,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:58:07 BoogieIcfgContainer [2025-03-08 05:58:07,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:58:07,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:58:07,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:58:07,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:58:07,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:58:05" (1/3) ... [2025-03-08 05:58:07,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766e0222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:58:07, skipping insertion in model container [2025-03-08 05:58:07,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:58:05" (2/3) ... [2025-03-08 05:58:07,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766e0222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:58:07, skipping insertion in model container [2025-03-08 05:58:07,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:58:07" (3/3) ... [2025-03-08 05:58:07,010 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2025-03-08 05:58:07,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:58:07,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 287 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:58:07,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:58:07,100 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;@679e3b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:58:07,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:58:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 287 states, 285 states have (on average 1.8245614035087718) internal successors, (520), 286 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 05:58:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:58:07,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:07,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:07,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -317198031, now seen corresponding path program 1 times [2025-03-08 05:58:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831389443] [2025-03-08 05:58:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:07,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:58:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:58:07,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:07,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:07,579 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 05:58:07,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831389443] [2025-03-08 05:58:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831389443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:07,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:58:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723858284] [2025-03-08 05:58:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:07,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:58:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:07,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:58:07,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:58:07,605 INFO L87 Difference]: Start difference. First operand has 287 states, 285 states have (on average 1.8245614035087718) internal successors, (520), 286 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) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 05:58:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:07,635 INFO L93 Difference]: Finished difference Result 380 states and 684 transitions. [2025-03-08 05:58:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:58:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-08 05:58:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:07,644 INFO L225 Difference]: With dead ends: 380 [2025-03-08 05:58:07,645 INFO L226 Difference]: Without dead ends: 284 [2025-03-08 05:58:07,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:58:07,649 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:07,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-08 05:58:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-08 05:58:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.8197879858657244) internal successors, (515), 283 states have internal predecessors, (515), 0 states have call successors, (0), 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 05:58:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 515 transitions. [2025-03-08 05:58:07,703 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 515 transitions. Word has length 77 [2025-03-08 05:58:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:07,704 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 515 transitions. [2025-03-08 05:58:07,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 05:58:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 515 transitions. [2025-03-08 05:58:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:58:07,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:07,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:07,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:58:07,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:07,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -384204784, now seen corresponding path program 1 times [2025-03-08 05:58:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105659519] [2025-03-08 05:58:07,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:07,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:58:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:58:07,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:07,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:08,062 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 05:58:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105659519] [2025-03-08 05:58:08,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105659519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:08,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:08,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:58:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157395509] [2025-03-08 05:58:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:08,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:58:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:08,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:58:08,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:58:08,064 INFO L87 Difference]: Start difference. First operand 284 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 05:58:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:08,176 INFO L93 Difference]: Finished difference Result 380 states and 680 transitions. [2025-03-08 05:58:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:58:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-08 05:58:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:08,178 INFO L225 Difference]: With dead ends: 380 [2025-03-08 05:58:08,179 INFO L226 Difference]: Without dead ends: 284 [2025-03-08 05:58:08,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:58:08,181 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:08,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:58:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-08 05:58:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-08 05:58:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.6713780918727916) internal successors, (473), 283 states have internal predecessors, (473), 0 states have call successors, (0), 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 05:58:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 473 transitions. [2025-03-08 05:58:08,191 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 473 transitions. Word has length 77 [2025-03-08 05:58:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:08,191 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 473 transitions. [2025-03-08 05:58:08,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 05:58:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 473 transitions. [2025-03-08 05:58:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:58:08,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:08,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:08,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:58:08,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1125202192, now seen corresponding path program 1 times [2025-03-08 05:58:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615845877] [2025-03-08 05:58:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:08,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:58:08,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:58:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:08,442 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 05:58:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615845877] [2025-03-08 05:58:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615845877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:08,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:08,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740388652] [2025-03-08 05:58:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:08,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:08,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:08,443 INFO L87 Difference]: Start difference. First operand 284 states and 473 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 05:58:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:08,509 INFO L93 Difference]: Finished difference Result 457 states and 774 transitions. [2025-03-08 05:58:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-08 05:58:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:08,512 INFO L225 Difference]: With dead ends: 457 [2025-03-08 05:58:08,512 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 05:58:08,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:08,513 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 131 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:08,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 887 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 05:58:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-08 05:58:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6759002770083102) internal successors, (605), 361 states have internal predecessors, (605), 0 states have call successors, (0), 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 05:58:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 605 transitions. [2025-03-08 05:58:08,533 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 605 transitions. Word has length 118 [2025-03-08 05:58:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:08,533 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 605 transitions. [2025-03-08 05:58:08,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 05:58:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 605 transitions. [2025-03-08 05:58:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:58:08,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:08,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:58:08,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1145287309, now seen corresponding path program 1 times [2025-03-08 05:58:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923669764] [2025-03-08 05:58:08,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:58:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:58:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:08,705 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 05:58:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923669764] [2025-03-08 05:58:08,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923669764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:08,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:08,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612843944] [2025-03-08 05:58:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:08,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:08,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:08,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:08,708 INFO L87 Difference]: Start difference. First operand 362 states and 605 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 05:58:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:08,759 INFO L93 Difference]: Finished difference Result 684 states and 1157 transitions. [2025-03-08 05:58:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-08 05:58:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:08,763 INFO L225 Difference]: With dead ends: 684 [2025-03-08 05:58:08,763 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 05:58:08,765 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 05:58:08,766 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 132 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:08,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 899 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 05:58:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2025-03-08 05:58:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6836935166994107) internal successors, (857), 509 states have internal predecessors, (857), 0 states have call successors, (0), 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 05:58:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 857 transitions. [2025-03-08 05:58:08,784 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 857 transitions. Word has length 121 [2025-03-08 05:58:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:08,785 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 857 transitions. [2025-03-08 05:58:08,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 05:58:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 857 transitions. [2025-03-08 05:58:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:58:08,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:08,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:08,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:58:08,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:08,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -794310143, now seen corresponding path program 1 times [2025-03-08 05:58:08,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:08,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882668721] [2025-03-08 05:58:08,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:08,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:58:08,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:58:08,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:08,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:08,982 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 05:58:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882668721] [2025-03-08 05:58:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882668721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908958189] [2025-03-08 05:58:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:08,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:08,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:08,984 INFO L87 Difference]: Start difference. First operand 510 states and 857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 05:58:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:09,026 INFO L93 Difference]: Finished difference Result 1110 states and 1879 transitions. [2025-03-08 05:58:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 05:58:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:09,031 INFO L225 Difference]: With dead ends: 1110 [2025-03-08 05:58:09,031 INFO L226 Difference]: Without dead ends: 792 [2025-03-08 05:58:09,032 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 05:58:09,033 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 125 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:09,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 900 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-08 05:58:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2025-03-08 05:58:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.6828025477707007) internal successors, (1321), 785 states have internal predecessors, (1321), 0 states have call successors, (0), 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 05:58:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1321 transitions. [2025-03-08 05:58:09,063 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1321 transitions. Word has length 124 [2025-03-08 05:58:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:09,064 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1321 transitions. [2025-03-08 05:58:09,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 05:58:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1321 transitions. [2025-03-08 05:58:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:58:09,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:09,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:09,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:58:09,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash 235819710, now seen corresponding path program 1 times [2025-03-08 05:58:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753038058] [2025-03-08 05:58:09,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:58:09,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:58:09,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:09,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:09,233 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 05:58:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753038058] [2025-03-08 05:58:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753038058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:09,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617798554] [2025-03-08 05:58:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:09,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:09,239 INFO L87 Difference]: Start difference. First operand 786 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 05:58:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:09,279 INFO L93 Difference]: Finished difference Result 1902 states and 3203 transitions. [2025-03-08 05:58:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-08 05:58:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:09,285 INFO L225 Difference]: With dead ends: 1902 [2025-03-08 05:58:09,285 INFO L226 Difference]: Without dead ends: 1308 [2025-03-08 05:58:09,286 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 05:58:09,287 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 118 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 901 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-08 05:58:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1298. [2025-03-08 05:58:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.6723207401696223) internal successors, (2169), 1297 states have internal predecessors, (2169), 0 states have call successors, (0), 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 05:58:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2169 transitions. [2025-03-08 05:58:09,322 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2169 transitions. Word has length 127 [2025-03-08 05:58:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:09,322 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 2169 transitions. [2025-03-08 05:58:09,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 05:58:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2169 transitions. [2025-03-08 05:58:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:58:09,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:09,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:09,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:58:09,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:09,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -469031183, now seen corresponding path program 1 times [2025-03-08 05:58:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410346503] [2025-03-08 05:58:09,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:09,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:58:09,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:58:09,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:09,507 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 05:58:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410346503] [2025-03-08 05:58:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410346503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:58:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149065869] [2025-03-08 05:58:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:58:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:09,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:58:09,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:58:09,509 INFO L87 Difference]: Start difference. First operand 1298 states and 2169 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 05:58:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:09,770 INFO L93 Difference]: Finished difference Result 6530 states and 11093 transitions. [2025-03-08 05:58:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:58:09,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-08 05:58:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:09,787 INFO L225 Difference]: With dead ends: 6530 [2025-03-08 05:58:09,787 INFO L226 Difference]: Without dead ends: 5424 [2025-03-08 05:58:09,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:58:09,790 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1246 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:09,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3911 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:58:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2025-03-08 05:58:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 2326. [2025-03-08 05:58:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2325 states have (on average 1.6748387096774193) internal successors, (3894), 2325 states have internal predecessors, (3894), 0 states have call successors, (0), 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 05:58:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3894 transitions. [2025-03-08 05:58:09,862 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3894 transitions. Word has length 130 [2025-03-08 05:58:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 2326 states and 3894 transitions. [2025-03-08 05:58:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 05:58:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3894 transitions. [2025-03-08 05:58:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:58:09,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:09,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:58:09,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1602362548, now seen corresponding path program 1 times [2025-03-08 05:58:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841499115] [2025-03-08 05:58:09,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:09,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:58:09,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:58:09,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:09,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:10,064 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 05:58:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841499115] [2025-03-08 05:58:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841499115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:10,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:58:10,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525797614] [2025-03-08 05:58:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:58:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:58:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:58:10,067 INFO L87 Difference]: Start difference. First operand 2326 states and 3894 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 05:58:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:10,163 INFO L93 Difference]: Finished difference Result 6744 states and 11406 transitions. [2025-03-08 05:58:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:58:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-08 05:58:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:10,177 INFO L225 Difference]: With dead ends: 6744 [2025-03-08 05:58:10,177 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 05:58:10,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:58:10,181 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 457 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:10,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1404 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 05:58:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3451. [2025-03-08 05:58:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.6805797101449276) internal successors, (5798), 3450 states have internal predecessors, (5798), 0 states have call successors, (0), 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 05:58:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5798 transitions. [2025-03-08 05:58:10,269 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5798 transitions. Word has length 131 [2025-03-08 05:58:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:10,269 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5798 transitions. [2025-03-08 05:58:10,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 05:58:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5798 transitions. [2025-03-08 05:58:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:58:10,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:10,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:10,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:58:10,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1917223759, now seen corresponding path program 1 times [2025-03-08 05:58:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200493545] [2025-03-08 05:58:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:58:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:58:10,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:10,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:10,418 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 05:58:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200493545] [2025-03-08 05:58:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200493545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:58:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927232458] [2025-03-08 05:58:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:10,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:58:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:10,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:58:10,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:58:10,420 INFO L87 Difference]: Start difference. First operand 3451 states and 5798 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 05:58:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:10,563 INFO L93 Difference]: Finished difference Result 10068 states and 17008 transitions. [2025-03-08 05:58:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:58:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-08 05:58:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:10,583 INFO L225 Difference]: With dead ends: 10068 [2025-03-08 05:58:10,584 INFO L226 Difference]: Without dead ends: 6809 [2025-03-08 05:58:10,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:58:10,589 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 457 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:10,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1501 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:58:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2025-03-08 05:58:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 5106. [2025-03-08 05:58:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5105 states have (on average 1.6789422135161607) internal successors, (8571), 5105 states have internal predecessors, (8571), 0 states have call successors, (0), 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 05:58:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 8571 transitions. [2025-03-08 05:58:10,736 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 8571 transitions. Word has length 132 [2025-03-08 05:58:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:10,736 INFO L471 AbstractCegarLoop]: Abstraction has 5106 states and 8571 transitions. [2025-03-08 05:58:10,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 05:58:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 8571 transitions. [2025-03-08 05:58:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:58:10,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:10,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:58:10,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 34723572, now seen corresponding path program 1 times [2025-03-08 05:58:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135429518] [2025-03-08 05:58:10,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:10,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:58:10,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:58:10,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:10,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:10,835 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 05:58:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135429518] [2025-03-08 05:58:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135429518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:10,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515242306] [2025-03-08 05:58:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:10,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:10,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:10,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:10,836 INFO L87 Difference]: Start difference. First operand 5106 states and 8571 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:10,925 INFO L93 Difference]: Finished difference Result 11425 states and 19299 transitions. [2025-03-08 05:58:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 05:58:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:10,946 INFO L225 Difference]: With dead ends: 11425 [2025-03-08 05:58:10,946 INFO L226 Difference]: Without dead ends: 7909 [2025-03-08 05:58:10,952 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 05:58:10,953 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 138 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:10,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1043 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2025-03-08 05:58:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 7907. [2025-03-08 05:58:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7907 states, 7906 states have (on average 1.6750569187958513) internal successors, (13243), 7906 states have internal predecessors, (13243), 0 states have call successors, (0), 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 05:58:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 13243 transitions. [2025-03-08 05:58:11,206 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 13243 transitions. Word has length 133 [2025-03-08 05:58:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:11,207 INFO L471 AbstractCegarLoop]: Abstraction has 7907 states and 13243 transitions. [2025-03-08 05:58:11,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 13243 transitions. [2025-03-08 05:58:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:58:11,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:11,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:58:11,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1553750472, now seen corresponding path program 1 times [2025-03-08 05:58:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368702779] [2025-03-08 05:58:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:11,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:58:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:58:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:11,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:11,295 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 05:58:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368702779] [2025-03-08 05:58:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368702779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120592407] [2025-03-08 05:58:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:11,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:11,297 INFO L87 Difference]: Start difference. First operand 7907 states and 13243 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:11,432 INFO L93 Difference]: Finished difference Result 17592 states and 29492 transitions. [2025-03-08 05:58:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 05:58:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:11,456 INFO L225 Difference]: With dead ends: 17592 [2025-03-08 05:58:11,456 INFO L226 Difference]: Without dead ends: 12155 [2025-03-08 05:58:11,466 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 05:58:11,467 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 131 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:11,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1042 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12155 states. [2025-03-08 05:58:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12155 to 12153. [2025-03-08 05:58:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12153 states, 12152 states have (on average 1.663429888084266) internal successors, (20214), 12152 states have internal predecessors, (20214), 0 states have call successors, (0), 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 05:58:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12153 states to 12153 states and 20214 transitions. [2025-03-08 05:58:11,747 INFO L78 Accepts]: Start accepts. Automaton has 12153 states and 20214 transitions. Word has length 133 [2025-03-08 05:58:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:11,748 INFO L471 AbstractCegarLoop]: Abstraction has 12153 states and 20214 transitions. [2025-03-08 05:58:11,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12153 states and 20214 transitions. [2025-03-08 05:58:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:58:11,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:11,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:11,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:58:11,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:11,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -928221677, now seen corresponding path program 1 times [2025-03-08 05:58:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:11,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457639] [2025-03-08 05:58:11,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:11,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:11,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:58:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:58:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:11,849 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 05:58:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457639] [2025-03-08 05:58:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390480053] [2025-03-08 05:58:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:11,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:11,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:11,851 INFO L87 Difference]: Start difference. First operand 12153 states and 20214 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:12,032 INFO L93 Difference]: Finished difference Result 23965 states and 39928 transitions. [2025-03-08 05:58:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 05:58:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:12,067 INFO L225 Difference]: With dead ends: 23965 [2025-03-08 05:58:12,067 INFO L226 Difference]: Without dead ends: 17262 [2025-03-08 05:58:12,081 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 05:58:12,081 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 124 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:12,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1034 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17262 states. [2025-03-08 05:58:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17262 to 17260. [2025-03-08 05:58:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17260 states, 17259 states have (on average 1.652702937597775) internal successors, (28524), 17259 states have internal predecessors, (28524), 0 states have call successors, (0), 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 05:58:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 28524 transitions. [2025-03-08 05:58:12,432 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 28524 transitions. Word has length 133 [2025-03-08 05:58:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:12,432 INFO L471 AbstractCegarLoop]: Abstraction has 17260 states and 28524 transitions. [2025-03-08 05:58:12,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 28524 transitions. [2025-03-08 05:58:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:58:12,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:12,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:58:12,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:12,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash 412010937, now seen corresponding path program 1 times [2025-03-08 05:58:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339430057] [2025-03-08 05:58:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:12,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:58:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:58:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:12,521 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 05:58:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339430057] [2025-03-08 05:58:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339430057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151260329] [2025-03-08 05:58:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:12,522 INFO L87 Difference]: Start difference. First operand 17260 states and 28524 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:12,807 INFO L93 Difference]: Finished difference Result 33872 states and 56088 transitions. [2025-03-08 05:58:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 05:58:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:12,857 INFO L225 Difference]: With dead ends: 33872 [2025-03-08 05:58:12,857 INFO L226 Difference]: Without dead ends: 24369 [2025-03-08 05:58:12,868 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 05:58:12,868 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 117 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1025 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24369 states. [2025-03-08 05:58:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24369 to 24367. [2025-03-08 05:58:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24367 states, 24366 states have (on average 1.6409751292785029) internal successors, (39984), 24366 states have internal predecessors, (39984), 0 states have call successors, (0), 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 05:58:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24367 states to 24367 states and 39984 transitions. [2025-03-08 05:58:13,395 INFO L78 Accepts]: Start accepts. Automaton has 24367 states and 39984 transitions. Word has length 133 [2025-03-08 05:58:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:13,395 INFO L471 AbstractCegarLoop]: Abstraction has 24367 states and 39984 transitions. [2025-03-08 05:58:13,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24367 states and 39984 transitions. [2025-03-08 05:58:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:58:13,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:13,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:58:13,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -646597462, now seen corresponding path program 1 times [2025-03-08 05:58:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814347099] [2025-03-08 05:58:13,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:13,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:58:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:58:13,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:13,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:13,519 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 05:58:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814347099] [2025-03-08 05:58:13,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814347099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:58:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424555787] [2025-03-08 05:58:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:13,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:58:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:13,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:58:13,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:58:13,521 INFO L87 Difference]: Start difference. First operand 24367 states and 39984 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:14,079 INFO L93 Difference]: Finished difference Result 79851 states and 131402 transitions. [2025-03-08 05:58:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:58:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 05:58:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:14,198 INFO L225 Difference]: With dead ends: 79851 [2025-03-08 05:58:14,198 INFO L226 Difference]: Without dead ends: 55699 [2025-03-08 05:58:14,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:58:14,233 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 455 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:14,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1503 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:58:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55699 states. [2025-03-08 05:58:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55699 to 39890. [2025-03-08 05:58:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39890 states, 39889 states have (on average 1.633708541201835) internal successors, (65167), 39889 states have internal predecessors, (65167), 0 states have call successors, (0), 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 05:58:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39890 states to 39890 states and 65167 transitions. [2025-03-08 05:58:15,162 INFO L78 Accepts]: Start accepts. Automaton has 39890 states and 65167 transitions. Word has length 133 [2025-03-08 05:58:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 39890 states and 65167 transitions. [2025-03-08 05:58:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 05:58:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39890 states and 65167 transitions. [2025-03-08 05:58:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:58:15,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:15,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:58:15,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1477476269, now seen corresponding path program 1 times [2025-03-08 05:58:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450756497] [2025-03-08 05:58:15,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:58:15,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:58:15,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:15,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:15,275 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 05:58:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450756497] [2025-03-08 05:58:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450756497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:58:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410815739] [2025-03-08 05:58:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:15,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:58:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:15,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:58:15,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:58:15,277 INFO L87 Difference]: Start difference. First operand 39890 states and 65167 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 05:58:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:16,008 INFO L93 Difference]: Finished difference Result 129245 states and 211740 transitions. [2025-03-08 05:58:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:58:16,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-08 05:58:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:16,201 INFO L225 Difference]: With dead ends: 129245 [2025-03-08 05:58:16,201 INFO L226 Difference]: Without dead ends: 89570 [2025-03-08 05:58:16,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:58:16,242 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:16,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1505 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89570 states. [2025-03-08 05:58:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89570 to 64505. [2025-03-08 05:58:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.626658811856629) internal successors, (104926), 64504 states have internal predecessors, (104926), 0 states have call successors, (0), 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 05:58:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104926 transitions. [2025-03-08 05:58:17,619 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104926 transitions. Word has length 134 [2025-03-08 05:58:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:17,619 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104926 transitions. [2025-03-08 05:58:17,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 05:58:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104926 transitions. [2025-03-08 05:58:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:58:17,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:17,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:17,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:58:17,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:17,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:17,622 INFO L85 PathProgramCache]: Analyzing trace with hash -331277301, now seen corresponding path program 1 times [2025-03-08 05:58:17,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:17,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264231888] [2025-03-08 05:58:17,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:17,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:17,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:58:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:58:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:17,955 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 05:58:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:17,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264231888] [2025-03-08 05:58:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264231888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:17,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:58:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004477094] [2025-03-08 05:58:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:17,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:58:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:58:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:58:17,958 INFO L87 Difference]: Start difference. First operand 64505 states and 104926 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 05:58:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:18,975 INFO L93 Difference]: Finished difference Result 128797 states and 209509 transitions. [2025-03-08 05:58:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:58:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-08 05:58:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:19,064 INFO L225 Difference]: With dead ends: 128797 [2025-03-08 05:58:19,065 INFO L226 Difference]: Without dead ends: 64507 [2025-03-08 05:58:19,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:58:19,091 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 241 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:19,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1781 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:58:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64507 states. [2025-03-08 05:58:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64507 to 64505. [2025-03-08 05:58:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.6169694902641696) internal successors, (104301), 64504 states have internal predecessors, (104301), 0 states have call successors, (0), 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 05:58:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104301 transitions. [2025-03-08 05:58:19,996 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104301 transitions. Word has length 136 [2025-03-08 05:58:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:19,997 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104301 transitions. [2025-03-08 05:58:19,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 05:58:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104301 transitions. [2025-03-08 05:58:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:58:19,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:19,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:58:19,998 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1875817149, now seen corresponding path program 1 times [2025-03-08 05:58:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011971945] [2025-03-08 05:58:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:20,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:58:20,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:58:20,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:20,381 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 05:58:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011971945] [2025-03-08 05:58:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011971945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:58:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030597843] [2025-03-08 05:58:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:58:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:20,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:58:20,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:58:20,382 INFO L87 Difference]: Start difference. First operand 64505 states and 104301 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 05:58:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:21,584 INFO L93 Difference]: Finished difference Result 188667 states and 305529 transitions. [2025-03-08 05:58:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:58:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-08 05:58:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:21,802 INFO L225 Difference]: With dead ends: 188667 [2025-03-08 05:58:21,803 INFO L226 Difference]: Without dead ends: 124377 [2025-03-08 05:58:21,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:58:21,858 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 354 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:21,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1790 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:58:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124377 states. [2025-03-08 05:58:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124377 to 124375. [2025-03-08 05:58:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124375 states, 124374 states have (on average 1.6044671715953496) internal successors, (199554), 124374 states have internal predecessors, (199554), 0 states have call successors, (0), 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 05:58:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124375 states to 124375 states and 199554 transitions. [2025-03-08 05:58:24,159 INFO L78 Accepts]: Start accepts. Automaton has 124375 states and 199554 transitions. Word has length 139 [2025-03-08 05:58:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:24,159 INFO L471 AbstractCegarLoop]: Abstraction has 124375 states and 199554 transitions. [2025-03-08 05:58:24,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 05:58:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 124375 states and 199554 transitions. [2025-03-08 05:58:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:58:24,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:24,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:58:24,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2011595300, now seen corresponding path program 1 times [2025-03-08 05:58:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809241530] [2025-03-08 05:58:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:24,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:58:24,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:58:24,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:24,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:24,867 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 05:58:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809241530] [2025-03-08 05:58:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809241530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:58:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741675091] [2025-03-08 05:58:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:58:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:24,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:58:24,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:58:24,868 INFO L87 Difference]: Start difference. First operand 124375 states and 199554 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 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 05:58:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:25,780 INFO L93 Difference]: Finished difference Result 130185 states and 207299 transitions. [2025-03-08 05:58:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:58:25,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-08 05:58:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:25,936 INFO L225 Difference]: With dead ends: 130185 [2025-03-08 05:58:25,936 INFO L226 Difference]: Without dead ends: 130183 [2025-03-08 05:58:25,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:58:25,969 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:25,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3250 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130183 states. [2025-03-08 05:58:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130183 to 130183. [2025-03-08 05:58:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130183 states, 130182 states have (on average 1.5772917914919113) internal successors, (205335), 130182 states have internal predecessors, (205335), 0 states have call successors, (0), 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 05:58:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130183 states to 130183 states and 205335 transitions. [2025-03-08 05:58:28,469 INFO L78 Accepts]: Start accepts. Automaton has 130183 states and 205335 transitions. Word has length 140 [2025-03-08 05:58:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 130183 states and 205335 transitions. [2025-03-08 05:58:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 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 05:58:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 130183 states and 205335 transitions. [2025-03-08 05:58:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:58:28,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:28,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:58:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:58:28,473 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1009407244, now seen corresponding path program 1 times [2025-03-08 05:58:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410558244] [2025-03-08 05:58:28,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:28,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:58:28,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:58:28,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:28,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:28,576 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 05:58:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410558244] [2025-03-08 05:58:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410558244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990178642] [2025-03-08 05:58:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:28,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:28,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:28,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:28,577 INFO L87 Difference]: Start difference. First operand 130183 states and 205335 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 05:58:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:30,946 INFO L93 Difference]: Finished difference Result 389528 states and 613982 transitions. [2025-03-08 05:58:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-03-08 05:58:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:31,423 INFO L225 Difference]: With dead ends: 389528 [2025-03-08 05:58:31,423 INFO L226 Difference]: Without dead ends: 259404 [2025-03-08 05:58:31,775 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 05:58:31,775 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 349 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:31,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259404 states. [2025-03-08 05:58:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259404 to 259402. [2025-03-08 05:58:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259402 states, 259401 states have (on average 1.567040990589859) internal successors, (406492), 259401 states have internal predecessors, (406492), 0 states have call successors, (0), 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 05:58:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259402 states to 259402 states and 406492 transitions. [2025-03-08 05:58:36,556 INFO L78 Accepts]: Start accepts. Automaton has 259402 states and 406492 transitions. Word has length 177 [2025-03-08 05:58:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:36,557 INFO L471 AbstractCegarLoop]: Abstraction has 259402 states and 406492 transitions. [2025-03-08 05:58:36,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 05:58:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 259402 states and 406492 transitions. [2025-03-08 05:58:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:58:36,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:36,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:58:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:58:36,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:36,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash -579066800, now seen corresponding path program 1 times [2025-03-08 05:58:36,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4491781] [2025-03-08 05:58:36,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:36,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:58:36,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:58:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:58:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4491781] [2025-03-08 05:58:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4491781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73807516] [2025-03-08 05:58:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:36,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:36,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:36,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:36,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:36,678 INFO L87 Difference]: Start difference. First operand 259402 states and 406492 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:58:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:41,384 INFO L93 Difference]: Finished difference Result 776226 states and 1215543 transitions. [2025-03-08 05:58:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:41,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-08 05:58:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:42,770 INFO L225 Difference]: With dead ends: 776226 [2025-03-08 05:58:42,771 INFO L226 Difference]: Without dead ends: 516911 [2025-03-08 05:58:42,922 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 05:58:42,922 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 329 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:42,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1170 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516911 states.