./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.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_lcr-var-start-time.5.1.ufo.BOUNDED-10.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 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:08:07,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:08:07,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:08:07,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:08:07,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:08:08,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:08:08,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:08:08,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:08:08,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:08:08,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:08:08,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:08:08,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:08:08,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:08:08,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:08:08,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:08:08,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:08:08,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:08,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:08:08,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:08:08,018 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 -> 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e [2025-03-16 19:08:08,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:08:08,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:08:08,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:08:08,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:08:08,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:08:08,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-16 19:08:09,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de88251c/004c27180ba84c4d836044cf0db61981/FLAG23e968725 [2025-03-16 19:08:09,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:08:09,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-16 19:08:09,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de88251c/004c27180ba84c4d836044cf0db61981/FLAG23e968725 [2025-03-16 19:08:09,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de88251c/004c27180ba84c4d836044cf0db61981 [2025-03-16 19:08:09,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:08:09,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:08:09,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:09,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:08:09,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:08:09,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09, skipping insertion in model container [2025-03-16 19:08:09,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:08:09,947 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_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2025-03-16 19:08:09,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:09,959 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:08:10,018 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_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2025-03-16 19:08:10,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:10,039 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:08:10,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10 WrapperNode [2025-03-16 19:08:10,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:10,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:10,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:08:10,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:08:10,046 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:08:10" (1/1) ... [2025-03-16 19:08:10,055 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:08:10" (1/1) ... [2025-03-16 19:08:10,089 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 383 [2025-03-16 19:08:10,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:10,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:08:10,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:08:10,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:08:10,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,118 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:08:10,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:08:10,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:08:10,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:08:10,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:08:10,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (1/1) ... [2025-03-16 19:08:10,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:10,160 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:08:10,164 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:08:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:08:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:08:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:08:10,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:08:10,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:08:10,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:08:10,660 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-16 19:08:10,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:08:10,669 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:08:10,669 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:08:10,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:10 BoogieIcfgContainer [2025-03-16 19:08:10,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:08:10,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:08:10,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:08:10,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:08:10,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:08:09" (1/3) ... [2025-03-16 19:08:10,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4789acd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:10, skipping insertion in model container [2025-03-16 19:08:10,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:10" (2/3) ... [2025-03-16 19:08:10,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4789acd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:10, skipping insertion in model container [2025-03-16 19:08:10,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:10" (3/3) ... [2025-03-16 19:08:10,676 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2025-03-16 19:08:10,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:08:10,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c that has 1 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:08:10,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:08:10,743 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;@162e4383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:08:10,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:08:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.7789473684210526) internal successors, (169), 96 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 19:08:10,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,752 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] [2025-03-16 19:08:10,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1673978990, now seen corresponding path program 1 times [2025-03-16 19:08:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346703015] [2025-03-16 19:08:10,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 19:08:10,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 19:08:10,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,987 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:08:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346703015] [2025-03-16 19:08:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346703015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:08:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549884216] [2025-03-16 19:08:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:08:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:08:11,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:08:11,008 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.7789473684210526) internal successors, (169), 96 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:08:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,020 INFO L93 Difference]: Finished difference Result 159 states and 270 transitions. [2025-03-16 19:08:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:08:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 19:08:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,029 INFO L225 Difference]: With dead ends: 159 [2025-03-16 19:08:11,029 INFO L226 Difference]: Without dead ends: 95 [2025-03-16 19:08:11,031 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:08:11,033 INFO L435 NwaCegarLoop]: 167 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, 167 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:08:11,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-16 19:08:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-16 19:08:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 94 states have internal predecessors, (165), 0 states have call successors, (0), 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:08:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 165 transitions. [2025-03-16 19:08:11,059 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 165 transitions. Word has length 30 [2025-03-16 19:08:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,060 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 165 transitions. [2025-03-16 19:08:11,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:08:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 165 transitions. [2025-03-16 19:08:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 19:08:11,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,061 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] [2025-03-16 19:08:11,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:08:11,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,062 INFO L85 PathProgramCache]: Analyzing trace with hash -712364973, now seen corresponding path program 1 times [2025-03-16 19:08:11,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882540542] [2025-03-16 19:08:11,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 19:08:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 19:08:11,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,247 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:08:11,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882540542] [2025-03-16 19:08:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882540542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:08:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966364724] [2025-03-16 19:08:11,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:08:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:08:11,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:08:11,250 INFO L87 Difference]: Start difference. First operand 95 states and 165 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:08:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,316 INFO L93 Difference]: Finished difference Result 157 states and 265 transitions. [2025-03-16 19:08:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:08:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 19:08:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,317 INFO L225 Difference]: With dead ends: 157 [2025-03-16 19:08:11,317 INFO L226 Difference]: Without dead ends: 95 [2025-03-16 19:08:11,317 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:08:11,318 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:11,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-16 19:08:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-16 19:08:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 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:08:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-03-16 19:08:11,326 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 30 [2025-03-16 19:08:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,326 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-03-16 19:08:11,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:08:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-03-16 19:08:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:08:11,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,327 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] [2025-03-16 19:08:11,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:08:11,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1752818521, now seen corresponding path program 1 times [2025-03-16 19:08:11,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-16 19:08:11,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:08:11,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:08:11,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,433 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:08:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-16 19:08:11,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434297073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879977873] [2025-03-16 19:08:11,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:11,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:11,436 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,460 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2025-03-16 19:08:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:11,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:08:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,461 INFO L225 Difference]: With dead ends: 205 [2025-03-16 19:08:11,461 INFO L226 Difference]: Without dead ends: 146 [2025-03-16 19:08:11,462 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:08:11,462 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 77 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 280 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:08:11,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 280 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-16 19:08:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-03-16 19:08:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 0 states have call successors, (0), 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:08:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2025-03-16 19:08:11,472 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 61 [2025-03-16 19:08:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2025-03-16 19:08:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2025-03-16 19:08:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:08:11,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,473 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] [2025-03-16 19:08:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:08:11,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1843317364, now seen corresponding path program 1 times [2025-03-16 19:08:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906110368] [2025-03-16 19:08:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:08:11,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:08:11,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,591 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:08:11,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906110368] [2025-03-16 19:08:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906110368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435018481] [2025-03-16 19:08:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:11,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:11,592 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,615 INFO L93 Difference]: Finished difference Result 344 states and 542 transitions. [2025-03-16 19:08:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:08:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,618 INFO L225 Difference]: With dead ends: 344 [2025-03-16 19:08:11,619 INFO L226 Difference]: Without dead ends: 236 [2025-03-16 19:08:11,620 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:08:11,620 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 73 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 277 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:08:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-16 19:08:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-16 19:08:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5493562231759657) internal successors, (361), 233 states have internal predecessors, (361), 0 states have call successors, (0), 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:08:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2025-03-16 19:08:11,636 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 61 [2025-03-16 19:08:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,636 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2025-03-16 19:08:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2025-03-16 19:08:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:08:11,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,637 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] [2025-03-16 19:08:11,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:08:11,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash 165124415, now seen corresponding path program 1 times [2025-03-16 19:08:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-03-16 19:08:11,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:08:11,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:08:11,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,721 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:08:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-03-16 19:08:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144296052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363702829] [2025-03-16 19:08:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:11,723 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,746 INFO L93 Difference]: Finished difference Result 598 states and 955 transitions. [2025-03-16 19:08:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:11,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:08:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,751 INFO L225 Difference]: With dead ends: 598 [2025-03-16 19:08:11,751 INFO L226 Difference]: Without dead ends: 400 [2025-03-16 19:08:11,751 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:08:11,752 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 274 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:08:11,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 274 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-16 19:08:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2025-03-16 19:08:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.5743073047858942) internal successors, (625), 397 states have internal predecessors, (625), 0 states have call successors, (0), 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:08:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 625 transitions. [2025-03-16 19:08:11,778 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 625 transitions. Word has length 61 [2025-03-16 19:08:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 625 transitions. [2025-03-16 19:08:11,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 625 transitions. [2025-03-16 19:08:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:08:11,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,780 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] [2025-03-16 19:08:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:08:11,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash 685887090, now seen corresponding path program 1 times [2025-03-16 19:08:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-03-16 19:08:11,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:08:11,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:08:11,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,942 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:08:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-03-16 19:08:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671499279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562401806] [2025-03-16 19:08:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:11,945 INFO L87 Difference]: Start difference. First operand 398 states and 625 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,097 INFO L93 Difference]: Finished difference Result 2570 states and 4159 transitions. [2025-03-16 19:08:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:08:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:08:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,108 INFO L225 Difference]: With dead ends: 2570 [2025-03-16 19:08:12,109 INFO L226 Difference]: Without dead ends: 2208 [2025-03-16 19:08:12,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:08:12,112 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 923 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:12,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1196 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2025-03-16 19:08:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 758. [2025-03-16 19:08:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.581241743725231) internal successors, (1197), 757 states have internal predecessors, (1197), 0 states have call successors, (0), 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:08:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1197 transitions. [2025-03-16 19:08:12,153 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1197 transitions. Word has length 61 [2025-03-16 19:08:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1197 transitions. [2025-03-16 19:08:12,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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:08:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1197 transitions. [2025-03-16 19:08:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:08:12,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,156 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] [2025-03-16 19:08:12,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:08:12,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash -211381422, now seen corresponding path program 1 times [2025-03-16 19:08:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362427900] [2025-03-16 19:08:12,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:08:12,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:08:12,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,405 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:08:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362427900] [2025-03-16 19:08:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362427900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256899183] [2025-03-16 19:08:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:12,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:12,408 INFO L87 Difference]: Start difference. First operand 758 states and 1197 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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:08:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,447 INFO L93 Difference]: Finished difference Result 792 states and 1246 transitions. [2025-03-16 19:08:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 19:08:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,468 INFO L225 Difference]: With dead ends: 792 [2025-03-16 19:08:12,468 INFO L226 Difference]: Without dead ends: 790 [2025-03-16 19:08:12,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:12,469 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:12,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-16 19:08:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-16 19:08:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.5576679340937896) internal successors, (1229), 789 states have internal predecessors, (1229), 0 states have call successors, (0), 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:08:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1229 transitions. [2025-03-16 19:08:12,498 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1229 transitions. Word has length 62 [2025-03-16 19:08:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,498 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1229 transitions. [2025-03-16 19:08:12,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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:08:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1229 transitions. [2025-03-16 19:08:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:08:12,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,499 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] [2025-03-16 19:08:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:08:12,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2039972402, now seen corresponding path program 1 times [2025-03-16 19:08:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704941539] [2025-03-16 19:08:12,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:08:12,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:08:12,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:12,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704941539] [2025-03-16 19:08:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704941539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321982601] [2025-03-16 19:08:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:12,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:12,580 INFO L87 Difference]: Start difference. First operand 790 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:08:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,613 INFO L93 Difference]: Finished difference Result 2186 states and 3423 transitions. [2025-03-16 19:08:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:08:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,620 INFO L225 Difference]: With dead ends: 2186 [2025-03-16 19:08:12,621 INFO L226 Difference]: Without dead ends: 1432 [2025-03-16 19:08:12,622 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:08:12,622 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:12,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-16 19:08:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1430. [2025-03-16 19:08:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.5486354093771868) internal successors, (2213), 1429 states have internal predecessors, (2213), 0 states have call successors, (0), 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:08:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2213 transitions. [2025-03-16 19:08:12,667 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2213 transitions. Word has length 63 [2025-03-16 19:08:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,667 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2213 transitions. [2025-03-16 19:08:12,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:08:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2213 transitions. [2025-03-16 19:08:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:08:12,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,669 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] [2025-03-16 19:08:12,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:08:12,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 165614527, now seen corresponding path program 1 times [2025-03-16 19:08:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612380427] [2025-03-16 19:08:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:08:12,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:08:12,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,718 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:08:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612380427] [2025-03-16 19:08:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612380427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921216962] [2025-03-16 19:08:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:12,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:12,719 INFO L87 Difference]: Start difference. First operand 1430 states and 2213 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:08:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,766 INFO L93 Difference]: Finished difference Result 2812 states and 4378 transitions. [2025-03-16 19:08:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:08:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,772 INFO L225 Difference]: With dead ends: 2812 [2025-03-16 19:08:12,772 INFO L226 Difference]: Without dead ends: 2058 [2025-03-16 19:08:12,773 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:08:12,776 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 85 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 303 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:08:12,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-16 19:08:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2056. [2025-03-16 19:08:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2055 states have (on average 1.5411192214111922) internal successors, (3167), 2055 states have internal predecessors, (3167), 0 states have call successors, (0), 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:08:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3167 transitions. [2025-03-16 19:08:12,824 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3167 transitions. Word has length 63 [2025-03-16 19:08:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,824 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 3167 transitions. [2025-03-16 19:08:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:08:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3167 transitions. [2025-03-16 19:08:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:08:12,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,825 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] [2025-03-16 19:08:12,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:08:12,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1491735039, now seen corresponding path program 1 times [2025-03-16 19:08:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-03-16 19:08:12,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:08:12,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:08:12,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,878 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:08:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-03-16 19:08:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135714428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320802612] [2025-03-16 19:08:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:12,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:12,879 INFO L87 Difference]: Start difference. First operand 2056 states and 3167 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:08:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,937 INFO L93 Difference]: Finished difference Result 5708 states and 8753 transitions. [2025-03-16 19:08:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:12,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 19:08:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,950 INFO L225 Difference]: With dead ends: 5708 [2025-03-16 19:08:12,950 INFO L226 Difference]: Without dead ends: 3690 [2025-03-16 19:08:12,954 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:08:12,955 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 81 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 303 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:08:12,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-16 19:08:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-16 19:08:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3687 states have (on average 1.512069433143477) internal successors, (5575), 3687 states have internal predecessors, (5575), 0 states have call successors, (0), 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:08:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5575 transitions. [2025-03-16 19:08:13,062 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5575 transitions. Word has length 64 [2025-03-16 19:08:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:13,062 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 5575 transitions. [2025-03-16 19:08:13,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:08:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5575 transitions. [2025-03-16 19:08:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:08:13,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:13,064 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:13,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:08:13,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:13,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash 991781430, now seen corresponding path program 1 times [2025-03-16 19:08:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:13,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473116417] [2025-03-16 19:08:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:13,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:08:13,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:08:13,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:13,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473116417] [2025-03-16 19:08:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473116417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386237735] [2025-03-16 19:08:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:13,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:13,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:13,159 INFO L87 Difference]: Start difference. First operand 3688 states and 5575 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:08:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:13,226 INFO L93 Difference]: Finished difference Result 7340 states and 11113 transitions. [2025-03-16 19:08:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 19:08:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:13,237 INFO L225 Difference]: With dead ends: 7340 [2025-03-16 19:08:13,237 INFO L226 Difference]: Without dead ends: 3690 [2025-03-16 19:08:13,240 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:08:13,241 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:13,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 295 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-16 19:08:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-16 19:08:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3687 states have (on average 1.4990507187415243) internal successors, (5527), 3687 states have internal predecessors, (5527), 0 states have call successors, (0), 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:08:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5527 transitions. [2025-03-16 19:08:13,321 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5527 transitions. Word has length 89 [2025-03-16 19:08:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:13,321 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 5527 transitions. [2025-03-16 19:08:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:08:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5527 transitions. [2025-03-16 19:08:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:08:13,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:13,323 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:13,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:08:13,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:13,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -505560509, now seen corresponding path program 1 times [2025-03-16 19:08:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:13,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-03-16 19:08:13,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:13,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:13,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:08:13,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:08:13,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:13,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:14,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-03-16 19:08:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791370968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:14,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541330115] [2025-03-16 19:08:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:14,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:14,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:08:14,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:08:14,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:08:14,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:14,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:08:14,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:15,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541330115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:15,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:15,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-03-16 19:08:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893643004] [2025-03-16 19:08:15,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:15,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 19:08:15,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:15,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 19:08:15,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:08:15,732 INFO L87 Difference]: Start difference. First operand 3688 states and 5527 transitions. Second operand has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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:08:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:16,878 INFO L93 Difference]: Finished difference Result 16238 states and 24522 transitions. [2025-03-16 19:08:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:08:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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 89 [2025-03-16 19:08:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:16,912 INFO L225 Difference]: With dead ends: 16238 [2025-03-16 19:08:16,912 INFO L226 Difference]: Without dead ends: 12588 [2025-03-16 19:08:16,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 19:08:16,919 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2217 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:16,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2217 Valid, 1875 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:08:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12588 states. [2025-03-16 19:08:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12588 to 7656. [2025-03-16 19:08:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7656 states, 7655 states have (on average 1.489092096668844) internal successors, (11399), 7655 states have internal predecessors, (11399), 0 states have call successors, (0), 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:08:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 11399 transitions. [2025-03-16 19:08:17,139 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 11399 transitions. Word has length 89 [2025-03-16 19:08:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 7656 states and 11399 transitions. [2025-03-16 19:08:17,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 23 states have internal predecessors, (223), 0 states have call successors, (0), 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:08:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 11399 transitions. [2025-03-16 19:08:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:08:17,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:17,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:17,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:08:17,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 19:08:17,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:17,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 571047329, now seen corresponding path program 1 times [2025-03-16 19:08:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029416346] [2025-03-16 19:08:17,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:17,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:08:17,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:08:17,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:17,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029416346] [2025-03-16 19:08:17,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029416346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770822907] [2025-03-16 19:08:17,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:17,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:17,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:17,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:17,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:08:17,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:08:17,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:08:17,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:17,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:17,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:08:17,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:17,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770822907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:17,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2025-03-16 19:08:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721277684] [2025-03-16 19:08:17,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:17,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:08:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:17,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:08:17,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:08:17,962 INFO L87 Difference]: Start difference. First operand 7656 states and 11399 transitions. Second operand has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 0 states have call successors, (0), 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:08:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:18,119 INFO L93 Difference]: Finished difference Result 24336 states and 36419 transitions. [2025-03-16 19:08:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:18,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 0 states have call successors, (0), 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 90 [2025-03-16 19:08:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:18,156 INFO L225 Difference]: With dead ends: 24336 [2025-03-16 19:08:18,156 INFO L226 Difference]: Without dead ends: 18494 [2025-03-16 19:08:18,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:18,168 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 343 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:18,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 710 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18494 states. [2025-03-16 19:08:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18494 to 18488. [2025-03-16 19:08:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18488 states, 18487 states have (on average 1.4803375344836913) internal successors, (27367), 18487 states have internal predecessors, (27367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18488 states to 18488 states and 27367 transitions. [2025-03-16 19:08:18,611 INFO L78 Accepts]: Start accepts. Automaton has 18488 states and 27367 transitions. Word has length 90 [2025-03-16 19:08:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 18488 states and 27367 transitions. [2025-03-16 19:08:18,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 0 states have call successors, (0), 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:08:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 18488 states and 27367 transitions. [2025-03-16 19:08:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:08:18,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:18,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:18,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:08:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 19:08:18,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 203766166, now seen corresponding path program 1 times [2025-03-16 19:08:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-16 19:08:18,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:18,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:08:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:08:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:08:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-16 19:08:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681619342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984079448] [2025-03-16 19:08:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:18,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:18,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:18,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:18,931 INFO L87 Difference]: Start difference. First operand 18488 states and 27367 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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:08:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:19,545 INFO L93 Difference]: Finished difference Result 63228 states and 94193 transitions. [2025-03-16 19:08:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:08:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 90 [2025-03-16 19:08:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:19,644 INFO L225 Difference]: With dead ends: 63228 [2025-03-16 19:08:19,644 INFO L226 Difference]: Without dead ends: 53762 [2025-03-16 19:08:19,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:08:19,669 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 768 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:19,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1063 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53762 states. [2025-03-16 19:08:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53762 to 27616. [2025-03-16 19:08:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27616 states, 27615 states have (on average 1.4762629005975014) internal successors, (40767), 27615 states have internal predecessors, (40767), 0 states have call successors, (0), 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:08:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27616 states to 27616 states and 40767 transitions. [2025-03-16 19:08:20,383 INFO L78 Accepts]: Start accepts. Automaton has 27616 states and 40767 transitions. Word has length 90 [2025-03-16 19:08:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:20,383 INFO L471 AbstractCegarLoop]: Abstraction has 27616 states and 40767 transitions. [2025-03-16 19:08:20,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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:08:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27616 states and 40767 transitions. [2025-03-16 19:08:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:08:20,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:20,385 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:08:20,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 641502731, now seen corresponding path program 1 times [2025-03-16 19:08:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-16 19:08:20,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:08:20,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:08:20,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:20,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-16 19:08:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059241389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957668439] [2025-03-16 19:08:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:20,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:20,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:20,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:20,429 INFO L87 Difference]: Start difference. First operand 27616 states and 40767 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:08:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:20,887 INFO L93 Difference]: Finished difference Result 77748 states and 114297 transitions. [2025-03-16 19:08:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 19:08:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:20,953 INFO L225 Difference]: With dead ends: 77748 [2025-03-16 19:08:20,953 INFO L226 Difference]: Without dead ends: 50170 [2025-03-16 19:08:20,978 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:08:20,979 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 63 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:20,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 307 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50170 states. [2025-03-16 19:08:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50170 to 50072. [2025-03-16 19:08:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50072 states, 50071 states have (on average 1.4524774819755946) internal successors, (72727), 50071 states have internal predecessors, (72727), 0 states have call successors, (0), 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:08:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50072 states to 50072 states and 72727 transitions. [2025-03-16 19:08:22,201 INFO L78 Accepts]: Start accepts. Automaton has 50072 states and 72727 transitions. Word has length 91 [2025-03-16 19:08:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 50072 states and 72727 transitions. [2025-03-16 19:08:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:08:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 50072 states and 72727 transitions. [2025-03-16 19:08:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:08:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:22,205 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:08:22,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1629016546, now seen corresponding path program 1 times [2025-03-16 19:08:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-16 19:08:22,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:08:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:08:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:08:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-16 19:08:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516773492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:22,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703699122] [2025-03-16 19:08:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:22,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:22,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:22,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:22,471 INFO L87 Difference]: Start difference. First operand 50072 states and 72727 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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:08:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:23,541 INFO L93 Difference]: Finished difference Result 130788 states and 191497 transitions. [2025-03-16 19:08:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:08:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 91 [2025-03-16 19:08:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:23,696 INFO L225 Difference]: With dead ends: 130788 [2025-03-16 19:08:23,696 INFO L226 Difference]: Without dead ends: 113602 [2025-03-16 19:08:23,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:08:23,733 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 801 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 948 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113602 states. [2025-03-16 19:08:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113602 to 66632. [2025-03-16 19:08:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66632 states, 66631 states have (on average 1.4502408788701955) internal successors, (96631), 66631 states have internal predecessors, (96631), 0 states have call successors, (0), 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:08:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66632 states to 66632 states and 96631 transitions. [2025-03-16 19:08:25,399 INFO L78 Accepts]: Start accepts. Automaton has 66632 states and 96631 transitions. Word has length 91 [2025-03-16 19:08:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:25,399 INFO L471 AbstractCegarLoop]: Abstraction has 66632 states and 96631 transitions. [2025-03-16 19:08:25,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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:08:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66632 states and 96631 transitions. [2025-03-16 19:08:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:08:25,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:25,404 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:08:25,405 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -847916111, now seen corresponding path program 1 times [2025-03-16 19:08:25,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040811087] [2025-03-16 19:08:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:25,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:08:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:08:25,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:25,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:08:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040811087] [2025-03-16 19:08:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040811087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772288794] [2025-03-16 19:08:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:25,534 INFO L87 Difference]: Start difference. First operand 66632 states and 96631 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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:08:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:27,460 INFO L93 Difference]: Finished difference Result 147348 states and 215401 transitions. [2025-03-16 19:08:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:08:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 91 [2025-03-16 19:08:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:27,585 INFO L225 Difference]: With dead ends: 147348 [2025-03-16 19:08:27,586 INFO L226 Difference]: Without dead ends: 130162 [2025-03-16 19:08:27,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:08:27,610 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 853 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:27,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 955 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130162 states. [2025-03-16 19:08:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130162 to 83192. [2025-03-16 19:08:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83192 states, 83191 states have (on average 1.4488947121683835) internal successors, (120535), 83191 states have internal predecessors, (120535), 0 states have call successors, (0), 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:08:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83192 states to 83192 states and 120535 transitions. [2025-03-16 19:08:29,229 INFO L78 Accepts]: Start accepts. Automaton has 83192 states and 120535 transitions. Word has length 91 [2025-03-16 19:08:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:29,230 INFO L471 AbstractCegarLoop]: Abstraction has 83192 states and 120535 transitions. [2025-03-16 19:08:29,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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:08:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83192 states and 120535 transitions. [2025-03-16 19:08:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:08:29,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:29,234 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:08:29,234 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2038154556, now seen corresponding path program 1 times [2025-03-16 19:08:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905580855] [2025-03-16 19:08:29,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:29,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:08:29,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:08:29,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:29,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:08:29,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:29,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905580855] [2025-03-16 19:08:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905580855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:29,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586580666] [2025-03-16 19:08:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:29,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:29,339 INFO L87 Difference]: Start difference. First operand 83192 states and 120535 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:31,641 INFO L93 Difference]: Finished difference Result 163908 states and 239305 transitions. [2025-03-16 19:08:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:08:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:08:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:31,828 INFO L225 Difference]: With dead ends: 163908 [2025-03-16 19:08:31,828 INFO L226 Difference]: Without dead ends: 146722 [2025-03-16 19:08:31,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:08:31,881 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 775 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:31,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1052 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146722 states. [2025-03-16 19:08:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146722 to 99752. [2025-03-16 19:08:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99752 states, 99751 states have (on average 1.4479955088169543) internal successors, (144439), 99751 states have internal predecessors, (144439), 0 states have call successors, (0), 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:08:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99752 states to 99752 states and 144439 transitions. [2025-03-16 19:08:34,158 INFO L78 Accepts]: Start accepts. Automaton has 99752 states and 144439 transitions. Word has length 91 [2025-03-16 19:08:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:34,159 INFO L471 AbstractCegarLoop]: Abstraction has 99752 states and 144439 transitions. [2025-03-16 19:08:34,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 99752 states and 144439 transitions. [2025-03-16 19:08:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:08:34,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:34,163 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:34,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:08:34,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 395553495, now seen corresponding path program 1 times [2025-03-16 19:08:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:34,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-03-16 19:08:34,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:34,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:08:34,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:08:34,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-03-16 19:08:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630819716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040041950] [2025-03-16 19:08:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:34,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:34,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:34,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:34,204 INFO L87 Difference]: Start difference. First operand 99752 states and 144439 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:08:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:37,033 INFO L93 Difference]: Finished difference Result 279100 states and 402297 transitions. [2025-03-16 19:08:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 19:08:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:37,275 INFO L225 Difference]: With dead ends: 279100 [2025-03-16 19:08:37,275 INFO L226 Difference]: Without dead ends: 179386 [2025-03-16 19:08:37,363 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:08:37,364 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:37,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 264 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179386 states. [2025-03-16 19:08:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179386 to 179384. [2025-03-16 19:08:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179384 states, 179383 states have (on average 1.4226933432934001) internal successors, (255207), 179383 states have internal predecessors, (255207), 0 states have call successors, (0), 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:08:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179384 states to 179384 states and 255207 transitions. [2025-03-16 19:08:41,364 INFO L78 Accepts]: Start accepts. Automaton has 179384 states and 255207 transitions. Word has length 91 [2025-03-16 19:08:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:41,365 INFO L471 AbstractCegarLoop]: Abstraction has 179384 states and 255207 transitions. [2025-03-16 19:08:41,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:08:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 179384 states and 255207 transitions. [2025-03-16 19:08:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:08:41,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:41,372 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:08:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:08:41,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1663767792, now seen corresponding path program 1 times [2025-03-16 19:08:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:41,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347886169] [2025-03-16 19:08:41,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:41,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:08:41,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:08:41,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:41,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347886169] [2025-03-16 19:08:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347886169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:08:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596693] [2025-03-16 19:08:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:08:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:41,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:08:41,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:08:41,509 INFO L87 Difference]: Start difference. First operand 179384 states and 255207 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)