./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_opt-floodmax.4.2.ufo.BOUNDED-8.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 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:12:34,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:12:34,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:12:34,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:12:34,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:12:34,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:12:34,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:12:34,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:12:34,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:12:34,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:12:34,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:12:34,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:12:34,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:12:34,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:12:34,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:12:34,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:12:34,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:12:34,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:12:34,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:12:34,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:12:34,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:12:34,797 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 -> 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 [2025-03-16 19:12:35,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:12:35,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:12:35,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:12:35,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:12:35,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:12:35,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-03-16 19:12:36,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00aae9223/cd66c9e45e224efaae0b453fe47eec20/FLAG7d9c858b7 [2025-03-16 19:12:36,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:12:36,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-03-16 19:12:36,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00aae9223/cd66c9e45e224efaae0b453fe47eec20/FLAG7d9c858b7 [2025-03-16 19:12:36,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00aae9223/cd66c9e45e224efaae0b453fe47eec20 [2025-03-16 19:12:36,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:12:36,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:12:36,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:12:36,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:12:36,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:12:36,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36, skipping insertion in model container [2025-03-16 19:12:36,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:12:36,733 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2025-03-16 19:12:36,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:12:36,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:12:36,808 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2025-03-16 19:12:36,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:12:36,824 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:12:36,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36 WrapperNode [2025-03-16 19:12:36,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:12:36,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:12:36,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:12:36,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:12:36,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,875 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1019 [2025-03-16 19:12:36,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:12:36,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:12:36,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:12:36,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:12:36,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,904 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-16 19:12:36,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:12:36,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:12:36,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:12:36,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:12:36,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (1/1) ... [2025-03-16 19:12:36,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:12:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:12:36,963 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-16 19:12:36,965 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-16 19:12:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:12:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:12:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:12:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:12:37,084 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:12:37,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:12:37,927 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-16 19:12:37,928 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:12:37,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:12:37,944 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:12:37,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:12:37 BoogieIcfgContainer [2025-03-16 19:12:37,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:12:37,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:12:37,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:12:37,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:12:37,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:12:36" (1/3) ... [2025-03-16 19:12:37,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa374d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:12:37, skipping insertion in model container [2025-03-16 19:12:37,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:36" (2/3) ... [2025-03-16 19:12:37,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa374d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:12:37, skipping insertion in model container [2025-03-16 19:12:37,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:12:37" (3/3) ... [2025-03-16 19:12:37,953 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-03-16 19:12:37,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:12:37,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c that has 1 procedures, 295 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:12:38,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:12:38,025 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;@73dd7344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:12:38,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:12:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 293 states have (on average 1.8430034129692834) internal successors, (540), 294 states have internal predecessors, (540), 0 states have call successors, (0), 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-16 19:12:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:12:38,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:38,037 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] [2025-03-16 19:12:38,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1778291907, now seen corresponding path program 1 times [2025-03-16 19:12:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-03-16 19:12:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:12:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:12:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:38,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:38,426 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-16 19:12:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-03-16 19:12:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575237788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:12:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769191160] [2025-03-16 19:12:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:12:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:38,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:12:38,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:12:38,460 INFO L87 Difference]: Start difference. First operand has 295 states, 293 states have (on average 1.8430034129692834) internal successors, (540), 294 states have internal predecessors, (540), 0 states have call successors, (0), 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 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 19:12:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:38,497 INFO L93 Difference]: Finished difference Result 397 states and 720 transitions. [2025-03-16 19:12:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:12:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:12:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:38,543 INFO L225 Difference]: With dead ends: 397 [2025-03-16 19:12:38,543 INFO L226 Difference]: Without dead ends: 293 [2025-03-16 19:12:38,545 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-16 19:12:38,549 INFO L435 NwaCegarLoop]: 538 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, 538 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-16 19:12:38,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-16 19:12:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-16 19:12:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.8356164383561644) internal successors, (536), 292 states have internal predecessors, (536), 0 states have call successors, (0), 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-16 19:12:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 536 transitions. [2025-03-16 19:12:38,600 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 536 transitions. Word has length 74 [2025-03-16 19:12:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 536 transitions. [2025-03-16 19:12:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 19:12:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 536 transitions. [2025-03-16 19:12:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:12:38,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:38,605 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] [2025-03-16 19:12:38,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:12:38,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:38,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1271910908, now seen corresponding path program 1 times [2025-03-16 19:12:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:38,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482413599] [2025-03-16 19:12:38,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:38,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:12:38,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:12:38,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:38,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:38,954 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-16 19:12:38,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482413599] [2025-03-16 19:12:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482413599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396109454] [2025-03-16 19:12:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:38,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:38,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:38,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:38,958 INFO L87 Difference]: Start difference. First operand 293 states and 536 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 19:12:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:39,074 INFO L93 Difference]: Finished difference Result 395 states and 715 transitions. [2025-03-16 19:12:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:12:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:39,076 INFO L225 Difference]: With dead ends: 395 [2025-03-16 19:12:39,076 INFO L226 Difference]: Without dead ends: 293 [2025-03-16 19:12:39,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:39,077 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:39,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1555 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:12:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-16 19:12:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-16 19:12:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.678082191780822) internal successors, (490), 292 states have internal predecessors, (490), 0 states have call successors, (0), 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-16 19:12:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 490 transitions. [2025-03-16 19:12:39,090 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 490 transitions. Word has length 74 [2025-03-16 19:12:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 490 transitions. [2025-03-16 19:12:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 19:12:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 490 transitions. [2025-03-16 19:12:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:12:39,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:39,093 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] [2025-03-16 19:12:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:12:39,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 136677946, now seen corresponding path program 1 times [2025-03-16 19:12:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657084280] [2025-03-16 19:12:39,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:12:39,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:12:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:39,274 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-16 19:12:39,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657084280] [2025-03-16 19:12:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657084280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110536915] [2025-03-16 19:12:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:39,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:39,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:39,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:39,277 INFO L87 Difference]: Start difference. First operand 293 states and 490 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:39,327 INFO L93 Difference]: Finished difference Result 479 states and 820 transitions. [2025-03-16 19:12:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-16 19:12:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:39,329 INFO L225 Difference]: With dead ends: 479 [2025-03-16 19:12:39,329 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 19:12:39,330 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-16 19:12:39,330 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 146 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 926 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 19:12:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-03-16 19:12:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.6923076923076923) internal successors, (638), 377 states have internal predecessors, (638), 0 states have call successors, (0), 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-16 19:12:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 638 transitions. [2025-03-16 19:12:39,348 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 638 transitions. Word has length 119 [2025-03-16 19:12:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:39,348 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 638 transitions. [2025-03-16 19:12:39,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 638 transitions. [2025-03-16 19:12:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:12:39,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:39,351 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] [2025-03-16 19:12:39,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:12:39,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:39,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1957242253, now seen corresponding path program 1 times [2025-03-16 19:12:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:39,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120263862] [2025-03-16 19:12:39,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:39,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:12:39,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:12:39,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:39,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:39,516 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-16 19:12:39,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120263862] [2025-03-16 19:12:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120263862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:39,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871244011] [2025-03-16 19:12:39,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:39,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:39,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:39,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:39,520 INFO L87 Difference]: Start difference. First operand 378 states and 638 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 19:12:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:39,550 INFO L93 Difference]: Finished difference Result 726 states and 1250 transitions. [2025-03-16 19:12:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-16 19:12:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:39,552 INFO L225 Difference]: With dead ends: 726 [2025-03-16 19:12:39,552 INFO L226 Difference]: Without dead ends: 542 [2025-03-16 19:12:39,553 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-16 19:12:39,557 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 147 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:39,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 934 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-16 19:12:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2025-03-16 19:12:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.712430426716141) internal successors, (923), 539 states have internal predecessors, (923), 0 states have call successors, (0), 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-16 19:12:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 923 transitions. [2025-03-16 19:12:39,586 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 923 transitions. Word has length 122 [2025-03-16 19:12:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 923 transitions. [2025-03-16 19:12:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 19:12:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 923 transitions. [2025-03-16 19:12:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:12:39,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:39,595 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] [2025-03-16 19:12:39,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:12:39,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:39,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2108599680, now seen corresponding path program 1 times [2025-03-16 19:12:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974852187] [2025-03-16 19:12:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:39,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:12:39,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:12:39,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:39,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:39,759 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-16 19:12:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974852187] [2025-03-16 19:12:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974852187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376834556] [2025-03-16 19:12:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:39,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:39,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:39,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:39,761 INFO L87 Difference]: Start difference. First operand 540 states and 923 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 19:12:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:39,787 INFO L93 Difference]: Finished difference Result 1192 states and 2069 transitions. [2025-03-16 19:12:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-16 19:12:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:39,791 INFO L225 Difference]: With dead ends: 1192 [2025-03-16 19:12:39,791 INFO L226 Difference]: Without dead ends: 846 [2025-03-16 19:12:39,792 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-16 19:12:39,792 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 140 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:39,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 935 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-16 19:12:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2025-03-16 19:12:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.7259786476868328) internal successors, (1455), 843 states have internal predecessors, (1455), 0 states have call successors, (0), 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-16 19:12:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1455 transitions. [2025-03-16 19:12:39,812 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1455 transitions. Word has length 125 [2025-03-16 19:12:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:39,812 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1455 transitions. [2025-03-16 19:12:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 19:12:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1455 transitions. [2025-03-16 19:12:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 19:12:39,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:39,815 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] [2025-03-16 19:12:39,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:12:39,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:39,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1235353543, now seen corresponding path program 1 times [2025-03-16 19:12:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240672023] [2025-03-16 19:12:39,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:39,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:39,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 19:12:39,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 19:12:39,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:39,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:39,949 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-16 19:12:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240672023] [2025-03-16 19:12:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240672023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206086778] [2025-03-16 19:12:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:39,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:39,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:39,953 INFO L87 Difference]: Start difference. First operand 844 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:39,984 INFO L93 Difference]: Finished difference Result 2064 states and 3593 transitions. [2025-03-16 19:12:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:39,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 19:12:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:39,991 INFO L225 Difference]: With dead ends: 2064 [2025-03-16 19:12:39,991 INFO L226 Difference]: Without dead ends: 1414 [2025-03-16 19:12:39,992 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-16 19:12:39,994 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 133 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:39,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 936 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-16 19:12:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1412. [2025-03-16 19:12:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.7313961729270022) internal successors, (2443), 1411 states have internal predecessors, (2443), 0 states have call successors, (0), 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-16 19:12:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2443 transitions. [2025-03-16 19:12:40,033 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2443 transitions. Word has length 128 [2025-03-16 19:12:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:40,033 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2443 transitions. [2025-03-16 19:12:40,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:12:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2443 transitions. [2025-03-16 19:12:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:12:40,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:40,037 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-16 19:12:40,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:12:40,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1460537030, now seen corresponding path program 1 times [2025-03-16 19:12:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574865100] [2025-03-16 19:12:40,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:40,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:12:40,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:12:40,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:40,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:40,207 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-16 19:12:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:40,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574865100] [2025-03-16 19:12:40,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574865100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:40,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:40,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:12:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094500631] [2025-03-16 19:12:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:40,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:12:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:40,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:12:40,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:12:40,209 INFO L87 Difference]: Start difference. First operand 1412 states and 2443 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-16 19:12:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:40,504 INFO L93 Difference]: Finished difference Result 7148 states and 12563 transitions. [2025-03-16 19:12:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:12:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-16 19:12:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:40,523 INFO L225 Difference]: With dead ends: 7148 [2025-03-16 19:12:40,523 INFO L226 Difference]: Without dead ends: 5930 [2025-03-16 19:12:40,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:12:40,529 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 1367 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:40,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 4222 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:12:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5930 states. [2025-03-16 19:12:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5930 to 2545. [2025-03-16 19:12:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2544 states have (on average 1.737814465408805) internal successors, (4421), 2544 states have internal predecessors, (4421), 0 states have call successors, (0), 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-16 19:12:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4421 transitions. [2025-03-16 19:12:40,622 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4421 transitions. Word has length 131 [2025-03-16 19:12:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4421 transitions. [2025-03-16 19:12:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-16 19:12:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4421 transitions. [2025-03-16 19:12:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:12:40,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:40,629 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-16 19:12:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:12:40,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1966292283, now seen corresponding path program 1 times [2025-03-16 19:12:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717159979] [2025-03-16 19:12:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:40,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:12:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:12:40,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:40,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:40,794 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-16 19:12:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:40,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717159979] [2025-03-16 19:12:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717159979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:40,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581889315] [2025-03-16 19:12:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:40,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:40,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:40,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:40,796 INFO L87 Difference]: Start difference. First operand 2545 states and 4421 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-16 19:12:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:40,907 INFO L93 Difference]: Finished difference Result 7390 states and 12950 transitions. [2025-03-16 19:12:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:40,908 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-16 19:12:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:40,926 INFO L225 Difference]: With dead ends: 7390 [2025-03-16 19:12:40,927 INFO L226 Difference]: Without dead ends: 5039 [2025-03-16 19:12:40,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 19:12:40,932 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 506 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:40,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1573 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:12:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2025-03-16 19:12:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 3775. [2025-03-16 19:12:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 3774 states have (on average 1.741123476417594) internal successors, (6571), 3774 states have internal predecessors, (6571), 0 states have call successors, (0), 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-16 19:12:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 6571 transitions. [2025-03-16 19:12:41,029 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 6571 transitions. Word has length 132 [2025-03-16 19:12:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:41,030 INFO L471 AbstractCegarLoop]: Abstraction has 3775 states and 6571 transitions. [2025-03-16 19:12:41,030 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-16 19:12:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 6571 transitions. [2025-03-16 19:12:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:12:41,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:41,035 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-16 19:12:41,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:12:41,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:41,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash -267265400, now seen corresponding path program 1 times [2025-03-16 19:12:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233581231] [2025-03-16 19:12:41,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:41,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:12:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:12:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:41,176 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-16 19:12:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233581231] [2025-03-16 19:12:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233581231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100483602] [2025-03-16 19:12:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:41,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:41,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:41,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:41,179 INFO L87 Difference]: Start difference. First operand 3775 states and 6571 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-16 19:12:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:41,265 INFO L93 Difference]: Finished difference Result 8322 states and 14569 transitions. [2025-03-16 19:12:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:41,266 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-16 19:12:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:41,285 INFO L225 Difference]: With dead ends: 8322 [2025-03-16 19:12:41,285 INFO L226 Difference]: Without dead ends: 5778 [2025-03-16 19:12:41,291 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-16 19:12:41,293 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 155 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:41,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1080 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2025-03-16 19:12:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5776. [2025-03-16 19:12:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 5775 states have (on average 1.738874458874459) internal successors, (10042), 5775 states have internal predecessors, (10042), 0 states have call successors, (0), 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-16 19:12:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 10042 transitions. [2025-03-16 19:12:41,434 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 10042 transitions. Word has length 133 [2025-03-16 19:12:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:41,434 INFO L471 AbstractCegarLoop]: Abstraction has 5776 states and 10042 transitions. [2025-03-16 19:12:41,435 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-16 19:12:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 10042 transitions. [2025-03-16 19:12:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:12:41,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:41,436 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-16 19:12:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:12:41,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash -601571644, now seen corresponding path program 1 times [2025-03-16 19:12:41,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140885964] [2025-03-16 19:12:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:41,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:12:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:12:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:41,523 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-16 19:12:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140885964] [2025-03-16 19:12:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140885964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589847625] [2025-03-16 19:12:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:41,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:41,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:41,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:41,525 INFO L87 Difference]: Start difference. First operand 5776 states and 10042 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-16 19:12:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:41,643 INFO L93 Difference]: Finished difference Result 11214 states and 19509 transitions. [2025-03-16 19:12:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:41,644 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-16 19:12:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:41,676 INFO L225 Difference]: With dead ends: 11214 [2025-03-16 19:12:41,676 INFO L226 Difference]: Without dead ends: 8140 [2025-03-16 19:12:41,682 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-16 19:12:41,683 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 148 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:41,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1074 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8140 states. [2025-03-16 19:12:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8140 to 8138. [2025-03-16 19:12:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8138 states, 8137 states have (on average 1.730613248125845) internal successors, (14082), 8137 states have internal predecessors, (14082), 0 states have call successors, (0), 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-16 19:12:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8138 states to 8138 states and 14082 transitions. [2025-03-16 19:12:41,868 INFO L78 Accepts]: Start accepts. Automaton has 8138 states and 14082 transitions. Word has length 133 [2025-03-16 19:12:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 8138 states and 14082 transitions. [2025-03-16 19:12:41,869 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-16 19:12:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8138 states and 14082 transitions. [2025-03-16 19:12:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:12:41,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:41,870 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-16 19:12:41,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:12:41,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2041059832, now seen corresponding path program 1 times [2025-03-16 19:12:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584817622] [2025-03-16 19:12:41,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:41,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:12:41,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:12:41,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:41,996 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-16 19:12:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584817622] [2025-03-16 19:12:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584817622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259134779] [2025-03-16 19:12:41,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:41,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:42,001 INFO L87 Difference]: Start difference. First operand 8138 states and 14082 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-16 19:12:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:42,119 INFO L93 Difference]: Finished difference Result 15768 states and 27293 transitions. [2025-03-16 19:12:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:42,120 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-16 19:12:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:42,142 INFO L225 Difference]: With dead ends: 15768 [2025-03-16 19:12:42,142 INFO L226 Difference]: Without dead ends: 11418 [2025-03-16 19:12:42,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:42,153 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 141 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:42,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1059 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2025-03-16 19:12:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 11416. [2025-03-16 19:12:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11416 states, 11415 states have (on average 1.7208935611038108) internal successors, (19644), 11415 states have internal predecessors, (19644), 0 states have call successors, (0), 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-16 19:12:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 19644 transitions. [2025-03-16 19:12:42,442 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 19644 transitions. Word has length 133 [2025-03-16 19:12:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:42,442 INFO L471 AbstractCegarLoop]: Abstraction has 11416 states and 19644 transitions. [2025-03-16 19:12:42,442 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-16 19:12:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 19644 transitions. [2025-03-16 19:12:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:12:42,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:42,443 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-16 19:12:42,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:12:42,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:42,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1351394116, now seen corresponding path program 1 times [2025-03-16 19:12:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161248594] [2025-03-16 19:12:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:42,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:12:42,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:12:42,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:42,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:42,540 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-16 19:12:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161248594] [2025-03-16 19:12:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161248594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:42,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:42,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:12:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971129543] [2025-03-16 19:12:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:42,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:12:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:12:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:12:42,543 INFO L87 Difference]: Start difference. First operand 11416 states and 19644 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-16 19:12:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:42,705 INFO L93 Difference]: Finished difference Result 22074 states and 37981 transitions. [2025-03-16 19:12:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:12:42,706 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-16 19:12:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:42,736 INFO L225 Difference]: With dead ends: 22074 [2025-03-16 19:12:42,736 INFO L226 Difference]: Without dead ends: 15940 [2025-03-16 19:12:42,745 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-16 19:12:42,745 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 134 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:42,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1044 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2025-03-16 19:12:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15938. [2025-03-16 19:12:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15938 states, 15937 states have (on average 1.7094810817594277) internal successors, (27244), 15937 states have internal predecessors, (27244), 0 states have call successors, (0), 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-16 19:12:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15938 states to 15938 states and 27244 transitions. [2025-03-16 19:12:43,103 INFO L78 Accepts]: Start accepts. Automaton has 15938 states and 27244 transitions. Word has length 133 [2025-03-16 19:12:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 15938 states and 27244 transitions. [2025-03-16 19:12:43,103 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-16 19:12:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15938 states and 27244 transitions. [2025-03-16 19:12:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:12:43,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:43,104 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-16 19:12:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:12:43,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:43,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -823878168, now seen corresponding path program 1 times [2025-03-16 19:12:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604833858] [2025-03-16 19:12:43,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:43,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:12:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:12:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:43,238 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-16 19:12:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604833858] [2025-03-16 19:12:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604833858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779747046] [2025-03-16 19:12:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:43,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:43,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:43,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:43,240 INFO L87 Difference]: Start difference. First operand 15938 states and 27244 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-16 19:12:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:43,611 INFO L93 Difference]: Finished difference Result 52266 states and 89426 transitions. [2025-03-16 19:12:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:43,612 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-16 19:12:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:43,686 INFO L225 Difference]: With dead ends: 52266 [2025-03-16 19:12:43,686 INFO L226 Difference]: Without dead ends: 36554 [2025-03-16 19:12:43,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 19:12:43,720 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 505 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:43,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1563 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:12:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36554 states. [2025-03-16 19:12:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36554 to 26157. [2025-03-16 19:12:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26157 states, 26156 states have (on average 1.6997629606973543) internal successors, (44459), 26156 states have internal predecessors, (44459), 0 states have call successors, (0), 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-16 19:12:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26157 states to 26157 states and 44459 transitions. [2025-03-16 19:12:44,427 INFO L78 Accepts]: Start accepts. Automaton has 26157 states and 44459 transitions. Word has length 133 [2025-03-16 19:12:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:44,427 INFO L471 AbstractCegarLoop]: Abstraction has 26157 states and 44459 transitions. [2025-03-16 19:12:44,428 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-16 19:12:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26157 states and 44459 transitions. [2025-03-16 19:12:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 19:12:44,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:44,429 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-16 19:12:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:12:44,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:44,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 231161447, now seen corresponding path program 1 times [2025-03-16 19:12:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425276713] [2025-03-16 19:12:44,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:44,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 19:12:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 19:12:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:44,545 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-16 19:12:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425276713] [2025-03-16 19:12:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425276713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:44,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128013723] [2025-03-16 19:12:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:44,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:44,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:44,547 INFO L87 Difference]: Start difference. First operand 26157 states and 44459 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-16 19:12:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:45,147 INFO L93 Difference]: Finished difference Result 85492 states and 145420 transitions. [2025-03-16 19:12:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:45,148 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-16 19:12:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:45,270 INFO L225 Difference]: With dead ends: 85492 [2025-03-16 19:12:45,270 INFO L226 Difference]: Without dead ends: 59561 [2025-03-16 19:12:45,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 19:12:45,313 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 503 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:45,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1565 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2025-03-16 19:12:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 42716. [2025-03-16 19:12:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42716 states, 42715 states have (on average 1.6899449841975887) internal successors, (72186), 42715 states have internal predecessors, (72186), 0 states have call successors, (0), 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-16 19:12:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42716 states to 42716 states and 72186 transitions. [2025-03-16 19:12:46,282 INFO L78 Accepts]: Start accepts. Automaton has 42716 states and 72186 transitions. Word has length 134 [2025-03-16 19:12:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:46,282 INFO L471 AbstractCegarLoop]: Abstraction has 42716 states and 72186 transitions. [2025-03-16 19:12:46,283 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-16 19:12:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 42716 states and 72186 transitions. [2025-03-16 19:12:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:12:46,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:46,283 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] [2025-03-16 19:12:46,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:12:46,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:46,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1422408438, now seen corresponding path program 1 times [2025-03-16 19:12:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:46,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058588963] [2025-03-16 19:12:46,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:46,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:12:46,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:12:46,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:46,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:46,394 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-16 19:12:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058588963] [2025-03-16 19:12:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058588963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:46,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:46,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795456125] [2025-03-16 19:12:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:46,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:46,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:46,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:46,396 INFO L87 Difference]: Start difference. First operand 42716 states and 72186 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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-16 19:12:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:47,251 INFO L93 Difference]: Finished difference Result 138054 states and 233478 transitions. [2025-03-16 19:12:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 19:12:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:47,476 INFO L225 Difference]: With dead ends: 138054 [2025-03-16 19:12:47,477 INFO L226 Difference]: Without dead ends: 95564 [2025-03-16 19:12:47,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 19:12:47,513 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 501 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:47,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1567 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95564 states. [2025-03-16 19:12:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95564 to 68915. [2025-03-16 19:12:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68915 states, 68914 states have (on average 1.680427779551325) internal successors, (115805), 68914 states have internal predecessors, (115805), 0 states have call successors, (0), 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-16 19:12:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68915 states to 68915 states and 115805 transitions. [2025-03-16 19:12:49,080 INFO L78 Accepts]: Start accepts. Automaton has 68915 states and 115805 transitions. Word has length 135 [2025-03-16 19:12:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:49,081 INFO L471 AbstractCegarLoop]: Abstraction has 68915 states and 115805 transitions. [2025-03-16 19:12:49,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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-16 19:12:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 68915 states and 115805 transitions. [2025-03-16 19:12:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 19:12:49,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:49,083 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] [2025-03-16 19:12:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:12:49,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1088193492, now seen corresponding path program 1 times [2025-03-16 19:12:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907938950] [2025-03-16 19:12:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:49,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 19:12:49,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 19:12:49,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:49,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:49,358 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-16 19:12:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907938950] [2025-03-16 19:12:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907938950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:12:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666609909] [2025-03-16 19:12:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:49,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:12:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:12:49,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:12:49,360 INFO L87 Difference]: Start difference. First operand 68915 states and 115805 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-16 19:12:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:50,133 INFO L93 Difference]: Finished difference Result 137606 states and 231247 transitions. [2025-03-16 19:12:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:12:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 19:12:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:50,231 INFO L225 Difference]: With dead ends: 137606 [2025-03-16 19:12:50,231 INFO L226 Difference]: Without dead ends: 68917 [2025-03-16 19:12:50,398 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-16 19:12:50,399 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 405 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:50,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1840 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:12:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68917 states. [2025-03-16 19:12:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68917 to 68915. [2025-03-16 19:12:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68915 states, 68914 states have (on average 1.671358504803088) internal successors, (115180), 68914 states have internal predecessors, (115180), 0 states have call successors, (0), 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-16 19:12:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68915 states to 68915 states and 115180 transitions. [2025-03-16 19:12:51,532 INFO L78 Accepts]: Start accepts. Automaton has 68915 states and 115180 transitions. Word has length 137 [2025-03-16 19:12:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 68915 states and 115180 transitions. [2025-03-16 19:12:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-16 19:12:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68915 states and 115180 transitions. [2025-03-16 19:12:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:12:51,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:51,534 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-16 19:12:51,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:12:51,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1341481198, now seen corresponding path program 1 times [2025-03-16 19:12:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707820409] [2025-03-16 19:12:51,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:51,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:12:51,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:12:51,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:51,842 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-16 19:12:51,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707820409] [2025-03-16 19:12:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707820409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:12:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817182057] [2025-03-16 19:12:51,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:12:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:51,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:12:51,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:12:51,846 INFO L87 Difference]: Start difference. First operand 68915 states and 115180 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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-16 19:12:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:53,034 INFO L93 Difference]: Finished difference Result 201524 states and 337235 transitions. [2025-03-16 19:12:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:12:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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-16 19:12:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:53,242 INFO L225 Difference]: With dead ends: 201524 [2025-03-16 19:12:53,242 INFO L226 Difference]: Without dead ends: 132835 [2025-03-16 19:12:53,303 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-16 19:12:53,304 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 399 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:53,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1851 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:12:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132835 states. [2025-03-16 19:12:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132835 to 132833. [2025-03-16 19:12:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132833 states, 132832 states have (on average 1.6592462659600096) internal successors, (220401), 132832 states have internal predecessors, (220401), 0 states have call successors, (0), 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-16 19:12:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132833 states to 132833 states and 220401 transitions. [2025-03-16 19:12:56,090 INFO L78 Accepts]: Start accepts. Automaton has 132833 states and 220401 transitions. Word has length 140 [2025-03-16 19:12:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:56,090 INFO L471 AbstractCegarLoop]: Abstraction has 132833 states and 220401 transitions. [2025-03-16 19:12:56,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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-16 19:12:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 132833 states and 220401 transitions. [2025-03-16 19:12:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:12:56,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:56,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:12:56,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:12:56,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:56,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1362711181, now seen corresponding path program 1 times [2025-03-16 19:12:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581396867] [2025-03-16 19:12:56,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:12:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:12:56,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:12:56,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:12:56,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:12:56,533 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-16 19:12:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:12:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581396867] [2025-03-16 19:12:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581396867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:12:56,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:12:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:12:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80153568] [2025-03-16 19:12:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:12:56,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:12:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:12:56,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:12:56,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:56,534 INFO L87 Difference]: Start difference. First operand 132833 states and 220401 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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-16 19:12:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:12:57,287 INFO L93 Difference]: Finished difference Result 136707 states and 226210 transitions. [2025-03-16 19:12:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:12:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:12:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:12:57,496 INFO L225 Difference]: With dead ends: 136707 [2025-03-16 19:12:57,496 INFO L226 Difference]: Without dead ends: 136705 [2025-03-16 19:12:57,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:12:57,534 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:12:57,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:12:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136705 states. [2025-03-16 19:12:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136705 to 136705. [2025-03-16 19:12:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136705 states, 136704 states have (on average 1.6403762874531835) internal successors, (224246), 136704 states have internal predecessors, (224246), 0 states have call successors, (0), 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-16 19:12:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136705 states to 136705 states and 224246 transitions. [2025-03-16 19:12:59,987 INFO L78 Accepts]: Start accepts. Automaton has 136705 states and 224246 transitions. Word has length 141 [2025-03-16 19:12:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:12:59,987 INFO L471 AbstractCegarLoop]: Abstraction has 136705 states and 224246 transitions. [2025-03-16 19:12:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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-16 19:12:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 136705 states and 224246 transitions. [2025-03-16 19:12:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:12:59,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:12:59,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:12:59,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:12:59,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:12:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:12:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2123878017, now seen corresponding path program 1 times [2025-03-16 19:12:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:12:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169375680] [2025-03-16 19:12:59,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:12:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:13:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:13:00,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:00,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:13:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169375680] [2025-03-16 19:13:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169375680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:00,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594879934] [2025-03-16 19:13:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:00,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:00,218 INFO L87 Difference]: Start difference. First operand 136705 states and 224246 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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-16 19:13:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:03,093 INFO L93 Difference]: Finished difference Result 376857 states and 619879 transitions. [2025-03-16 19:13:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:03,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 176 [2025-03-16 19:13:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:03,712 INFO L225 Difference]: With dead ends: 376857 [2025-03-16 19:13:03,713 INFO L226 Difference]: Without dead ends: 315055 [2025-03-16 19:13:03,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:13:03,793 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1014 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:03,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 2936 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315055 states. [2025-03-16 19:13:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315055 to 220719. [2025-03-16 19:13:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220719 states, 220718 states have (on average 1.6371025471416014) internal successors, (361338), 220718 states have internal predecessors, (361338), 0 states have call successors, (0), 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-16 19:13:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220719 states to 220719 states and 361338 transitions. [2025-03-16 19:13:08,159 INFO L78 Accepts]: Start accepts. Automaton has 220719 states and 361338 transitions. Word has length 176 [2025-03-16 19:13:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 220719 states and 361338 transitions. [2025-03-16 19:13:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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-16 19:13:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 220719 states and 361338 transitions. [2025-03-16 19:13:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:13:08,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:08,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:08,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:13:08,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:08,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1789571773, now seen corresponding path program 1 times [2025-03-16 19:13:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038312825] [2025-03-16 19:13:08,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:08,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:13:08,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:13:08,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:13:08,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038312825] [2025-03-16 19:13:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038312825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:08,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:08,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881585321] [2025-03-16 19:13:08,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:08,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:08,581 INFO L87 Difference]: Start difference. First operand 220719 states and 361338 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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-16 19:13:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:11,566 INFO L93 Difference]: Finished difference Result 424331 states and 697987 transitions. [2025-03-16 19:13:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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 176 [2025-03-16 19:13:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:12,231 INFO L225 Difference]: With dead ends: 424331 [2025-03-16 19:13:12,231 INFO L226 Difference]: Without dead ends: 363679 [2025-03-16 19:13:12,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:13:12,359 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1016 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:12,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2892 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363679 states.