./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label30.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_label30.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 0e208708a27329bc1b7bf267e92e92da86b44f6d40f860b2d7ec34e4892651a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:55:46,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:55:46,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:55:46,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:55:46,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:55:46,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:55:46,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:55:46,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:55:46,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:55:46,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:55:46,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:55:46,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:55:46,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:55:46,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:55:46,377 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:55:46,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:55:46,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:55:46,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:55:46,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:55:46,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:55:46,380 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 -> 0e208708a27329bc1b7bf267e92e92da86b44f6d40f860b2d7ec34e4892651a8 [2025-03-16 14:55:46,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:55:46,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:55:46,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:55:46,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:55:46,582 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:55:46,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label30.c [2025-03-16 14:55:47,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebf57ab5/33344c1ba8aa407cba91d4c885958f22/FLAG40441a099 [2025-03-16 14:55:48,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:55:48,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label30.c [2025-03-16 14:55:48,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebf57ab5/33344c1ba8aa407cba91d4c885958f22/FLAG40441a099 [2025-03-16 14:55:48,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebf57ab5/33344c1ba8aa407cba91d4c885958f22 [2025-03-16 14:55:48,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:55:48,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:55:48,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:55:48,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:55:48,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:55:48,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:55:48" (1/1) ... [2025-03-16 14:55:48,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:48, skipping insertion in model container [2025-03-16 14:55:48,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:55:48" (1/1) ... [2025-03-16 14:55:48,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:55:48,554 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_label30.c[3429,3442] [2025-03-16 14:55:49,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:55:49,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:55:49,031 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_label30.c[3429,3442] [2025-03-16 14:55:49,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:55:49,276 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:55:49,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49 WrapperNode [2025-03-16 14:55:49,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:55:49,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:55:49,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:55:49,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:55:49,283 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:55:49" (1/1) ... [2025-03-16 14:55:49,320 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:55:49" (1/1) ... [2025-03-16 14:55:49,547 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:55:49,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:55:49,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:55:49,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:55:49,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:55:49,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,741 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:55:49,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:55:49,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:55:49,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:55:49,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:55:49,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (1/1) ... [2025-03-16 14:55:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:55:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:55:49,988 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:55:49,993 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:55:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:55:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:55:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:55:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:55:50,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:55:50,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:55:53,362 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:55:53,362 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:55:53,362 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:55:53,514 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:55:53,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:55:53,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:55:53,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:55:53,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:55:53 BoogieIcfgContainer [2025-03-16 14:55:53,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:55:53,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:55:53,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:55:53,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:55:53,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:55:48" (1/3) ... [2025-03-16 14:55:53,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2befd088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:55:53, skipping insertion in model container [2025-03-16 14:55:53,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:55:49" (2/3) ... [2025-03-16 14:55:53,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2befd088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:55:53, skipping insertion in model container [2025-03-16 14:55:53,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:55:53" (3/3) ... [2025-03-16 14:55:53,552 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label30.c [2025-03-16 14:55:53,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:55:53,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label30.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:55:53,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:55:53,642 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;@703b25b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:55:53,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:55:53,647 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:55:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 14:55:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:53,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:53,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash 46269382, now seen corresponding path program 1 times [2025-03-16 14:55:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629820113] [2025-03-16 14:55:53,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 14:55:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 14:55:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:53,777 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:55:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629820113] [2025-03-16 14:55:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629820113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:55:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855217235] [2025-03-16 14:55:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:55:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:55:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:55:53,799 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:55:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:53,873 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:55:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:55:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-16 14:55:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:53,888 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:55:53,888 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:55:53,893 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:55:53,897 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:55:53,899 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:55:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:55:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:55:53,961 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:55:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:55:53,967 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 24 [2025-03-16 14:55:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:55:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:55:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:55:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 14:55:53,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:53,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:53,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:55:53,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1453321625, now seen corresponding path program 1 times [2025-03-16 14:55:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:53,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431085326] [2025-03-16 14:55:53,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:53,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 14:55:53,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 14:55:53,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:53,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:54,075 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:55:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431085326] [2025-03-16 14:55:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431085326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:55:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205822073] [2025-03-16 14:55:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:54,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:54,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:54,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:54,078 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:55:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:56,895 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:55:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-16 14:55:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:56,901 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:55:56,901 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:55:56,902 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:55:56,903 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 776 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:56,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 474 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:55:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:55:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:55:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6070478723404256) internal successors, (2417), 1504 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2417 transitions. [2025-03-16 14:55:56,950 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2417 transitions. Word has length 24 [2025-03-16 14:55:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:56,950 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2417 transitions. [2025-03-16 14:55:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:55:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2417 transitions. [2025-03-16 14:55:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:55:56,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:56,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:55:56,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 596393505, now seen corresponding path program 1 times [2025-03-16 14:55:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:56,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17916332] [2025-03-16 14:55:56,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:56,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:55:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:55:57,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17916332] [2025-03-16 14:55:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17916332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:55:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623205844] [2025-03-16 14:55:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:57,199 INFO L87 Difference]: Start difference. First operand 1505 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:55:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:59,711 INFO L93 Difference]: Finished difference Result 4513 states and 7249 transitions. [2025-03-16 14:55:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 14:55:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:59,722 INFO L225 Difference]: With dead ends: 4513 [2025-03-16 14:55:59,722 INFO L226 Difference]: Without dead ends: 3009 [2025-03-16 14:55:59,724 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:55:59,725 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 582 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:55:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-16 14:55:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007. [2025-03-16 14:55:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4597471723220226) internal successors, (4388), 3006 states have internal predecessors, (4388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4388 transitions. [2025-03-16 14:55:59,771 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4388 transitions. Word has length 99 [2025-03-16 14:55:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:59,772 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4388 transitions. [2025-03-16 14:55:59,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:55:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4388 transitions. [2025-03-16 14:55:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 14:55:59,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:59,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:55:59,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:59,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1508664597, now seen corresponding path program 1 times [2025-03-16 14:55:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535484548] [2025-03-16 14:55:59,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:59,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 14:55:59,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 14:55:59,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:59,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:55:59,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535484548] [2025-03-16 14:55:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535484548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:59,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:59,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:55:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515312938] [2025-03-16 14:55:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:59,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:59,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:59,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:59,958 INFO L87 Difference]: Start difference. First operand 3007 states and 4388 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:02,039 INFO L93 Difference]: Finished difference Result 9017 states and 13161 transitions. [2025-03-16 14:56:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 14:56:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:02,058 INFO L225 Difference]: With dead ends: 9017 [2025-03-16 14:56:02,058 INFO L226 Difference]: Without dead ends: 6011 [2025-03-16 14:56:02,061 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:56:02,064 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:02,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 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:56:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2025-03-16 14:56:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 6011. [2025-03-16 14:56:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2951747088186356) internal successors, (7784), 6010 states have internal predecessors, (7784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7784 transitions. [2025-03-16 14:56:02,145 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7784 transitions. Word has length 128 [2025-03-16 14:56:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:02,147 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7784 transitions. [2025-03-16 14:56:02,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7784 transitions. [2025-03-16 14:56:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 14:56:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:02,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:56:02,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:02,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1107756006, now seen corresponding path program 1 times [2025-03-16 14:56:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:02,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054563242] [2025-03-16 14:56:02,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:02,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 14:56:02,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 14:56:02,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:02,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054563242] [2025-03-16 14:56:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054563242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:02,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:02,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239427820] [2025-03-16 14:56:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:02,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:02,323 INFO L87 Difference]: Start difference. First operand 6011 states and 7784 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:56:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:04,651 INFO L93 Difference]: Finished difference Result 18029 states and 23349 transitions. [2025-03-16 14:56:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:04,651 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 165 [2025-03-16 14:56:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:04,681 INFO L225 Difference]: With dead ends: 18029 [2025-03-16 14:56:04,681 INFO L226 Difference]: Without dead ends: 12019 [2025-03-16 14:56:04,689 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:56:04,690 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 729 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:04,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1439 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2025-03-16 14:56:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 11268. [2025-03-16 14:56:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.267684388035857) internal successors, (14283), 11267 states have internal predecessors, (14283), 0 states have call successors, (0), 0 states 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:56:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14283 transitions. [2025-03-16 14:56:04,872 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14283 transitions. Word has length 165 [2025-03-16 14:56:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:04,873 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 14283 transitions. [2025-03-16 14:56:04,873 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:56:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14283 transitions. [2025-03-16 14:56:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 14:56:04,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:04,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:56:04,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1983774129, now seen corresponding path program 1 times [2025-03-16 14:56:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692761239] [2025-03-16 14:56:04,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:04,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 14:56:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 14:56:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692761239] [2025-03-16 14:56:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692761239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:56:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801889364] [2025-03-16 14:56:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:56:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:56:05,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:05,347 INFO L87 Difference]: Start difference. First operand 11268 states and 14283 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:09,597 INFO L93 Difference]: Finished difference Result 29294 states and 36128 transitions. [2025-03-16 14:56:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:56:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-16 14:56:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:09,627 INFO L225 Difference]: With dead ends: 29294 [2025-03-16 14:56:09,627 INFO L226 Difference]: Without dead ends: 18027 [2025-03-16 14:56:09,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:09,634 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 2114 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7644 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 7803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 7644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:09,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 732 Invalid, 7803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 7644 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 14:56:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2025-03-16 14:56:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 16525. [2025-03-16 14:56:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.2050351004599371) internal successors, (19912), 16524 states have internal predecessors, (19912), 0 states have call successors, (0), 0 states 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:56:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19912 transitions. [2025-03-16 14:56:09,811 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19912 transitions. Word has length 168 [2025-03-16 14:56:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:09,812 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19912 transitions. [2025-03-16 14:56:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19912 transitions. [2025-03-16 14:56:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 14:56:09,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:09,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:56:09,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:09,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2012422704, now seen corresponding path program 1 times [2025-03-16 14:56:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588701080] [2025-03-16 14:56:09,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:09,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 14:56:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 14:56:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588701080] [2025-03-16 14:56:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588701080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046320786] [2025-03-16 14:56:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:09,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:09,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:09,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:09,939 INFO L87 Difference]: Start difference. First operand 16525 states and 19912 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:12,269 INFO L93 Difference]: Finished difference Result 39057 states and 47605 transitions. [2025-03-16 14:56:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:12,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-03-16 14:56:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:12,356 INFO L225 Difference]: With dead ends: 39057 [2025-03-16 14:56:12,356 INFO L226 Difference]: Without dead ends: 22533 [2025-03-16 14:56:12,365 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:56:12,366 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 736 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:12,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1425 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2025-03-16 14:56:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 22533. [2025-03-16 14:56:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.2062843955263625) internal successors, (27180), 22532 states have internal predecessors, (27180), 0 states have call successors, (0), 0 states 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:56:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 27180 transitions. [2025-03-16 14:56:12,706 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 27180 transitions. Word has length 169 [2025-03-16 14:56:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 27180 transitions. [2025-03-16 14:56:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 27180 transitions. [2025-03-16 14:56:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-16 14:56:12,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:12,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:12,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:56:12,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1923029057, now seen corresponding path program 1 times [2025-03-16 14:56:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410428649] [2025-03-16 14:56:12,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:12,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 14:56:12,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 14:56:12,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:12,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410428649] [2025-03-16 14:56:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410428649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953354848] [2025-03-16 14:56:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:12,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:12,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:12,992 INFO L87 Difference]: Start difference. First operand 22533 states and 27180 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:56:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:15,360 INFO L93 Difference]: Finished difference Result 50359 states and 60085 transitions. [2025-03-16 14:56:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2025-03-16 14:56:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:15,394 INFO L225 Difference]: With dead ends: 50359 [2025-03-16 14:56:15,394 INFO L226 Difference]: Without dead ends: 27790 [2025-03-16 14:56:15,412 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:56:15,412 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 688 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:15,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 710 Invalid, 3903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27790 states. [2025-03-16 14:56:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27790 to 27790. [2025-03-16 14:56:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27790 states, 27789 states have (on average 1.1701752491993234) internal successors, (32518), 27789 states have internal predecessors, (32518), 0 states have call successors, (0), 0 states 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:56:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27790 states to 27790 states and 32518 transitions. [2025-03-16 14:56:15,776 INFO L78 Accepts]: Start accepts. Automaton has 27790 states and 32518 transitions. Word has length 239 [2025-03-16 14:56:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:15,777 INFO L471 AbstractCegarLoop]: Abstraction has 27790 states and 32518 transitions. [2025-03-16 14:56:15,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:56:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 27790 states and 32518 transitions. [2025-03-16 14:56:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-16 14:56:15,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:15,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:56:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:56:15,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:15,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1378477638, now seen corresponding path program 1 times [2025-03-16 14:56:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672274122] [2025-03-16 14:56:15,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 14:56:15,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 14:56:15,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:56:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672274122] [2025-03-16 14:56:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672274122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:16,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976312320] [2025-03-16 14:56:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:16,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:16,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:16,087 INFO L87 Difference]: Start difference. First operand 27790 states and 32518 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:56:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:18,318 INFO L93 Difference]: Finished difference Result 72101 states and 85383 transitions. [2025-03-16 14:56:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 301 [2025-03-16 14:56:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:18,368 INFO L225 Difference]: With dead ends: 72101 [2025-03-16 14:56:18,368 INFO L226 Difference]: Without dead ends: 44312 [2025-03-16 14:56:18,387 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:56:18,389 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 776 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1307 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:56:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44312 states. [2025-03-16 14:56:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44312 to 40557. [2025-03-16 14:56:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40557 states, 40556 states have (on average 1.14722852352303) internal successors, (46527), 40556 states have internal predecessors, (46527), 0 states have call successors, (0), 0 states 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:56:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40557 states to 40557 states and 46527 transitions. [2025-03-16 14:56:18,844 INFO L78 Accepts]: Start accepts. Automaton has 40557 states and 46527 transitions. Word has length 301 [2025-03-16 14:56:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:18,845 INFO L471 AbstractCegarLoop]: Abstraction has 40557 states and 46527 transitions. [2025-03-16 14:56:18,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:56:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40557 states and 46527 transitions. [2025-03-16 14:56:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 14:56:18,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:18,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:56:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:56:18,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1564137560, now seen corresponding path program 1 times [2025-03-16 14:56:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448033640] [2025-03-16 14:56:18,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:18,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 14:56:18,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 14:56:18,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:18,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:56:19,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448033640] [2025-03-16 14:56:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448033640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177001136] [2025-03-16 14:56:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:19,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:19,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:19,064 INFO L87 Difference]: Start difference. First operand 40557 states and 46527 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:56:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:21,689 INFO L93 Difference]: Finished difference Result 97635 states and 113640 transitions. [2025-03-16 14:56:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 323 [2025-03-16 14:56:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:21,753 INFO L225 Difference]: With dead ends: 97635 [2025-03-16 14:56:21,753 INFO L226 Difference]: Without dead ends: 57079 [2025-03-16 14:56:21,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:21,766 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 715 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:21,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 468 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:56:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57079 states. [2025-03-16 14:56:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57079 to 56328. [2025-03-16 14:56:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56328 states, 56327 states have (on average 1.1512063486427468) internal successors, (64844), 56327 states have internal predecessors, (64844), 0 states have call successors, (0), 0 states 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:56:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56328 states to 56328 states and 64844 transitions. [2025-03-16 14:56:22,275 INFO L78 Accepts]: Start accepts. Automaton has 56328 states and 64844 transitions. Word has length 323 [2025-03-16 14:56:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:22,275 INFO L471 AbstractCegarLoop]: Abstraction has 56328 states and 64844 transitions. [2025-03-16 14:56:22,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:56:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56328 states and 64844 transitions. [2025-03-16 14:56:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-16 14:56:22,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:22,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:56:22,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash -744435779, now seen corresponding path program 1 times [2025-03-16 14:56:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099303543] [2025-03-16 14:56:22,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:22,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 14:56:22,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 14:56:22,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:22,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:22,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099303543] [2025-03-16 14:56:22,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099303543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:22,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717064107] [2025-03-16 14:56:22,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:22,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:22,751 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:56:22,757 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:56:22,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 14:56:22,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 14:56:22,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:22,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:22,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 14:56:23,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717064107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:23,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:56:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171016534] [2025-03-16 14:56:23,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:23,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:23,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:23,400 INFO L87 Difference]: Start difference. First operand 56328 states and 64844 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:56:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:25,468 INFO L93 Difference]: Finished difference Result 132932 states and 151668 transitions. [2025-03-16 14:56:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 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 329 [2025-03-16 14:56:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:25,537 INFO L225 Difference]: With dead ends: 132932 [2025-03-16 14:56:25,538 INFO L226 Difference]: Without dead ends: 76605 [2025-03-16 14:56:25,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:25,566 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 525 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:25,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 204 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:56:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76605 states. [2025-03-16 14:56:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76605 to 71348. [2025-03-16 14:56:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71348 states, 71347 states have (on average 1.1235090473320533) internal successors, (80159), 71347 states have internal predecessors, (80159), 0 states have call successors, (0), 0 states 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:56:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71348 states to 71348 states and 80159 transitions. [2025-03-16 14:56:26,405 INFO L78 Accepts]: Start accepts. Automaton has 71348 states and 80159 transitions. Word has length 329 [2025-03-16 14:56:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:26,406 INFO L471 AbstractCegarLoop]: Abstraction has 71348 states and 80159 transitions. [2025-03-16 14:56:26,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:56:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 71348 states and 80159 transitions. [2025-03-16 14:56:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 14:56:26,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:26,409 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:26,419 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:56:26,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 14:56:26,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2069688290, now seen corresponding path program 1 times [2025-03-16 14:56:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:26,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309208114] [2025-03-16 14:56:26,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:26,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:26,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 14:56:26,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 14:56:26,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 68 proven. 108 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 14:56:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309208114] [2025-03-16 14:56:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309208114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272402298] [2025-03-16 14:56:26,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:26,854 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:56:26,856 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:56:26,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 14:56:26,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 14:56:26,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:26,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:26,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:26,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-16 14:56:27,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272402298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:27,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:27,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:56:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604208505] [2025-03-16 14:56:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:27,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:27,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:27,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:27,028 INFO L87 Difference]: Start difference. First operand 71348 states and 80159 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:56:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:29,371 INFO L93 Difference]: Finished difference Result 170482 states and 193816 transitions. [2025-03-16 14:56:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:29,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 351 [2025-03-16 14:56:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:29,623 INFO L225 Difference]: With dead ends: 170482 [2025-03-16 14:56:29,623 INFO L226 Difference]: Without dead ends: 99135 [2025-03-16 14:56:29,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:29,664 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 791 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:29,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 249 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:56:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99135 states. [2025-03-16 14:56:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99135 to 98384. [2025-03-16 14:56:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98384 states, 98383 states have (on average 1.1170934002825692) internal successors, (109903), 98383 states have internal predecessors, (109903), 0 states have call successors, (0), 0 states 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:56:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98384 states to 98384 states and 109903 transitions. [2025-03-16 14:56:30,528 INFO L78 Accepts]: Start accepts. Automaton has 98384 states and 109903 transitions. Word has length 351 [2025-03-16 14:56:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 98384 states and 109903 transitions. [2025-03-16 14:56:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:56:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98384 states and 109903 transitions. [2025-03-16 14:56:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 14:56:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:30,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:56:30,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:56:30,736 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:56:30,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2105901912, now seen corresponding path program 1 times [2025-03-16 14:56:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56518432] [2025-03-16 14:56:30,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:30,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-16 14:56:30,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-16 14:56:30,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:30,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:56:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:30,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56518432] [2025-03-16 14:56:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56518432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:30,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770171596] [2025-03-16 14:56:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:30,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:30,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:30,879 INFO L87 Difference]: Start difference. First operand 98384 states and 109903 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:56:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:33,770 INFO L93 Difference]: Finished difference Result 242578 states and 273179 transitions. [2025-03-16 14:56:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:33,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 355 [2025-03-16 14:56:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:33,909 INFO L225 Difference]: With dead ends: 242578 [2025-03-16 14:56:33,909 INFO L226 Difference]: Without dead ends: 138938 [2025-03-16 14:56:33,943 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:56:33,943 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 779 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:33,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1277 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138938 states. [2025-03-16 14:56:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138938 to 132930. [2025-03-16 14:56:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132930 states, 132929 states have (on average 1.0994139728727366) internal successors, (146144), 132929 states have internal predecessors, (146144), 0 states have call successors, (0), 0 states 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:56:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132930 states to 132930 states and 146144 transitions. [2025-03-16 14:56:35,343 INFO L78 Accepts]: Start accepts. Automaton has 132930 states and 146144 transitions. Word has length 355 [2025-03-16 14:56:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:35,343 INFO L471 AbstractCegarLoop]: Abstraction has 132930 states and 146144 transitions. [2025-03-16 14:56:35,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:56:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 132930 states and 146144 transitions. [2025-03-16 14:56:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-16 14:56:35,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:35,350 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:56:35,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:56:35,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1221138652, now seen corresponding path program 1 times [2025-03-16 14:56:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626003377] [2025-03-16 14:56:35,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:35,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-16 14:56:35,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-16 14:56:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 14:56:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626003377] [2025-03-16 14:56:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626003377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:35,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:35,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799191455] [2025-03-16 14:56:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:35,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:35,698 INFO L87 Difference]: Start difference. First operand 132930 states and 146144 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:56:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:38,392 INFO L93 Difference]: Finished difference Result 301907 states and 333541 transitions. [2025-03-16 14:56:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 459 [2025-03-16 14:56:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:38,589 INFO L225 Difference]: With dead ends: 301907 [2025-03-16 14:56:38,589 INFO L226 Difference]: Without dead ends: 168978 [2025-03-16 14:56:38,662 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:56:38,662 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 744 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:38,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1272 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:56:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168978 states. [2025-03-16 14:56:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168978 to 161468. [2025-03-16 14:56:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161468 states, 161467 states have (on average 1.0902785089213276) internal successors, (176044), 161467 states have internal predecessors, (176044), 0 states have call successors, (0), 0 states 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:56:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161468 states to 161468 states and 176044 transitions. [2025-03-16 14:56:40,545 INFO L78 Accepts]: Start accepts. Automaton has 161468 states and 176044 transitions. Word has length 459 [2025-03-16 14:56:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:40,546 INFO L471 AbstractCegarLoop]: Abstraction has 161468 states and 176044 transitions. [2025-03-16 14:56:40,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:56:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 161468 states and 176044 transitions. [2025-03-16 14:56:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2025-03-16 14:56:40,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:40,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:56:40,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:56:40,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1402254832, now seen corresponding path program 1 times [2025-03-16 14:56:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906143359] [2025-03-16 14:56:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:40,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-03-16 14:56:40,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-03-16 14:56:40,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:40,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:42,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906143359] [2025-03-16 14:56:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906143359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:42,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 14:56:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273861477] [2025-03-16 14:56:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:42,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:56:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:42,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:56:42,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:56:42,429 INFO L87 Difference]: Start difference. First operand 161468 states and 176044 transitions. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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:56:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:47,952 INFO L93 Difference]: Finished difference Result 337957 states and 368270 transitions. [2025-03-16 14:56:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:56:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 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 768 [2025-03-16 14:56:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:48,160 INFO L225 Difference]: With dead ends: 337957 [2025-03-16 14:56:48,160 INFO L226 Difference]: Without dead ends: 176490 [2025-03-16 14:56:48,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:56:48,251 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2908 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9651 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 10329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 9651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:48,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 565 Invalid, 10329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 9651 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 14:56:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176490 states. [2025-03-16 14:56:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176490 to 168227. [2025-03-16 14:56:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168227 states, 168226 states have (on average 1.090919358482042) internal successors, (183521), 168226 states have internal predecessors, (183521), 0 states have call successors, (0), 0 states 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:56:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168227 states to 168227 states and 183521 transitions. [2025-03-16 14:56:50,396 INFO L78 Accepts]: Start accepts. Automaton has 168227 states and 183521 transitions. Word has length 768 [2025-03-16 14:56:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:50,397 INFO L471 AbstractCegarLoop]: Abstraction has 168227 states and 183521 transitions. [2025-03-16 14:56:50,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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:56:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 168227 states and 183521 transitions. [2025-03-16 14:56:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-16 14:56:50,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:50,444 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:56:50,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1516503709, now seen corresponding path program 1 times [2025-03-16 14:56:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52905867] [2025-03-16 14:56:50,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:50,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-16 14:56:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-16 14:56:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 415 proven. 54 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 14:56:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52905867] [2025-03-16 14:56:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52905867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037039413] [2025-03-16 14:56:51,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:51,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:56:51,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:56:51,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-16 14:56:51,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-16 14:56:51,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:51,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:56:52,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-16 14:56:52,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037039413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:56:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130300879] [2025-03-16 14:56:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:56:52,640 INFO L87 Difference]: Start difference. First operand 168227 states and 183521 transitions. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:56:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:57,197 INFO L93 Difference]: Finished difference Result 509185 states and 556270 transitions. [2025-03-16 14:56:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 791 [2025-03-16 14:56:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:57,658 INFO L225 Difference]: With dead ends: 509185 [2025-03-16 14:56:57,658 INFO L226 Difference]: Without dead ends: 340959 [2025-03-16 14:56:57,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:56:57,813 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1536 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:57,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 52 Invalid, 5388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 14:56:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340959 states. [2025-03-16 14:57:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340959 to 340206. [2025-03-16 14:57:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340206 states, 340205 states have (on average 1.0886730059816876) internal successors, (370372), 340205 states have internal predecessors, (370372), 0 states have call successors, (0), 0 states 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:57:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340206 states to 340206 states and 370372 transitions. [2025-03-16 14:57:02,535 INFO L78 Accepts]: Start accepts. Automaton has 340206 states and 370372 transitions. Word has length 791 [2025-03-16 14:57:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:02,536 INFO L471 AbstractCegarLoop]: Abstraction has 340206 states and 370372 transitions. [2025-03-16 14:57:02,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:57:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 340206 states and 370372 transitions. [2025-03-16 14:57:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2025-03-16 14:57:02,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:02,695 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:02,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:57:02,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:02,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:02,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1484053193, now seen corresponding path program 1 times [2025-03-16 14:57:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760096719] [2025-03-16 14:57:02,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 965 statements into 1 equivalence classes. [2025-03-16 14:57:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 965 of 965 statements. [2025-03-16 14:57:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 1009 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:57:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760096719] [2025-03-16 14:57:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760096719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:57:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051883998] [2025-03-16 14:57:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:03,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:57:03,803 INFO L87 Difference]: Start difference. First operand 340206 states and 370372 transitions. Second operand has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:57:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:07,796 INFO L93 Difference]: Finished difference Result 691676 states and 752523 transitions. [2025-03-16 14:57:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 965 [2025-03-16 14:57:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:08,232 INFO L225 Difference]: With dead ends: 691676 [2025-03-16 14:57:08,233 INFO L226 Difference]: Without dead ends: 352222 [2025-03-16 14:57:08,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:57:08,347 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 1320 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 4271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:08,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1331 Invalid, 4271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:57:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352222 states.