./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label06.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_label06.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 b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:53:18,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:53:18,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:53:18,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:53:18,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:53:18,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:53:18,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:53:18,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:53:18,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:53:18,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:53:18,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:53:18,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:53:18,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:53:18,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:53:18,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:53:18,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:53:18,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:53:18,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:53:18,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:53:18,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:53:18,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:53:18,216 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 -> b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 [2025-03-16 14:53:18,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:53:18,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:53:18,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:53:18,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:53:18,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:53:18,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-03-16 14:53:19,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec51f932/03651d8b2197455e9fa40782b2e74588/FLAG4185c947d [2025-03-16 14:53:19,969 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:53:19,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-03-16 14:53:19,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec51f932/03651d8b2197455e9fa40782b2e74588/FLAG4185c947d [2025-03-16 14:53:20,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec51f932/03651d8b2197455e9fa40782b2e74588 [2025-03-16 14:53:20,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:53:20,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:53:20,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:53:20,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:53:20,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:53:20,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:20,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5814129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20, skipping insertion in model container [2025-03-16 14:53:20,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:20,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:53:20,231 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_label06.c[3178,3191] [2025-03-16 14:53:20,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:53:20,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:53:20,693 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_label06.c[3178,3191] [2025-03-16 14:53:20,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:53:20,943 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:53:20,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20 WrapperNode [2025-03-16 14:53:20,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:53:20,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:53:20,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:53:20,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:53:20,948 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:53:20" (1/1) ... [2025-03-16 14:53:20,980 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:53:20" (1/1) ... [2025-03-16 14:53:21,197 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:53:21,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:53:21,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:53:21,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:53:21,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:53:21,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,411 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:53:21,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:53:21,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:53:21,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:53:21,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:53:21,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (1/1) ... [2025-03-16 14:53:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:53:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:21,657 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:53:21,659 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:53:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:53:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:53:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:53:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:53:21,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:53:21,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:53:24,845 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:53:24,845 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:53:24,846 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:53:24,985 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:53:24,986 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:53:25,015 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:53:25,015 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:53:25,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:53:25 BoogieIcfgContainer [2025-03-16 14:53:25,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:53:25,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:53:25,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:53:25,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:53:25,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:53:20" (1/3) ... [2025-03-16 14:53:25,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b895f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:53:25, skipping insertion in model container [2025-03-16 14:53:25,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:20" (2/3) ... [2025-03-16 14:53:25,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b895f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:53:25, skipping insertion in model container [2025-03-16 14:53:25,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:53:25" (3/3) ... [2025-03-16 14:53:25,023 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label06.c [2025-03-16 14:53:25,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:53:25,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label06.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:53:25,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:53:25,102 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;@136f2eb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:53:25,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:53:25,110 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:53:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 14:53:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:25,115 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] [2025-03-16 14:53:25,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 893901832, now seen corresponding path program 1 times [2025-03-16 14:53:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975969663] [2025-03-16 14:53:25,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:25,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 14:53:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 14:53:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:25,225 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:53:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975969663] [2025-03-16 14:53:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975969663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:25,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780133443] [2025-03-16 14:53:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:25,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:53:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:25,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:53:25,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:53:25,248 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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:53:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:25,323 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:53:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:53:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 14:53:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:25,335 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:53:25,335 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:53:25,340 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:53:25,342 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:53:25,343 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:53:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:53:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:53:25,400 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:53:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:53:25,409 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 22 [2025-03-16 14:53:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:25,409 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:53:25,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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:53:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:53:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 14:53:25,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:25,410 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] [2025-03-16 14:53:25,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:53:25,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash -408215863, now seen corresponding path program 1 times [2025-03-16 14:53:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:25,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733903530] [2025-03-16 14:53:25,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 14:53:25,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 14:53:25,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:25,531 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:53:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733903530] [2025-03-16 14:53:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733903530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700343967] [2025-03-16 14:53:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:25,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:25,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:25,536 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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:53:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:28,127 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:53:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 14:53:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:28,133 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:53:28,133 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:53:28,134 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:53:28,135 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:28,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 427 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:53:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:53:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:53:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states 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:53:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2025-03-16 14:53:28,174 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 22 [2025-03-16 14:53:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2025-03-16 14:53:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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:53:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2025-03-16 14:53:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 14:53:28,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:28,176 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:53:28,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:53:28,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:28,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -120606727, now seen corresponding path program 1 times [2025-03-16 14:53:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137574482] [2025-03-16 14:53:28,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:28,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 14:53:28,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 14:53:28,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:28,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137574482] [2025-03-16 14:53:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137574482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240545448] [2025-03-16 14:53:28,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:28,567 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:53:28,569 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:53:28,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 14:53:28,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 14:53:28,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:28,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:28,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:53:28,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:28,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:53:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240545448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:53:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:53:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996619110] [2025-03-16 14:53:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:53:28,679 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:53:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:31,122 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2025-03-16 14:53:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:31,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-16 14:53:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:31,132 INFO L225 Difference]: With dead ends: 4511 [2025-03-16 14:53:31,133 INFO L226 Difference]: Without dead ends: 3007 [2025-03-16 14:53:31,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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:53:31,135 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 745 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:31,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1155 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:53:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-03-16 14:53:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2025-03-16 14:53:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.5372588157019296) internal successors, (4621), 3006 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states 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:53:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4621 transitions. [2025-03-16 14:53:31,187 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4621 transitions. Word has length 93 [2025-03-16 14:53:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:31,188 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4621 transitions. [2025-03-16 14:53:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:53:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4621 transitions. [2025-03-16 14:53:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 14:53:31,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:31,190 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:53:31,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:53:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:31,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1593521598, now seen corresponding path program 1 times [2025-03-16 14:53:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92584398] [2025-03-16 14:53:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 14:53:31,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 14:53:31,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:31,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92584398] [2025-03-16 14:53:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92584398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312341407] [2025-03-16 14:53:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:31,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:31,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:31,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:31,520 INFO L87 Difference]: Start difference. First operand 3007 states and 4621 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:53:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:33,581 INFO L93 Difference]: Finished difference Result 9017 states and 13860 transitions. [2025-03-16 14:53:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 14:53:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:33,596 INFO L225 Difference]: With dead ends: 9017 [2025-03-16 14:53:33,597 INFO L226 Difference]: Without dead ends: 6011 [2025-03-16 14:53:33,599 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:53:33,599 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 775 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 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, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:33,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 446 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:53:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2025-03-16 14:53:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 6011. [2025-03-16 14:53:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.3727121464226288) internal successors, (8250), 6010 states have internal predecessors, (8250), 0 states have call successors, (0), 0 states 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:53:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 8250 transitions. [2025-03-16 14:53:33,671 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 8250 transitions. Word has length 96 [2025-03-16 14:53:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:33,671 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 8250 transitions. [2025-03-16 14:53:33,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:53:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 8250 transitions. [2025-03-16 14:53:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 14:53:33,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:33,673 INFO L218 NwaCegarLoop]: trace histogram [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:53:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:53:33,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -825032718, now seen corresponding path program 1 times [2025-03-16 14:53:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869536040] [2025-03-16 14:53:33,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:33,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 14:53:33,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 14:53:33,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:33,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869536040] [2025-03-16 14:53:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869536040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382576060] [2025-03-16 14:53:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:33,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:33,897 INFO L87 Difference]: Start difference. First operand 6011 states and 8250 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:53:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:36,077 INFO L93 Difference]: Finished difference Result 12772 states and 17370 transitions. [2025-03-16 14:53:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 14:53:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:36,093 INFO L225 Difference]: With dead ends: 12772 [2025-03-16 14:53:36,093 INFO L226 Difference]: Without dead ends: 6762 [2025-03-16 14:53:36,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:53:36,100 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 885 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:36,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1167 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:53:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2025-03-16 14:53:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2025-03-16 14:53:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.3321993787901198) internal successors, (9007), 6761 states have internal predecessors, (9007), 0 states have call successors, (0), 0 states 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:53:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9007 transitions. [2025-03-16 14:53:36,211 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9007 transitions. Word has length 103 [2025-03-16 14:53:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:36,211 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9007 transitions. [2025-03-16 14:53:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:53:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9007 transitions. [2025-03-16 14:53:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 14:53:36,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:36,213 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:53:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:53:36,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 447351139, now seen corresponding path program 1 times [2025-03-16 14:53:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:36,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756527976] [2025-03-16 14:53:36,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:36,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 14:53:36,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 14:53:36,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:36,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:36,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756527976] [2025-03-16 14:53:36,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756527976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:36,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:36,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076142227] [2025-03-16 14:53:36,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:36,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:36,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:36,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:36,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:36,457 INFO L87 Difference]: Start difference. First operand 6762 states and 9007 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:53:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:39,163 INFO L93 Difference]: Finished difference Result 17315 states and 23787 transitions. [2025-03-16 14:53:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-16 14:53:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:39,201 INFO L225 Difference]: With dead ends: 17315 [2025-03-16 14:53:39,201 INFO L226 Difference]: Without dead ends: 11268 [2025-03-16 14:53:39,205 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:53:39,208 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:39,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 706 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:53:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11268 states. [2025-03-16 14:53:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11268 to 10517. [2025-03-16 14:53:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10517 states, 10516 states have (on average 1.2198554583491823) internal successors, (12828), 10516 states have internal predecessors, (12828), 0 states have call successors, (0), 0 states 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:53:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 12828 transitions. [2025-03-16 14:53:39,412 INFO L78 Accepts]: Start accepts. Automaton has 10517 states and 12828 transitions. Word has length 161 [2025-03-16 14:53:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 10517 states and 12828 transitions. [2025-03-16 14:53:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:53:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10517 states and 12828 transitions. [2025-03-16 14:53:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 14:53:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:39,415 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:53:39,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 977440979, now seen corresponding path program 1 times [2025-03-16 14:53:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785664286] [2025-03-16 14:53:39,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:39,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 14:53:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:53:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-16 14:53:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785664286] [2025-03-16 14:53:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785664286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:39,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:39,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773266921] [2025-03-16 14:53:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:39,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:39,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:39,567 INFO L87 Difference]: Start difference. First operand 10517 states and 12828 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:41,661 INFO L93 Difference]: Finished difference Result 26292 states and 32986 transitions. [2025-03-16 14:53:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-03-16 14:53:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:41,696 INFO L225 Difference]: With dead ends: 26292 [2025-03-16 14:53:41,696 INFO L226 Difference]: Without dead ends: 16527 [2025-03-16 14:53:41,705 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:53:41,706 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:41,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:53:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2025-03-16 14:53:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 15774. [2025-03-16 14:53:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.207569897926837) internal successors, (19047), 15773 states have internal predecessors, (19047), 0 states have call successors, (0), 0 states 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:53:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 19047 transitions. [2025-03-16 14:53:41,896 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 19047 transitions. Word has length 244 [2025-03-16 14:53:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:41,896 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 19047 transitions. [2025-03-16 14:53:41,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 19047 transitions. [2025-03-16 14:53:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 14:53:41,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:41,898 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:53:41,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:41,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:41,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1997384161, now seen corresponding path program 1 times [2025-03-16 14:53:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:41,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300169461] [2025-03-16 14:53:41,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:41,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 14:53:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 14:53:41,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300169461] [2025-03-16 14:53:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300169461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180121844] [2025-03-16 14:53:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:42,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:42,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:42,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:42,025 INFO L87 Difference]: Start difference. First operand 15774 states and 19047 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:53:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:44,386 INFO L93 Difference]: Finished difference Result 39057 states and 47572 transitions. [2025-03-16 14:53:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:44,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-03-16 14:53:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:44,422 INFO L225 Difference]: With dead ends: 39057 [2025-03-16 14:53:44,423 INFO L226 Difference]: Without dead ends: 24035 [2025-03-16 14:53:44,436 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:53:44,437 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 673 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:44,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1359 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:53:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2025-03-16 14:53:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 22533. [2025-03-16 14:53:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.2027782709036037) internal successors, (27101), 22532 states have internal predecessors, (27101), 0 states have call successors, (0), 0 states 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:53:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 27101 transitions. [2025-03-16 14:53:44,655 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 27101 transitions. Word has length 249 [2025-03-16 14:53:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 27101 transitions. [2025-03-16 14:53:44,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:53:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 27101 transitions. [2025-03-16 14:53:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 14:53:44,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:44,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:44,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:53:44,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:44,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash 399263452, now seen corresponding path program 1 times [2025-03-16 14:53:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:44,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360770446] [2025-03-16 14:53:44,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:44,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:53:44,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:53:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:44,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:53:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360770446] [2025-03-16 14:53:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360770446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914014304] [2025-03-16 14:53:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:45,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:45,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:45,014 INFO L87 Difference]: Start difference. First operand 22533 states and 27101 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:47,196 INFO L93 Difference]: Finished difference Result 52575 states and 62632 transitions. [2025-03-16 14:53:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2025-03-16 14:53:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:47,253 INFO L225 Difference]: With dead ends: 52575 [2025-03-16 14:53:47,253 INFO L226 Difference]: Without dead ends: 30794 [2025-03-16 14:53:47,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:53:47,276 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 845 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:47,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 103 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:53:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30794 states. [2025-03-16 14:53:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30794 to 27039. [2025-03-16 14:53:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27039 states, 27038 states have (on average 1.1763074191878098) internal successors, (31805), 27038 states have internal predecessors, (31805), 0 states have call successors, (0), 0 states 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:53:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27039 states to 27039 states and 31805 transitions. [2025-03-16 14:53:47,647 INFO L78 Accepts]: Start accepts. Automaton has 27039 states and 31805 transitions. Word has length 299 [2025-03-16 14:53:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:47,648 INFO L471 AbstractCegarLoop]: Abstraction has 27039 states and 31805 transitions. [2025-03-16 14:53:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27039 states and 31805 transitions. [2025-03-16 14:53:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 14:53:47,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:47,651 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:53:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:53:47,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash 836122634, now seen corresponding path program 1 times [2025-03-16 14:53:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:47,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116108183] [2025-03-16 14:53:47,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:47,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 14:53:47,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 14:53:47,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:53:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116108183] [2025-03-16 14:53:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116108183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:47,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005446565] [2025-03-16 14:53:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:47,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:47,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:47,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:47,909 INFO L87 Difference]: Start difference. First operand 27039 states and 31805 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:50,209 INFO L93 Difference]: Finished difference Result 74354 states and 88318 transitions. [2025-03-16 14:53:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2025-03-16 14:53:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:50,259 INFO L225 Difference]: With dead ends: 74354 [2025-03-16 14:53:50,259 INFO L226 Difference]: Without dead ends: 48067 [2025-03-16 14:53:50,337 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:53:50,341 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:50,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 437 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:53:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2025-03-16 14:53:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 47316. [2025-03-16 14:53:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47316 states, 47315 states have (on average 1.1570115185459158) internal successors, (54744), 47315 states have internal predecessors, (54744), 0 states have call successors, (0), 0 states 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:53:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47316 states to 47316 states and 54744 transitions. [2025-03-16 14:53:50,974 INFO L78 Accepts]: Start accepts. Automaton has 47316 states and 54744 transitions. Word has length 321 [2025-03-16 14:53:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:50,974 INFO L471 AbstractCegarLoop]: Abstraction has 47316 states and 54744 transitions. [2025-03-16 14:53:50,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 47316 states and 54744 transitions. [2025-03-16 14:53:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 14:53:50,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:50,978 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:53:50,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:53:50,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -281428038, now seen corresponding path program 1 times [2025-03-16 14:53:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240882449] [2025-03-16 14:53:50,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 14:53:51,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 14:53:51,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:51,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:53:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240882449] [2025-03-16 14:53:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240882449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815551593] [2025-03-16 14:53:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:51,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:51,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:51,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:51,165 INFO L87 Difference]: Start difference. First operand 47316 states and 54744 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:53:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:53,689 INFO L93 Difference]: Finished difference Result 118663 states and 138615 transitions. [2025-03-16 14:53:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:53,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 353 [2025-03-16 14:53:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:53,764 INFO L225 Difference]: With dead ends: 118663 [2025-03-16 14:53:53,764 INFO L226 Difference]: Without dead ends: 66842 [2025-03-16 14:53:53,793 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:53:53,793 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 770 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:53,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1319 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:53:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66842 states. [2025-03-16 14:53:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66842 to 66091. [2025-03-16 14:53:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.1346043274322892) internal successors, (74986), 66090 states have internal predecessors, (74986), 0 states have call successors, (0), 0 states 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:53:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 74986 transitions. [2025-03-16 14:53:54,591 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 74986 transitions. Word has length 353 [2025-03-16 14:53:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:54,591 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 74986 transitions. [2025-03-16 14:53:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:53:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 74986 transitions. [2025-03-16 14:53:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 14:53:54,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:54,594 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:53:54,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:53:54,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:54,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1838952942, now seen corresponding path program 1 times [2025-03-16 14:53:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259324449] [2025-03-16 14:53:54,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:54,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:53:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:53:54,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 103 proven. 193 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:53:54,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259324449] [2025-03-16 14:53:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259324449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733564451] [2025-03-16 14:53:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:54,886 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:53:54,887 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:53:54,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:53:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:53:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:54,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:53:54,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:53:55,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:53:55,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733564451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:55,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:53:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:53:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498061046] [2025-03-16 14:53:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:55,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:55,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:55,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:55,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:53:55,136 INFO L87 Difference]: Start difference. First operand 66091 states and 74986 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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:53:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:57,793 INFO L93 Difference]: Finished difference Result 173486 states and 196885 transitions. [2025-03-16 14:53:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 361 [2025-03-16 14:53:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:57,935 INFO L225 Difference]: With dead ends: 173486 [2025-03-16 14:53:57,935 INFO L226 Difference]: Without dead ends: 108147 [2025-03-16 14:53:57,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:53:57,965 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 708 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:57,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 977 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:53:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108147 states. [2025-03-16 14:53:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108147 to 101388. [2025-03-16 14:53:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101388 states, 101387 states have (on average 1.1259431682562853) internal successors, (114156), 101387 states have internal predecessors, (114156), 0 states have call successors, (0), 0 states 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:53:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101388 states to 101388 states and 114156 transitions. [2025-03-16 14:53:59,046 INFO L78 Accepts]: Start accepts. Automaton has 101388 states and 114156 transitions. Word has length 361 [2025-03-16 14:53:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:59,047 INFO L471 AbstractCegarLoop]: Abstraction has 101388 states and 114156 transitions. [2025-03-16 14:53:59,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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:53:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 101388 states and 114156 transitions. [2025-03-16 14:53:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 14:53:59,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:59,054 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:59,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:53:59,255 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,SelfDestructingSolverStorable11 [2025-03-16 14:53:59,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:59,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1376861692, now seen corresponding path program 1 times [2025-03-16 14:53:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584101675] [2025-03-16 14:53:59,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:59,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 14:53:59,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 14:53:59,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:59,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-16 14:53:59,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:59,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584101675] [2025-03-16 14:53:59,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584101675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:59,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:59,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505183082] [2025-03-16 14:53:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:59,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:59,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:59,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:59,403 INFO L87 Difference]: Start difference. First operand 101388 states and 114156 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:02,102 INFO L93 Difference]: Finished difference Result 227558 states and 257476 transitions. [2025-03-16 14:54:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 468 [2025-03-16 14:54:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:02,246 INFO L225 Difference]: With dead ends: 227558 [2025-03-16 14:54:02,246 INFO L226 Difference]: Without dead ends: 126922 [2025-03-16 14:54:02,312 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:54:02,313 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:02,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1277 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:54:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126922 states. [2025-03-16 14:54:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126922 to 123167. [2025-03-16 14:54:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123167 states, 123166 states have (on average 1.1174837211568127) internal successors, (137636), 123166 states have internal predecessors, (137636), 0 states have call successors, (0), 0 states 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:54:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123167 states to 123167 states and 137636 transitions. [2025-03-16 14:54:03,716 INFO L78 Accepts]: Start accepts. Automaton has 123167 states and 137636 transitions. Word has length 468 [2025-03-16 14:54:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:03,716 INFO L471 AbstractCegarLoop]: Abstraction has 123167 states and 137636 transitions. [2025-03-16 14:54:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 123167 states and 137636 transitions. [2025-03-16 14:54:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-16 14:54:03,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:03,723 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:03,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:54:03,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 699735118, now seen corresponding path program 1 times [2025-03-16 14:54:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43941499] [2025-03-16 14:54:03,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:03,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 14:54:03,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 14:54:03,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:03,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 14:54:03,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43941499] [2025-03-16 14:54:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43941499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815520429] [2025-03-16 14:54:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:03,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:03,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:03,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:03,895 INFO L87 Difference]: Start difference. First operand 123167 states and 137636 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:06,329 INFO L93 Difference]: Finished difference Result 252341 states and 281414 transitions. [2025-03-16 14:54:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:06,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 472 [2025-03-16 14:54:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:06,700 INFO L225 Difference]: With dead ends: 252341 [2025-03-16 14:54:06,701 INFO L226 Difference]: Without dead ends: 129926 [2025-03-16 14:54:06,740 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:54:06,741 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 767 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:06,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1201 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129926 states. [2025-03-16 14:54:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129926 to 120163. [2025-03-16 14:54:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120163 states, 120162 states have (on average 1.07790316406185) internal successors, (129523), 120162 states have internal predecessors, (129523), 0 states have call successors, (0), 0 states 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:54:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120163 states to 120163 states and 129523 transitions. [2025-03-16 14:54:08,388 INFO L78 Accepts]: Start accepts. Automaton has 120163 states and 129523 transitions. Word has length 472 [2025-03-16 14:54:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:08,388 INFO L471 AbstractCegarLoop]: Abstraction has 120163 states and 129523 transitions. [2025-03-16 14:54:08,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 120163 states and 129523 transitions. [2025-03-16 14:54:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-16 14:54:08,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:08,399 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:08,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:54:08,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 471769125, now seen corresponding path program 1 times [2025-03-16 14:54:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972550390] [2025-03-16 14:54:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:08,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-16 14:54:08,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-16 14:54:08,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:08,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 14:54:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972550390] [2025-03-16 14:54:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972550390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261548629] [2025-03-16 14:54:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:08,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:08,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:08,670 INFO L87 Difference]: Start difference. First operand 120163 states and 129523 transitions. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:54:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:11,056 INFO L93 Difference]: Finished difference Result 274120 states and 296645 transitions. [2025-03-16 14:54:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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 514 [2025-03-16 14:54:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:11,227 INFO L225 Difference]: With dead ends: 274120 [2025-03-16 14:54:11,227 INFO L226 Difference]: Without dead ends: 154709 [2025-03-16 14:54:11,290 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:54:11,290 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 641 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:11,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1328 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154709 states. [2025-03-16 14:54:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154709 to 146448. [2025-03-16 14:54:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146448 states, 146447 states have (on average 1.0659897437298136) internal successors, (156111), 146447 states have internal predecessors, (156111), 0 states have call successors, (0), 0 states 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:54:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146448 states to 146448 states and 156111 transitions. [2025-03-16 14:54:13,004 INFO L78 Accepts]: Start accepts. Automaton has 146448 states and 156111 transitions. Word has length 514 [2025-03-16 14:54:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 146448 states and 156111 transitions. [2025-03-16 14:54:13,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:54:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 146448 states and 156111 transitions. [2025-03-16 14:54:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-16 14:54:13,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:13,014 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:54:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:54:13,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2112401718, now seen corresponding path program 1 times [2025-03-16 14:54:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121760212] [2025-03-16 14:54:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:13,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-16 14:54:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-16 14:54:13,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:13,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:54:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121760212] [2025-03-16 14:54:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121760212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:13,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255771533] [2025-03-16 14:54:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:13,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:13,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:13,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:13,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:13,527 INFO L87 Difference]: Start difference. First operand 146448 states and 156111 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:54:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:16,006 INFO L93 Difference]: Finished difference Result 301907 states and 321573 transitions. [2025-03-16 14:54:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 515 [2025-03-16 14:54:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:16,178 INFO L225 Difference]: With dead ends: 301907 [2025-03-16 14:54:16,178 INFO L226 Difference]: Without dead ends: 156211 [2025-03-16 14:54:16,251 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:54:16,252 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 683 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:16,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 193 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156211 states. [2025-03-16 14:54:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156211 to 145697. [2025-03-16 14:54:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145697 states, 145696 states have (on average 1.0643874917636722) internal successors, (155077), 145696 states have internal predecessors, (155077), 0 states have call successors, (0), 0 states 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:54:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145697 states to 145697 states and 155077 transitions. [2025-03-16 14:54:17,993 INFO L78 Accepts]: Start accepts. Automaton has 145697 states and 155077 transitions. Word has length 515 [2025-03-16 14:54:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:17,994 INFO L471 AbstractCegarLoop]: Abstraction has 145697 states and 155077 transitions. [2025-03-16 14:54:17,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:54:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 145697 states and 155077 transitions. [2025-03-16 14:54:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2025-03-16 14:54:18,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:18,024 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 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] [2025-03-16 14:54:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:54:18,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1203969969, now seen corresponding path program 1 times [2025-03-16 14:54:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160700557] [2025-03-16 14:54:18,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:18,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 717 statements into 1 equivalence classes. [2025-03-16 14:54:18,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 717 of 717 statements. [2025-03-16 14:54:18,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:18,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 797 trivial. 0 not checked. [2025-03-16 14:54:18,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:18,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160700557] [2025-03-16 14:54:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160700557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035367911] [2025-03-16 14:54:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:18,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:18,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:18,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:18,657 INFO L87 Difference]: Start difference. First operand 145697 states and 155077 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:54:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:21,195 INFO L93 Difference]: Finished difference Result 313923 states and 334742 transitions. [2025-03-16 14:54:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 717 [2025-03-16 14:54:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:21,395 INFO L225 Difference]: With dead ends: 313923 [2025-03-16 14:54:21,395 INFO L226 Difference]: Without dead ends: 168978 [2025-03-16 14:54:21,463 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:54:21,463 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 763 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:21,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1115 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168978 states. [2025-03-16 14:54:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168978 to 165974. [2025-03-16 14:54:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165974 states, 165973 states have (on average 1.0567140438505058) internal successors, (175386), 165973 states have internal predecessors, (175386), 0 states have call successors, (0), 0 states 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:54:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165974 states to 165974 states and 175386 transitions. [2025-03-16 14:54:23,738 INFO L78 Accepts]: Start accepts. Automaton has 165974 states and 175386 transitions. Word has length 717 [2025-03-16 14:54:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:23,738 INFO L471 AbstractCegarLoop]: Abstraction has 165974 states and 175386 transitions. [2025-03-16 14:54:23,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:54:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 165974 states and 175386 transitions. [2025-03-16 14:54:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2025-03-16 14:54:23,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:23,790 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:54:23,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1257162371, now seen corresponding path program 1 times [2025-03-16 14:54:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527209500] [2025-03-16 14:54:23,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:23,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 866 statements into 1 equivalence classes. [2025-03-16 14:54:23,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 866 of 866 statements. [2025-03-16 14:54:23,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:23,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-16 14:54:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527209500] [2025-03-16 14:54:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527209500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096984720] [2025-03-16 14:54:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:24,525 INFO L87 Difference]: Start difference. First operand 165974 states and 175386 transitions. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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:54:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:27,032 INFO L93 Difference]: Finished difference Result 364991 states and 387314 transitions. [2025-03-16 14:54:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 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 866 [2025-03-16 14:54:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:27,274 INFO L225 Difference]: With dead ends: 364991 [2025-03-16 14:54:27,274 INFO L226 Difference]: Without dead ends: 199769 [2025-03-16 14:54:27,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:54:27,632 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 767 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:27,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 146 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199769 states. [2025-03-16 14:54:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199769 to 198267. [2025-03-16 14:54:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198267 states, 198266 states have (on average 1.0595059162942713) internal successors, (210064), 198266 states have internal predecessors, (210064), 0 states have call successors, (0), 0 states 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:54:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198267 states to 198267 states and 210064 transitions. [2025-03-16 14:54:29,803 INFO L78 Accepts]: Start accepts. Automaton has 198267 states and 210064 transitions. Word has length 866 [2025-03-16 14:54:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:29,803 INFO L471 AbstractCegarLoop]: Abstraction has 198267 states and 210064 transitions. [2025-03-16 14:54:29,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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:54:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 198267 states and 210064 transitions. [2025-03-16 14:54:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-03-16 14:54:29,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:29,847 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:54:29,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1163038306, now seen corresponding path program 1 times [2025-03-16 14:54:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558966187] [2025-03-16 14:54:29,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:29,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-03-16 14:54:29,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-03-16 14:54:29,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:29,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-16 14:54:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558966187] [2025-03-16 14:54:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558966187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:30,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598247040] [2025-03-16 14:54:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:30,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:30,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:30,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:30,409 INFO L87 Difference]: Start difference. First operand 198267 states and 210064 transitions. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:54:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:32,918 INFO L93 Difference]: Finished difference Result 395031 states and 418607 transitions. [2025-03-16 14:54:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 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 964 [2025-03-16 14:54:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:33,146 INFO L225 Difference]: With dead ends: 395031 [2025-03-16 14:54:33,146 INFO L226 Difference]: Without dead ends: 197516 [2025-03-16 14:54:33,242 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:54:33,243 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:33,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 261 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:54:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197516 states. [2025-03-16 14:54:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197516 to 196765. [2025-03-16 14:54:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196765 states, 196764 states have (on average 1.0538563964952938) internal successors, (207361), 196764 states have internal predecessors, (207361), 0 states have call successors, (0), 0 states 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:54:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196765 states to 196765 states and 207361 transitions. [2025-03-16 14:54:35,924 INFO L78 Accepts]: Start accepts. Automaton has 196765 states and 207361 transitions. Word has length 964 [2025-03-16 14:54:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 196765 states and 207361 transitions. [2025-03-16 14:54:35,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:54:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 196765 states and 207361 transitions. [2025-03-16 14:54:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-03-16 14:54:35,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:35,964 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:35,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:54:35,964 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1211788511, now seen corresponding path program 1 times [2025-03-16 14:54:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17469355] [2025-03-16 14:54:35,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:36,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-03-16 14:54:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-03-16 14:54:36,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 14:54:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17469355] [2025-03-16 14:54:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17469355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:54:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626781382] [2025-03-16 14:54:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:36,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:36,964 INFO L87 Difference]: Start difference. First operand 196765 states and 207361 transitions. Second operand has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)