./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label58.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/eca-rers2012/Problem12_label58.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 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:58:25,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:58:25,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:58:25,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:58:25,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:58:25,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:58:25,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:58:25,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:58:25,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:58:25,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:58:25,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:58:25,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:58:25,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:58:25,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:58:25,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:58:25,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:58:25,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:58:25,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:58:25,181 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 -> 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262 [2025-03-16 14:58:25,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:58:25,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:58:25,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:58:25,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:58:25,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:58:25,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label58.c [2025-03-16 14:58:26,584 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6062598/2001345b61e04177ab04669f151a669f/FLAG891bb099c [2025-03-16 14:58:27,030 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:58:27,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label58.c [2025-03-16 14:58:27,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6062598/2001345b61e04177ab04669f151a669f/FLAG891bb099c [2025-03-16 14:58:27,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6062598/2001345b61e04177ab04669f151a669f [2025-03-16 14:58:27,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:58:27,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:58:27,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:58:27,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:58:27,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:58:27,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:58:27" (1/1) ... [2025-03-16 14:58:27,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df6e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:27, skipping insertion in model container [2025-03-16 14:58:27,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:58:27" (1/1) ... [2025-03-16 14:58:27,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:58:27,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label58.c[4474,4487] [2025-03-16 14:58:27,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:58:27,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:58:27,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label58.c[4474,4487] [2025-03-16 14:58:28,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:58:28,058 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:58:28,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28 WrapperNode [2025-03-16 14:58:28,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:58:28,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:58:28,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:58:28,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:58:28,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,340 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:58:28,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:58:28,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:58:28,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:58:28,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:58:28,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,515 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 14:58:28,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:58:28,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:58:28,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:58:28,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:58:28,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (1/1) ... [2025-03-16 14:58:28,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:58:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:58:28,711 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 14:58:28,713 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 14:58:28,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:58:28,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:58:28,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:58:28,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:58:28,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:58:28,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:58:32,020 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:58:32,021 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:58:32,021 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:58:32,180 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:58:32,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:58:32,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:58:32,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:58:32,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:58:32 BoogieIcfgContainer [2025-03-16 14:58:32,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:58:32,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:58:32,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:58:32,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:58:32,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:58:27" (1/3) ... [2025-03-16 14:58:32,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cdcc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:58:32, skipping insertion in model container [2025-03-16 14:58:32,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:28" (2/3) ... [2025-03-16 14:58:32,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cdcc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:58:32, skipping insertion in model container [2025-03-16 14:58:32,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:58:32" (3/3) ... [2025-03-16 14:58:32,220 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label58.c [2025-03-16 14:58:32,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:58:32,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label58.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:58:32,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:58:32,316 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;@20f6de0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:58:32,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:58:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 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 14:58:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 14:58:32,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:32,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:32,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:32,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1081437500, now seen corresponding path program 1 times [2025-03-16 14:58:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916600128] [2025-03-16 14:58:32,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:32,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:58:32,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:58:32,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:32,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:32,430 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 14:58:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916600128] [2025-03-16 14:58:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916600128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:58:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688218221] [2025-03-16 14:58:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:58:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:32,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:58:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:58:32,454 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:58:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:32,522 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:58:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:58:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-16 14:58:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:32,539 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:58:32,539 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:58:32,546 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 14:58:32,550 INFO L435 NwaCegarLoop]: 1441 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, 1441 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 14:58:32,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:58:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:58:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:58:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 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 14:58:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:58:32,624 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 33 [2025-03-16 14:58:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:32,624 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:58:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:58:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:58:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 14:58:32,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:32,625 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] [2025-03-16 14:58:32,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:58:32,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:32,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1913346308, now seen corresponding path program 1 times [2025-03-16 14:58:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201770384] [2025-03-16 14:58:32,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:32,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:58:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:58:32,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:32,803 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 14:58:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201770384] [2025-03-16 14:58:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201770384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:58:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434826944] [2025-03-16 14:58:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:32,806 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:58:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:35,583 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:58:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:35,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-16 14:58:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:35,594 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:58:35,594 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:58:35,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:35,597 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 767 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:35,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 474 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:58:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:58:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:58:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6070478723404256) internal successors, (2417), 1504 states have internal predecessors, (2417), 0 states have call successors, (0), 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 14:58:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2417 transitions. [2025-03-16 14:58:35,661 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2417 transitions. Word has length 33 [2025-03-16 14:58:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2417 transitions. [2025-03-16 14:58:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 14:58:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2417 transitions. [2025-03-16 14:58:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 14:58:35,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:35,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:35,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:58:35,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:35,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash 60950660, now seen corresponding path program 1 times [2025-03-16 14:58:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377511208] [2025-03-16 14:58:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 14:58:35,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 14:58:35,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:35,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:58:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:35,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377511208] [2025-03-16 14:58:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377511208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:58:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156264811] [2025-03-16 14:58:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:35,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:35,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:35,913 INFO L87 Difference]: Start difference. First operand 1505 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 14:58:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:38,403 INFO L93 Difference]: Finished difference Result 4513 states and 7249 transitions. [2025-03-16 14:58:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 14:58:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:38,412 INFO L225 Difference]: With dead ends: 4513 [2025-03-16 14:58:38,412 INFO L226 Difference]: Without dead ends: 3009 [2025-03-16 14:58:38,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:38,415 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:38,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 582 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:58:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-16 14:58:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007. [2025-03-16 14:58:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4597471723220226) internal successors, (4388), 3006 states have internal predecessors, (4388), 0 states have call successors, (0), 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 14:58:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4388 transitions. [2025-03-16 14:58:38,463 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4388 transitions. Word has length 108 [2025-03-16 14:58:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:38,464 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4388 transitions. [2025-03-16 14:58:38,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 14:58:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4388 transitions. [2025-03-16 14:58:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 14:58:38,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:38,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:58:38,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -446280138, now seen corresponding path program 1 times [2025-03-16 14:58:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752768104] [2025-03-16 14:58:38,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:38,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 14:58:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 14:58:38,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:58:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752768104] [2025-03-16 14:58:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752768104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:58:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800527535] [2025-03-16 14:58:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:38,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:38,660 INFO L87 Difference]: Start difference. First operand 3007 states and 4388 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:40,620 INFO L93 Difference]: Finished difference Result 9017 states and 13161 transitions. [2025-03-16 14:58:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-03-16 14:58:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:40,639 INFO L225 Difference]: With dead ends: 9017 [2025-03-16 14:58:40,639 INFO L226 Difference]: Without dead ends: 6011 [2025-03-16 14:58:40,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:40,644 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:40,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 446 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:58:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2025-03-16 14:58:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 6011. [2025-03-16 14:58:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2951747088186356) internal successors, (7784), 6010 states have internal predecessors, (7784), 0 states have call successors, (0), 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 14:58:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7784 transitions. [2025-03-16 14:58:40,766 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7784 transitions. Word has length 137 [2025-03-16 14:58:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7784 transitions. [2025-03-16 14:58:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7784 transitions. [2025-03-16 14:58:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 14:58:40,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:40,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:40,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:58:40,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:40,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1924339745, now seen corresponding path program 1 times [2025-03-16 14:58:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337198690] [2025-03-16 14:58:40,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:40,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 14:58:40,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 14:58:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:40,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 14:58:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337198690] [2025-03-16 14:58:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337198690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:58:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532786455] [2025-03-16 14:58:41,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:41,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:58:41,097 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 14:58:41,099 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 14:58:41,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 14:58:41,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 14:58:41,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:41,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:58:41,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:58:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:58:41,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:58:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532786455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:58:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:58:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305972501] [2025-03-16 14:58:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:41,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:41,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:41,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:58:41,358 INFO L87 Difference]: Start difference. First operand 6011 states and 7784 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 14:58:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:43,510 INFO L93 Difference]: Finished difference Result 18029 states and 23349 transitions. [2025-03-16 14:58:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 174 [2025-03-16 14:58:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:43,538 INFO L225 Difference]: With dead ends: 18029 [2025-03-16 14:58:43,538 INFO L226 Difference]: Without dead ends: 12019 [2025-03-16 14:58:43,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:58:43,547 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 623 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:43,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 661 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:58:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2025-03-16 14:58:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 11268. [2025-03-16 14:58:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.227744741279844) internal successors, (13833), 11267 states have internal predecessors, (13833), 0 states have call successors, (0), 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 14:58:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13833 transitions. [2025-03-16 14:58:43,732 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13833 transitions. Word has length 174 [2025-03-16 14:58:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:43,734 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 13833 transitions. [2025-03-16 14:58:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 14:58:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13833 transitions. [2025-03-16 14:58:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 14:58:43,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:43,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:43,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:58:43,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:43,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1052810926, now seen corresponding path program 1 times [2025-03-16 14:58:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434667240] [2025-03-16 14:58:43,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:43,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:58:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:58:43,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:58:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434667240] [2025-03-16 14:58:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434667240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:58:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233986010] [2025-03-16 14:58:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:58:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:44,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:58:44,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:58:44,345 INFO L87 Difference]: Start difference. First operand 11268 states and 13833 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:47,884 INFO L93 Difference]: Finished difference Result 29294 states and 35078 transitions. [2025-03-16 14:58:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:58:47,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-16 14:58:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:47,923 INFO L225 Difference]: With dead ends: 29294 [2025-03-16 14:58:47,923 INFO L226 Difference]: Without dead ends: 18027 [2025-03-16 14:58:47,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:58:47,932 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:47,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 719 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 14:58:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2025-03-16 14:58:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 16525. [2025-03-16 14:58:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.1745340111353184) internal successors, (19408), 16524 states have internal predecessors, (19408), 0 states have call successors, (0), 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 14:58:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19408 transitions. [2025-03-16 14:58:48,100 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19408 transitions. Word has length 177 [2025-03-16 14:58:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19408 transitions. [2025-03-16 14:58:48,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19408 transitions. [2025-03-16 14:58:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 14:58:48,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:48,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:58:48,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:48,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -887984565, now seen corresponding path program 1 times [2025-03-16 14:58:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:48,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181750960] [2025-03-16 14:58:48,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:48,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 14:58:48,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 14:58:48,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:48,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:58:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181750960] [2025-03-16 14:58:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181750960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:48,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109894028] [2025-03-16 14:58:48,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:48,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:48,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:48,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:48,231 INFO L87 Difference]: Start difference. First operand 16525 states and 19408 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:58:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:50,575 INFO L93 Difference]: Finished difference Result 39057 states and 46759 transitions. [2025-03-16 14:58:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 245 [2025-03-16 14:58:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:50,611 INFO L225 Difference]: With dead ends: 39057 [2025-03-16 14:58:50,611 INFO L226 Difference]: Without dead ends: 22533 [2025-03-16 14:58:50,624 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 14:58:50,625 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 720 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:50,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 689 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:58:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2025-03-16 14:58:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 16525. [2025-03-16 14:58:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.1745340111353184) internal successors, (19408), 16524 states have internal predecessors, (19408), 0 states have call successors, (0), 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 14:58:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19408 transitions. [2025-03-16 14:58:50,794 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19408 transitions. Word has length 245 [2025-03-16 14:58:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:50,795 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19408 transitions. [2025-03-16 14:58:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:58:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19408 transitions. [2025-03-16 14:58:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 14:58:50,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:50,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:50,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:58:50,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash 403342052, now seen corresponding path program 1 times [2025-03-16 14:58:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334233771] [2025-03-16 14:58:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 14:58:50,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 14:58:50,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:58:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334233771] [2025-03-16 14:58:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334233771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:51,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964535870] [2025-03-16 14:58:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:58:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:51,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:58:51,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:58:51,041 INFO L87 Difference]: Start difference. First operand 16525 states and 19408 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 14:58:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:53,269 INFO L93 Difference]: Finished difference Result 37592 states and 43652 transitions. [2025-03-16 14:58:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:58:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-03-16 14:58:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:53,339 INFO L225 Difference]: With dead ends: 37592 [2025-03-16 14:58:53,339 INFO L226 Difference]: Without dead ends: 21031 [2025-03-16 14:58:53,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:58:53,354 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:53,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 706 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:58:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2025-03-16 14:58:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 21031. [2025-03-16 14:58:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21031 states, 21030 states have (on average 1.1405611031859249) internal successors, (23986), 21030 states have internal predecessors, (23986), 0 states have call successors, (0), 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 14:58:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21031 states to 21031 states and 23986 transitions. [2025-03-16 14:58:53,529 INFO L78 Accepts]: Start accepts. Automaton has 21031 states and 23986 transitions. Word has length 248 [2025-03-16 14:58:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:53,529 INFO L471 AbstractCegarLoop]: Abstraction has 21031 states and 23986 transitions. [2025-03-16 14:58:53,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 14:58:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21031 states and 23986 transitions. [2025-03-16 14:58:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 14:58:53,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:53,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:53,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:58:53,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:53,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1242837864, now seen corresponding path program 1 times [2025-03-16 14:58:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532652873] [2025-03-16 14:58:53,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:53,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 14:58:53,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 14:58:53,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:53,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:58:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532652873] [2025-03-16 14:58:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532652873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034617447] [2025-03-16 14:58:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:53,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:53,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:53,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:53,644 INFO L87 Difference]: Start difference. First operand 21031 states and 23986 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 14:58:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:56,172 INFO L93 Difference]: Finished difference Result 60085 states and 68806 transitions. [2025-03-16 14:58:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:56,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-16 14:58:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:56,218 INFO L225 Difference]: With dead ends: 60085 [2025-03-16 14:58:56,218 INFO L226 Difference]: Without dead ends: 39055 [2025-03-16 14:58:56,236 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 14:58:56,238 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 668 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:56,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1388 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:58:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39055 states. [2025-03-16 14:58:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39055 to 36051. [2025-03-16 14:58:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36051 states, 36050 states have (on average 1.1352843273231623) internal successors, (40927), 36050 states have internal predecessors, (40927), 0 states have call successors, (0), 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 14:58:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36051 states to 36051 states and 40927 transitions. [2025-03-16 14:58:56,572 INFO L78 Accepts]: Start accepts. Automaton has 36051 states and 40927 transitions. Word has length 259 [2025-03-16 14:58:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:56,573 INFO L471 AbstractCegarLoop]: Abstraction has 36051 states and 40927 transitions. [2025-03-16 14:58:56,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 14:58:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 36051 states and 40927 transitions. [2025-03-16 14:58:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 14:58:56,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:56,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:56,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:58:56,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:56,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1660725966, now seen corresponding path program 1 times [2025-03-16 14:58:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727835915] [2025-03-16 14:58:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:56,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 14:58:56,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 14:58:56,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:56,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:58:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727835915] [2025-03-16 14:58:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727835915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:56,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:56,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420045250] [2025-03-16 14:58:56,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:56,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:56,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:56,691 INFO L87 Difference]: Start difference. First operand 36051 states and 40927 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:59,072 INFO L93 Difference]: Finished difference Result 84117 states and 96935 transitions. [2025-03-16 14:58:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-03-16 14:58:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:59,121 INFO L225 Difference]: With dead ends: 84117 [2025-03-16 14:58:59,121 INFO L226 Difference]: Without dead ends: 48067 [2025-03-16 14:58:59,142 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 14:58:59,142 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 754 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:59,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 459 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:58:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2025-03-16 14:58:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 46565. [2025-03-16 14:58:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.1438665063138906) internal successors, (53263), 46564 states have internal predecessors, (53263), 0 states have call successors, (0), 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 14:58:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 53263 transitions. [2025-03-16 14:58:59,545 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 53263 transitions. Word has length 263 [2025-03-16 14:58:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:59,545 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 53263 transitions. [2025-03-16 14:58:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 53263 transitions. [2025-03-16 14:58:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 14:58:59,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:59,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:59,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:58:59,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:59,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash -496838430, now seen corresponding path program 1 times [2025-03-16 14:58:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:59,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640878950] [2025-03-16 14:58:59,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:59,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 14:58:59,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 14:58:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 14:58:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640878950] [2025-03-16 14:58:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640878950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:59,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:59,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707360482] [2025-03-16 14:58:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:59,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:59,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:59,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:59,688 INFO L87 Difference]: Start difference. First operand 46565 states and 53263 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:02,062 INFO L93 Difference]: Finished difference Result 112655 states and 130538 transitions. [2025-03-16 14:59:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2025-03-16 14:59:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:02,137 INFO L225 Difference]: With dead ends: 112655 [2025-03-16 14:59:02,137 INFO L226 Difference]: Without dead ends: 66091 [2025-03-16 14:59:02,169 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 14:59:02,169 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:02,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1391 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:59:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66091 states. [2025-03-16 14:59:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66091 to 66091. [2025-03-16 14:59:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.117279467392949) internal successors, (73841), 66090 states have internal predecessors, (73841), 0 states have call successors, (0), 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 14:59:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 73841 transitions. [2025-03-16 14:59:02,836 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 73841 transitions. Word has length 295 [2025-03-16 14:59:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:02,836 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 73841 transitions. [2025-03-16 14:59:02,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 73841 transitions. [2025-03-16 14:59:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 14:59:02,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:02,839 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:02,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:59:02,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:02,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1017396791, now seen corresponding path program 1 times [2025-03-16 14:59:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:02,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493655095] [2025-03-16 14:59:02,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:02,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 14:59:02,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 14:59:02,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:02,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:59:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493655095] [2025-03-16 14:59:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493655095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:02,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895041694] [2025-03-16 14:59:02,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:02,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:02,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:02,944 INFO L87 Difference]: Start difference. First operand 66091 states and 73841 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:59:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:04,958 INFO L93 Difference]: Finished difference Result 132181 states and 147681 transitions. [2025-03-16 14:59:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 310 [2025-03-16 14:59:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:05,032 INFO L225 Difference]: With dead ends: 132181 [2025-03-16 14:59:05,032 INFO L226 Difference]: Without dead ends: 66091 [2025-03-16 14:59:05,274 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 14:59:05,275 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 793 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:05,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 997 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:59:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66091 states. [2025-03-16 14:59:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66091 to 66091. [2025-03-16 14:59:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.0977303676804357) internal successors, (72549), 66090 states have internal predecessors, (72549), 0 states have call successors, (0), 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 14:59:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 72549 transitions. [2025-03-16 14:59:06,033 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 72549 transitions. Word has length 310 [2025-03-16 14:59:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 72549 transitions. [2025-03-16 14:59:06,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:59:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 72549 transitions. [2025-03-16 14:59:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 14:59:06,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:06,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:59:06,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:06,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1329598867, now seen corresponding path program 1 times [2025-03-16 14:59:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582315640] [2025-03-16 14:59:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 14:59:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 14:59:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:59:06,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582315640] [2025-03-16 14:59:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582315640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989101501] [2025-03-16 14:59:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:06,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:06,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:06,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:06,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:06,402 INFO L87 Difference]: Start difference. First operand 66091 states and 72549 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 14:59:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:08,518 INFO L93 Difference]: Finished difference Result 149454 states and 163732 transitions. [2025-03-16 14:59:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 364 [2025-03-16 14:59:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:08,604 INFO L225 Difference]: With dead ends: 149454 [2025-03-16 14:59:08,604 INFO L226 Difference]: Without dead ends: 81862 [2025-03-16 14:59:08,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 14:59:08,639 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 837 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:08,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 904 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:59:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81862 states. [2025-03-16 14:59:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81862 to 76605. [2025-03-16 14:59:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76605 states, 76604 states have (on average 1.091522635893687) internal successors, (83615), 76604 states have internal predecessors, (83615), 0 states have call successors, (0), 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 14:59:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76605 states to 76605 states and 83615 transitions. [2025-03-16 14:59:09,489 INFO L78 Accepts]: Start accepts. Automaton has 76605 states and 83615 transitions. Word has length 364 [2025-03-16 14:59:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:09,489 INFO L471 AbstractCegarLoop]: Abstraction has 76605 states and 83615 transitions. [2025-03-16 14:59:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 14:59:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76605 states and 83615 transitions. [2025-03-16 14:59:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 14:59:09,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:09,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:09,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:59:09,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -432740335, now seen corresponding path program 1 times [2025-03-16 14:59:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332810404] [2025-03-16 14:59:09,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:09,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 14:59:09,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 14:59:09,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:09,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 168 proven. 303 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-16 14:59:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332810404] [2025-03-16 14:59:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332810404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626548363] [2025-03-16 14:59:09,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:09,948 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 14:59:09,949 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 14:59:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 14:59:10,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 14:59:10,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:10,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:10,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-16 14:59:10,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626548363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:59:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066130104] [2025-03-16 14:59:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:10,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:10,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:10,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:10,157 INFO L87 Difference]: Start difference. First operand 76605 states and 83615 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 14:59:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:12,512 INFO L93 Difference]: Finished difference Result 170482 states and 187141 transitions. [2025-03-16 14:59:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 441 [2025-03-16 14:59:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:12,599 INFO L225 Difference]: With dead ends: 170482 [2025-03-16 14:59:12,599 INFO L226 Difference]: Without dead ends: 93878 [2025-03-16 14:59:12,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:12,632 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 840 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:12,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1115 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:59:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93878 states. [2025-03-16 14:59:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93878 to 93127. [2025-03-16 14:59:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93127 states, 93126 states have (on average 1.082307840989627) internal successors, (100791), 93126 states have internal predecessors, (100791), 0 states have call successors, (0), 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 14:59:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93127 states to 93127 states and 100791 transitions. [2025-03-16 14:59:13,422 INFO L78 Accepts]: Start accepts. Automaton has 93127 states and 100791 transitions. Word has length 441 [2025-03-16 14:59:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 93127 states and 100791 transitions. [2025-03-16 14:59:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 14:59:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93127 states and 100791 transitions. [2025-03-16 14:59:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-03-16 14:59:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:13,467 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:13,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:59:13,668 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,SelfDestructingSolverStorable13 [2025-03-16 14:59:13,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 972614616, now seen corresponding path program 1 times [2025-03-16 14:59:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046522658] [2025-03-16 14:59:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-03-16 14:59:13,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-03-16 14:59:13,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:13,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 14:59:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046522658] [2025-03-16 14:59:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046522658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:14,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99453519] [2025-03-16 14:59:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:14,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:14,168 INFO L87 Difference]: Start difference. First operand 93127 states and 100791 transitions. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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 14:59:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:16,657 INFO L93 Difference]: Finished difference Result 220048 states and 239241 transitions. [2025-03-16 14:59:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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 950 [2025-03-16 14:59:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:16,822 INFO L225 Difference]: With dead ends: 220048 [2025-03-16 14:59:16,822 INFO L226 Difference]: Without dead ends: 126922 [2025-03-16 14:59:16,879 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 14:59:16,880 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 617 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:16,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 438 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:59:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126922 states. [2025-03-16 14:59:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126922 to 122416. [2025-03-16 14:59:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122416 states, 122415 states have (on average 1.0834946697708614) internal successors, (132636), 122415 states have internal predecessors, (132636), 0 states have call successors, (0), 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 14:59:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122416 states to 122416 states and 132636 transitions. [2025-03-16 14:59:18,227 INFO L78 Accepts]: Start accepts. Automaton has 122416 states and 132636 transitions. Word has length 950 [2025-03-16 14:59:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:18,228 INFO L471 AbstractCegarLoop]: Abstraction has 122416 states and 132636 transitions. [2025-03-16 14:59:18,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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 14:59:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 122416 states and 132636 transitions. [2025-03-16 14:59:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2025-03-16 14:59:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:18,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:59:18,278 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:18,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash 327297555, now seen corresponding path program 1 times [2025-03-16 14:59:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177048179] [2025-03-16 14:59:18,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:18,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1013 statements into 1 equivalence classes. [2025-03-16 14:59:18,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1013 of 1013 statements. [2025-03-16 14:59:18,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-16 14:59:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177048179] [2025-03-16 14:59:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177048179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793469222] [2025-03-16 14:59:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:19,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:19,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:19,020 INFO L87 Difference]: Start difference. First operand 122416 states and 132636 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 14:59:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:21,437 INFO L93 Difference]: Finished difference Result 245582 states and 266028 transitions. [2025-03-16 14:59:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 1013 [2025-03-16 14:59:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:21,575 INFO L225 Difference]: With dead ends: 245582 [2025-03-16 14:59:21,575 INFO L226 Difference]: Without dead ends: 123167 [2025-03-16 14:59:21,609 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 14:59:21,609 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 750 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:21,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1185 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:59:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123167 states. [2025-03-16 14:59:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123167 to 119412. [2025-03-16 14:59:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119412 states, 119411 states have (on average 1.0750433377159558) internal successors, (128372), 119411 states have internal predecessors, (128372), 0 states have call successors, (0), 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 14:59:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119412 states to 119412 states and 128372 transitions. [2025-03-16 14:59:22,937 INFO L78 Accepts]: Start accepts. Automaton has 119412 states and 128372 transitions. Word has length 1013 [2025-03-16 14:59:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 119412 states and 128372 transitions. [2025-03-16 14:59:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 14:59:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 119412 states and 128372 transitions. [2025-03-16 14:59:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2025-03-16 14:59:23,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:23,012 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:23,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:59:23,013 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:23,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1393808149, now seen corresponding path program 1 times [2025-03-16 14:59:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811296847] [2025-03-16 14:59:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:23,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1028 statements into 1 equivalence classes. [2025-03-16 14:59:23,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1028 of 1028 statements. [2025-03-16 14:59:23,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:23,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 575 proven. 303 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-16 14:59:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811296847] [2025-03-16 14:59:23,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811296847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393079319] [2025-03-16 14:59:23,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:23,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:23,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:59:23,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1028 statements into 1 equivalence classes. [2025-03-16 14:59:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1028 of 1028 statements. [2025-03-16 14:59:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:24,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:24,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 14:59:24,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393079319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:59:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965069358] [2025-03-16 14:59:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:24,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:24,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:24,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:24,231 INFO L87 Difference]: Start difference. First operand 119412 states and 128372 transitions. Second operand has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 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 14:59:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:26,505 INFO L93 Difference]: Finished difference Result 259851 states and 281268 transitions. [2025-03-16 14:59:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 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 1028 [2025-03-16 14:59:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:26,679 INFO L225 Difference]: With dead ends: 259851 [2025-03-16 14:59:26,679 INFO L226 Difference]: Without dead ends: 140440 [2025-03-16 14:59:26,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 1027 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:26,752 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 782 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:26,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 243 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:59:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140440 states. [2025-03-16 14:59:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140440 to 138187. [2025-03-16 14:59:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138187 states, 138186 states have (on average 1.0725978029612262) internal successors, (148218), 138186 states have internal predecessors, (148218), 0 states have call successors, (0), 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 14:59:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138187 states to 138187 states and 148218 transitions. [2025-03-16 14:59:28,049 INFO L78 Accepts]: Start accepts. Automaton has 138187 states and 148218 transitions. Word has length 1028 [2025-03-16 14:59:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:28,050 INFO L471 AbstractCegarLoop]: Abstraction has 138187 states and 148218 transitions. [2025-03-16 14:59:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 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 14:59:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 138187 states and 148218 transitions. [2025-03-16 14:59:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2025-03-16 14:59:28,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:28,096 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:28,338 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forcibly destroying the process [2025-03-16 14:59:28,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:59:28,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:28,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:28,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1157627850, now seen corresponding path program 1 times [2025-03-16 14:59:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:28,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458568948] [2025-03-16 14:59:28,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:28,342 WARN L724 oredProcess$PipePump]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] The stream was forcibly closed: stdIn [2025-03-16 14:59:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1058 statements into 1 equivalence classes. [2025-03-16 14:59:28,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1058 of 1058 statements. [2025-03-16 14:59:28,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 605 proven. 333 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-16 14:59:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458568948] [2025-03-16 14:59:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458568948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319691972] [2025-03-16 14:59:29,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:29,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:29,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:29,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:29,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:59:29,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1058 statements into 1 equivalence classes. [2025-03-16 14:59:29,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1058 of 1058 statements. [2025-03-16 14:59:29,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:29,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:29,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:29,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 14:59:29,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319691972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:59:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529803884] [2025-03-16 14:59:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:29,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:29,620 INFO L87 Difference]: Start difference. First operand 138187 states and 148218 transitions. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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 14:59:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:32,351 INFO L93 Difference]: Finished difference Result 307164 states and 331333 transitions. [2025-03-16 14:59:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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 1058 [2025-03-16 14:59:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:32,541 INFO L225 Difference]: With dead ends: 307164 [2025-03-16 14:59:32,541 INFO L226 Difference]: Without dead ends: 168978 [2025-03-16 14:59:32,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1057 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:59:32,628 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:32,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1305 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:59:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168978 states. [2025-03-16 14:59:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168978 to 165223. [2025-03-16 14:59:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165223 states, 165222 states have (on average 1.0690828097953058) internal successors, (176636), 165222 states have internal predecessors, (176636), 0 states have call successors, (0), 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 14:59:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165223 states to 165223 states and 176636 transitions. [2025-03-16 14:59:34,233 INFO L78 Accepts]: Start accepts. Automaton has 165223 states and 176636 transitions. Word has length 1058 [2025-03-16 14:59:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:34,234 INFO L471 AbstractCegarLoop]: Abstraction has 165223 states and 176636 transitions. [2025-03-16 14:59:34,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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 14:59:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 165223 states and 176636 transitions. [2025-03-16 14:59:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2025-03-16 14:59:34,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:34,288 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:34,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:59:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:59:34,488 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash -817433392, now seen corresponding path program 1 times [2025-03-16 14:59:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810593740] [2025-03-16 14:59:34,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:34,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1117 statements into 1 equivalence classes. [2025-03-16 14:59:34,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1117 of 1117 statements. [2025-03-16 14:59:34,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:34,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-03-16 14:59:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810593740] [2025-03-16 14:59:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810593740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495360941] [2025-03-16 14:59:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:34,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:34,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:34,963 INFO L87 Difference]: Start difference. First operand 165223 states and 176636 transitions. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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 14:59:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:38,153 INFO L93 Difference]: Finished difference Result 380762 states and 409468 transitions. [2025-03-16 14:59:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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 1117 [2025-03-16 14:59:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:38,437 INFO L225 Difference]: With dead ends: 380762 [2025-03-16 14:59:38,438 INFO L226 Difference]: Without dead ends: 211785 [2025-03-16 14:59:38,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:38,513 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 196 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:38,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1318 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211785 states. [2025-03-16 14:59:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211785 to 202022. [2025-03-16 14:59:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202022 states, 202021 states have (on average 1.061622306591889) internal successors, (214470), 202021 states have internal predecessors, (214470), 0 states have call successors, (0), 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 14:59:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202022 states to 202022 states and 214470 transitions. [2025-03-16 14:59:40,833 INFO L78 Accepts]: Start accepts. Automaton has 202022 states and 214470 transitions. Word has length 1117 [2025-03-16 14:59:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:40,833 INFO L471 AbstractCegarLoop]: Abstraction has 202022 states and 214470 transitions. [2025-03-16 14:59:40,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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 14:59:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 202022 states and 214470 transitions. [2025-03-16 14:59:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-03-16 14:59:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:40,896 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:40,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:59:40,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1443889513, now seen corresponding path program 1 times [2025-03-16 14:59:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040712911] [2025-03-16 14:59:40,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-03-16 14:59:41,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-03-16 14:59:41,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-16 14:59:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040712911] [2025-03-16 14:59:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040712911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:41,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266490869] [2025-03-16 14:59:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:41,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:41,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:41,557 INFO L87 Difference]: Start difference. First operand 202022 states and 214470 transitions. Second operand has 3 states, 3 states have (on average 339.6666666666667) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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 14:59:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:44,138 INFO L93 Difference]: Finished difference Result 407798 states and 432785 transitions. [2025-03-16 14:59:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 339.6666666666667) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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 1185 [2025-03-16 14:59:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:44,402 INFO L225 Difference]: With dead ends: 407798 [2025-03-16 14:59:44,402 INFO L226 Difference]: Without dead ends: 206528 [2025-03-16 14:59:44,517 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 14:59:44,517 INFO L435 NwaCegarLoop]: 1184 mSDtfsCounter, 557 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:44,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1191 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:59:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206528 states. [2025-03-16 14:59:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206528 to 196765. [2025-03-16 14:59:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196765 states, 196764 states have (on average 1.0435140574495334) internal successors, (205326), 196764 states have internal predecessors, (205326), 0 states have call successors, (0), 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 14:59:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196765 states to 196765 states and 205326 transitions. [2025-03-16 14:59:46,584 INFO L78 Accepts]: Start accepts. Automaton has 196765 states and 205326 transitions. Word has length 1185 [2025-03-16 14:59:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:46,585 INFO L471 AbstractCegarLoop]: Abstraction has 196765 states and 205326 transitions. [2025-03-16 14:59:46,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.6666666666667) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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 14:59:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 196765 states and 205326 transitions. [2025-03-16 14:59:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1293 [2025-03-16 14:59:46,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:46,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:59:46,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -276156156, now seen corresponding path program 1 times [2025-03-16 14:59:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079892202] [2025-03-16 14:59:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:47,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1292 statements into 1 equivalence classes. [2025-03-16 14:59:47,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1292 of 1292 statements. [2025-03-16 14:59:47,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:47,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-03-16 14:59:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079892202] [2025-03-16 14:59:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079892202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:48,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429641453] [2025-03-16 14:59:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:48,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:48,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:48,282 INFO L87 Difference]: Start difference. First operand 196765 states and 205326 transitions. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 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)