./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label37.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/Problem13_label37.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 a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:02:08,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:02:08,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:02:08,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:02:08,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:02:08,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:02:08,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:02:08,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:02:08,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:02:08,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:02:08,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:02:08,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:02:08,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:02:08,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:02:08,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:02:08,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:02:08,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:02:08,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:02:08,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:02:08,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:02:08,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:02:08,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:02:08,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:02:08,535 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 -> a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e [2025-03-16 15:02:08,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:02:08,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:02:08,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:02:08,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:02:08,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:02:08,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-16 15:02:09,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca5fed94/748fcebc69d94a1fa1a38b3b483e076b/FLAG9a09a6945 [2025-03-16 15:02:10,358 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:02:10,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-16 15:02:10,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca5fed94/748fcebc69d94a1fa1a38b3b483e076b/FLAG9a09a6945 [2025-03-16 15:02:10,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca5fed94/748fcebc69d94a1fa1a38b3b483e076b [2025-03-16 15:02:10,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:02:10,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:02:10,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:02:10,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:02:10,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:02:10,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:02:10" (1/1) ... [2025-03-16 15:02:10,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31beb253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:10, skipping insertion in model container [2025-03-16 15:02:10,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:02:10" (1/1) ... [2025-03-16 15:02:10,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:02:10,715 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/Problem13_label37.c[7700,7713] [2025-03-16 15:02:11,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:02:11,226 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:02:11,250 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/Problem13_label37.c[7700,7713] [2025-03-16 15:02:11,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:02:11,556 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:02:11,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11 WrapperNode [2025-03-16 15:02:11,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:02:11,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:02:11,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:02:11,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:02:11,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:11,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,059 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:02:12,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:02:12,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:02:12,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:02:12,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:02:12,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,342 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 15:02:12,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:02:12,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:02:12,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:02:12,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:02:12,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (1/1) ... [2025-03-16 15:02:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:02:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:12,795 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 15:02:12,798 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 15:02:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:02:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:02:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:02:12,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:02:12,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:02:12,872 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:02:17,304 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:02:17,304 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:02:17,304 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:02:17,441 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:02:17,442 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:02:17,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:02:17,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:02:17,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:17 BoogieIcfgContainer [2025-03-16 15:02:17,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:02:17,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:02:17,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:02:17,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:02:17,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:02:10" (1/3) ... [2025-03-16 15:02:17,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2348385a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:17, skipping insertion in model container [2025-03-16 15:02:17,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:11" (2/3) ... [2025-03-16 15:02:17,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2348385a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:17, skipping insertion in model container [2025-03-16 15:02:17,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:17" (3/3) ... [2025-03-16 15:02:17,486 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label37.c [2025-03-16 15:02:17,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:02:17,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label37.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:02:17,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:02:17,585 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;@5347d248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:02:17,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:02:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 15:02:17,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:17,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:17,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1911410046, now seen corresponding path program 1 times [2025-03-16 15:02:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478112298] [2025-03-16 15:02:17,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 15:02:17,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 15:02:17,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478112298] [2025-03-16 15:02:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478112298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:17,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468124449] [2025-03-16 15:02:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:17,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:02:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:17,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:02:17,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:02:17,759 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:17,839 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:02:17,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:02:17,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 15:02:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:17,864 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:02:17,864 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:02:17,869 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 15:02:17,871 INFO L435 NwaCegarLoop]: 1879 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, 1879 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 15:02:17,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:02:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:02:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:02:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:02:17,946 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 53 [2025-03-16 15:02:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:17,946 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:02:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:02:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 15:02:17,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:17,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:17,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:02:17,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:17,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash -728312446, now seen corresponding path program 1 times [2025-03-16 15:02:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765510785] [2025-03-16 15:02:17,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:17,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:17,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 15:02:17,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 15:02:17,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:17,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:18,169 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 15:02:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765510785] [2025-03-16 15:02:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765510785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:18,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:18,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856241712] [2025-03-16 15:02:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:18,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:18,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:18,173 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:22,247 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2025-03-16 15:02:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 15:02:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:22,256 INFO L225 Difference]: With dead ends: 2976 [2025-03-16 15:02:22,256 INFO L226 Difference]: Without dead ends: 1943 [2025-03-16 15:02:22,258 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 15:02:22,258 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 901 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:22,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 535 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:02:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-16 15:02:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2025-03-16 15:02:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2025-03-16 15:02:22,308 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 53 [2025-03-16 15:02:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2025-03-16 15:02:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2025-03-16 15:02:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 15:02:22,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:22,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:02:22,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2137497259, now seen corresponding path program 1 times [2025-03-16 15:02:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189079282] [2025-03-16 15:02:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:22,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 15:02:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 15:02:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189079282] [2025-03-16 15:02:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189079282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:22,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956431159] [2025-03-16 15:02:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:22,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:22,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:22,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:22,641 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:25,600 INFO L93 Difference]: Finished difference Result 4603 states and 7963 transitions. [2025-03-16 15:02:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 15:02:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:25,610 INFO L225 Difference]: With dead ends: 4603 [2025-03-16 15:02:25,610 INFO L226 Difference]: Without dead ends: 2732 [2025-03-16 15:02:25,612 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 15:02:25,613 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:25,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:02:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-16 15:02:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2669. [2025-03-16 15:02:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.6581709145427286) internal successors, (4424), 2668 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4424 transitions. [2025-03-16 15:02:25,654 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4424 transitions. Word has length 118 [2025-03-16 15:02:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:25,654 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4424 transitions. [2025-03-16 15:02:25,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4424 transitions. [2025-03-16 15:02:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 15:02:25,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:25,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:25,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:02:25,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash 739127943, now seen corresponding path program 1 times [2025-03-16 15:02:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461020614] [2025-03-16 15:02:25,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:25,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 15:02:25,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 15:02:25,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:25,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461020614] [2025-03-16 15:02:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461020614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631816250] [2025-03-16 15:02:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:25,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:25,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:25,840 INFO L87 Difference]: Start difference. First operand 2669 states and 4424 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:28,509 INFO L93 Difference]: Finished difference Result 7731 states and 12863 transitions. [2025-03-16 15:02:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-16 15:02:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:28,524 INFO L225 Difference]: With dead ends: 7731 [2025-03-16 15:02:28,525 INFO L226 Difference]: Without dead ends: 5063 [2025-03-16 15:02:28,527 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 15:02:28,528 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:28,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1135 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2025-03-16 15:02:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5062. [2025-03-16 15:02:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 5061 states have (on average 1.4546532305868405) internal successors, (7362), 5061 states have internal predecessors, (7362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 7362 transitions. [2025-03-16 15:02:28,595 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 7362 transitions. Word has length 119 [2025-03-16 15:02:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:28,597 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 7362 transitions. [2025-03-16 15:02:28,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 7362 transitions. [2025-03-16 15:02:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 15:02:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:28,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:02:28,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:28,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -259652405, now seen corresponding path program 1 times [2025-03-16 15:02:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938895846] [2025-03-16 15:02:28,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:28,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 15:02:28,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 15:02:28,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:28,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938895846] [2025-03-16 15:02:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938895846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141003378] [2025-03-16 15:02:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:28,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:28,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:28,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:28,706 INFO L87 Difference]: Start difference. First operand 5062 states and 7362 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:31,907 INFO L93 Difference]: Finished difference Result 12512 states and 18430 transitions. [2025-03-16 15:02:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-16 15:02:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:31,923 INFO L225 Difference]: With dead ends: 12512 [2025-03-16 15:02:31,923 INFO L226 Difference]: Without dead ends: 7451 [2025-03-16 15:02:31,928 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 15:02:31,929 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:31,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1174 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:02:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2025-03-16 15:02:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7443. [2025-03-16 15:02:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7442 states have (on average 1.3368718086535878) internal successors, (9949), 7442 states have internal predecessors, (9949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9949 transitions. [2025-03-16 15:02:32,015 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9949 transitions. Word has length 122 [2025-03-16 15:02:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 7443 states and 9949 transitions. [2025-03-16 15:02:32,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9949 transitions. [2025-03-16 15:02:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 15:02:32,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:32,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:02:32,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1604752033, now seen corresponding path program 1 times [2025-03-16 15:02:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780145971] [2025-03-16 15:02:32,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:32,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 15:02:32,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 15:02:32,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:32,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780145971] [2025-03-16 15:02:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780145971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:32,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:32,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084713408] [2025-03-16 15:02:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:32,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:32,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:32,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:32,112 INFO L87 Difference]: Start difference. First operand 7443 states and 9949 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:34,778 INFO L93 Difference]: Finished difference Result 20423 states and 27780 transitions. [2025-03-16 15:02:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 15:02:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:34,812 INFO L225 Difference]: With dead ends: 20423 [2025-03-16 15:02:34,812 INFO L226 Difference]: Without dead ends: 13768 [2025-03-16 15:02:34,820 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 15:02:34,822 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 805 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:34,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2025-03-16 15:02:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 12961. [2025-03-16 15:02:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.2383487654320988) internal successors, (16049), 12960 states have internal predecessors, (16049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16049 transitions. [2025-03-16 15:02:35,047 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16049 transitions. Word has length 126 [2025-03-16 15:02:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:35,048 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16049 transitions. [2025-03-16 15:02:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16049 transitions. [2025-03-16 15:02:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 15:02:35,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:35,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:02:35,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:35,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash 70726579, now seen corresponding path program 1 times [2025-03-16 15:02:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133930384] [2025-03-16 15:02:35,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:35,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 15:02:35,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 15:02:35,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:35,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133930384] [2025-03-16 15:02:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133930384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305739640] [2025-03-16 15:02:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:35,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:35,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:35,379 INFO L87 Difference]: Start difference. First operand 12961 states and 16049 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:38,113 INFO L93 Difference]: Finished difference Result 25134 states and 31300 transitions. [2025-03-16 15:02:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 15:02:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:38,131 INFO L225 Difference]: With dead ends: 25134 [2025-03-16 15:02:38,132 INFO L226 Difference]: Without dead ends: 12961 [2025-03-16 15:02:38,139 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 15:02:38,140 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:38,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1211 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2025-03-16 15:02:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2025-03-16 15:02:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.237962962962963) internal successors, (16044), 12960 states have internal predecessors, (16044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16044 transitions. [2025-03-16 15:02:38,255 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16044 transitions. Word has length 142 [2025-03-16 15:02:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:38,255 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16044 transitions. [2025-03-16 15:02:38,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16044 transitions. [2025-03-16 15:02:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 15:02:38,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:38,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:38,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:02:38,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1710732499, now seen corresponding path program 1 times [2025-03-16 15:02:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736899331] [2025-03-16 15:02:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:38,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 15:02:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 15:02:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736899331] [2025-03-16 15:02:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736899331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064640079] [2025-03-16 15:02:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:38,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:38,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:38,339 INFO L87 Difference]: Start difference. First operand 12961 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:41,164 INFO L93 Difference]: Finished difference Result 31447 states and 39969 transitions. [2025-03-16 15:02:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-16 15:02:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:41,191 INFO L225 Difference]: With dead ends: 31447 [2025-03-16 15:02:41,192 INFO L226 Difference]: Without dead ends: 19274 [2025-03-16 15:02:41,202 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 15:02:41,203 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 908 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:41,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 956 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:02:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-03-16 15:02:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 18477. [2025-03-16 15:02:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18477 states, 18476 states have (on average 1.2248322147651007) internal successors, (22630), 18476 states have internal predecessors, (22630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18477 states to 18477 states and 22630 transitions. [2025-03-16 15:02:41,480 INFO L78 Accepts]: Start accepts. Automaton has 18477 states and 22630 transitions. Word has length 149 [2025-03-16 15:02:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 18477 states and 22630 transitions. [2025-03-16 15:02:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18477 states and 22630 transitions. [2025-03-16 15:02:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 15:02:41,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:41,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:41,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:02:41,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:41,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1089243522, now seen corresponding path program 1 times [2025-03-16 15:02:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512785511] [2025-03-16 15:02:41,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 15:02:41,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 15:02:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:41,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:02:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512785511] [2025-03-16 15:02:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512785511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097728419] [2025-03-16 15:02:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:41,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:41,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:41,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:41,684 INFO L87 Difference]: Start difference. First operand 18477 states and 22630 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:44,600 INFO L93 Difference]: Finished difference Result 42486 states and 53152 transitions. [2025-03-16 15:02:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 238 [2025-03-16 15:02:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:44,628 INFO L225 Difference]: With dead ends: 42486 [2025-03-16 15:02:44,629 INFO L226 Difference]: Without dead ends: 24797 [2025-03-16 15:02:44,640 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 15:02:44,641 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 995 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 795 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:02:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2025-03-16 15:02:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 24785. [2025-03-16 15:02:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24785 states, 24784 states have (on average 1.2302695287282117) internal successors, (30491), 24784 states have internal predecessors, (30491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24785 states to 24785 states and 30491 transitions. [2025-03-16 15:02:44,983 INFO L78 Accepts]: Start accepts. Automaton has 24785 states and 30491 transitions. Word has length 238 [2025-03-16 15:02:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:44,984 INFO L471 AbstractCegarLoop]: Abstraction has 24785 states and 30491 transitions. [2025-03-16 15:02:44,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24785 states and 30491 transitions. [2025-03-16 15:02:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-16 15:02:44,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:44,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:02:44,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -261429770, now seen corresponding path program 1 times [2025-03-16 15:02:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227466722] [2025-03-16 15:02:44,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:44,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:45,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-16 15:02:45,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-16 15:02:45,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:45,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227466722] [2025-03-16 15:02:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227466722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197893243] [2025-03-16 15:02:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:45,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:45,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:45,293 INFO L87 Difference]: Start difference. First operand 24785 states and 30491 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:48,050 INFO L93 Difference]: Finished difference Result 49596 states and 61039 transitions. [2025-03-16 15:02:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 315 [2025-03-16 15:02:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:48,076 INFO L225 Difference]: With dead ends: 49596 [2025-03-16 15:02:48,076 INFO L226 Difference]: Without dead ends: 25599 [2025-03-16 15:02:48,089 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 15:02:48,089 INFO L435 NwaCegarLoop]: 1798 mSDtfsCounter, 722 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:48,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1940 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25599 states. [2025-03-16 15:02:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25599 to 25573. [2025-03-16 15:02:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25573 states, 25572 states have (on average 1.2079227279837321) internal successors, (30889), 25572 states have internal predecessors, (30889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25573 states to 25573 states and 30889 transitions. [2025-03-16 15:02:48,311 INFO L78 Accepts]: Start accepts. Automaton has 25573 states and 30889 transitions. Word has length 315 [2025-03-16 15:02:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 25573 states and 30889 transitions. [2025-03-16 15:02:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25573 states and 30889 transitions. [2025-03-16 15:02:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-16 15:02:48,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:48,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:02:48,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:48,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1374059564, now seen corresponding path program 1 times [2025-03-16 15:02:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187883873] [2025-03-16 15:02:48,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:48,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-16 15:02:48,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-16 15:02:48,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:48,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-16 15:02:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187883873] [2025-03-16 15:02:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187883873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041965067] [2025-03-16 15:02:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:48,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:48,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:48,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:48,598 INFO L87 Difference]: Start difference. First operand 25573 states and 30889 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:53,919 INFO L93 Difference]: Finished difference Result 75755 states and 92427 transitions. [2025-03-16 15:02:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 341 [2025-03-16 15:02:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:53,974 INFO L225 Difference]: With dead ends: 75755 [2025-03-16 15:02:53,974 INFO L226 Difference]: Without dead ends: 50970 [2025-03-16 15:02:53,987 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 15:02:53,988 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1718 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 6388 mSolverCounterSat, 1037 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 7425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Valid, 6388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:53,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 1090 Invalid, 7425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1037 Valid, 6388 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:02:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50970 states. [2025-03-16 15:02:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50970 to 50846. [2025-03-16 15:02:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50846 states, 50845 states have (on average 1.1909135608221064) internal successors, (60552), 50845 states have internal predecessors, (60552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50846 states to 50846 states and 60552 transitions. [2025-03-16 15:02:54,471 INFO L78 Accepts]: Start accepts. Automaton has 50846 states and 60552 transitions. Word has length 341 [2025-03-16 15:02:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:54,472 INFO L471 AbstractCegarLoop]: Abstraction has 50846 states and 60552 transitions. [2025-03-16 15:02:54,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50846 states and 60552 transitions. [2025-03-16 15:02:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 15:02:54,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:54,475 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:02:54,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:54,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1334580941, now seen corresponding path program 1 times [2025-03-16 15:02:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038211181] [2025-03-16 15:02:54,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:54,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 15:02:54,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 15:02:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038211181] [2025-03-16 15:02:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038211181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510332895] [2025-03-16 15:02:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:54,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:54,755 INFO L87 Difference]: Start difference. First operand 50846 states and 60552 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:58,851 INFO L93 Difference]: Finished difference Result 122942 states and 144329 transitions. [2025-03-16 15:02:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2025-03-16 15:02:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:58,927 INFO L225 Difference]: With dead ends: 122942 [2025-03-16 15:02:58,927 INFO L226 Difference]: Without dead ends: 61860 [2025-03-16 15:02:58,965 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 15:02:58,965 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 1469 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 5078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:58,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1161 Invalid, 5078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 15:02:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61860 states. [2025-03-16 15:02:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61860 to 61071. [2025-03-16 15:02:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61071 states, 61070 states have (on average 1.1513345341411494) internal successors, (70312), 61070 states have internal predecessors, (70312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61071 states to 61071 states and 70312 transitions. [2025-03-16 15:02:59,554 INFO L78 Accepts]: Start accepts. Automaton has 61071 states and 70312 transitions. Word has length 344 [2025-03-16 15:02:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:59,555 INFO L471 AbstractCegarLoop]: Abstraction has 61071 states and 70312 transitions. [2025-03-16 15:02:59,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 61071 states and 70312 transitions. [2025-03-16 15:02:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-16 15:02:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:59,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:02:59,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -742979003, now seen corresponding path program 1 times [2025-03-16 15:02:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318295234] [2025-03-16 15:02:59,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:59,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-16 15:02:59,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-16 15:02:59,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:59,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:59,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:59,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318295234] [2025-03-16 15:02:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318295234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:59,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27644504] [2025-03-16 15:02:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:59,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:59,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:59,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:59,716 INFO L87 Difference]: Start difference. First operand 61071 states and 70312 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:02,861 INFO L93 Difference]: Finished difference Result 132356 states and 154298 transitions. [2025-03-16 15:03:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 369 [2025-03-16 15:03:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:02,947 INFO L225 Difference]: With dead ends: 132356 [2025-03-16 15:03:02,947 INFO L226 Difference]: Without dead ends: 72073 [2025-03-16 15:03:02,980 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 15:03:02,981 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 1112 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:02,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1515 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:03:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72073 states. [2025-03-16 15:03:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72073 to 72072. [2025-03-16 15:03:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72072 states, 72071 states have (on average 1.134200996239819) internal successors, (81743), 72071 states have internal predecessors, (81743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72072 states to 72072 states and 81743 transitions. [2025-03-16 15:03:03,761 INFO L78 Accepts]: Start accepts. Automaton has 72072 states and 81743 transitions. Word has length 369 [2025-03-16 15:03:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:03,762 INFO L471 AbstractCegarLoop]: Abstraction has 72072 states and 81743 transitions. [2025-03-16 15:03:03,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 72072 states and 81743 transitions. [2025-03-16 15:03:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 15:03:03,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:03,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:03,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:03:03,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:03,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -503066779, now seen corresponding path program 1 times [2025-03-16 15:03:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434877728] [2025-03-16 15:03:03,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 15:03:03,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 15:03:03,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:03,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:03:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434877728] [2025-03-16 15:03:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434877728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894803915] [2025-03-16 15:03:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:04,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:04,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:04,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:04,163 INFO L87 Difference]: Start difference. First operand 72072 states and 81743 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:07,252 INFO L93 Difference]: Finished difference Result 143376 states and 162727 transitions. [2025-03-16 15:03:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:07,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 404 [2025-03-16 15:03:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:07,364 INFO L225 Difference]: With dead ends: 143376 [2025-03-16 15:03:07,364 INFO L226 Difference]: Without dead ends: 72092 [2025-03-16 15:03:07,400 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 15:03:07,400 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 706 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:07,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1868 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:03:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72092 states. [2025-03-16 15:03:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72092 to 72070. [2025-03-16 15:03:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72070 states, 72069 states have (on average 1.108493249524761) internal successors, (79888), 72069 states have internal predecessors, (79888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72070 states to 72070 states and 79888 transitions. [2025-03-16 15:03:08,283 INFO L78 Accepts]: Start accepts. Automaton has 72070 states and 79888 transitions. Word has length 404 [2025-03-16 15:03:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:08,289 INFO L471 AbstractCegarLoop]: Abstraction has 72070 states and 79888 transitions. [2025-03-16 15:03:08,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 72070 states and 79888 transitions. [2025-03-16 15:03:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-16 15:03:08,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:08,298 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:03:08,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2082563663, now seen corresponding path program 1 times [2025-03-16 15:03:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962095442] [2025-03-16 15:03:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-16 15:03:08,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-16 15:03:08,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:08,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:03:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962095442] [2025-03-16 15:03:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962095442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958815553] [2025-03-16 15:03:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:08,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:08,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:08,841 INFO L87 Difference]: Start difference. First operand 72070 states and 79888 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:11,726 INFO L93 Difference]: Finished difference Result 157510 states and 175915 transitions. [2025-03-16 15:03:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 499 [2025-03-16 15:03:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:11,828 INFO L225 Difference]: With dead ends: 157510 [2025-03-16 15:03:11,828 INFO L226 Difference]: Without dead ends: 86228 [2025-03-16 15:03:11,854 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 15:03:11,854 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 817 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:11,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1759 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:03:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86228 states. [2025-03-16 15:03:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86228 to 86211. [2025-03-16 15:03:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86211 states, 86210 states have (on average 1.0860689015195453) internal successors, (93630), 86210 states have internal predecessors, (93630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86211 states to 86211 states and 93630 transitions. [2025-03-16 15:03:12,575 INFO L78 Accepts]: Start accepts. Automaton has 86211 states and 93630 transitions. Word has length 499 [2025-03-16 15:03:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:12,576 INFO L471 AbstractCegarLoop]: Abstraction has 86211 states and 93630 transitions. [2025-03-16 15:03:12,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 86211 states and 93630 transitions. [2025-03-16 15:03:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-16 15:03:12,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:12,585 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:12,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:03:12,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:12,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 52544105, now seen corresponding path program 1 times [2025-03-16 15:03:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511098514] [2025-03-16 15:03:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:12,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-16 15:03:12,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-16 15:03:12,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:12,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-16 15:03:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:12,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511098514] [2025-03-16 15:03:12,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511098514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:12,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:03:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089250575] [2025-03-16 15:03:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:12,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:03:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:12,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:03:12,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:12,958 INFO L87 Difference]: Start difference. First operand 86211 states and 93630 transitions. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:18,760 INFO L93 Difference]: Finished difference Result 245066 states and 267107 transitions. [2025-03-16 15:03:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:03:18,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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 535 [2025-03-16 15:03:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:18,939 INFO L225 Difference]: With dead ends: 245066 [2025-03-16 15:03:18,939 INFO L226 Difference]: Without dead ends: 159643 [2025-03-16 15:03:18,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:18,981 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1721 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 6319 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 6319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:18,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 922 Invalid, 7354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 6319 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:03:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159643 states. [2025-03-16 15:03:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159643 to 131900. [2025-03-16 15:03:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131900 states, 131899 states have (on average 1.0807815070622218) internal successors, (142554), 131899 states have internal predecessors, (142554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131900 states to 131900 states and 142554 transitions. [2025-03-16 15:03:20,699 INFO L78 Accepts]: Start accepts. Automaton has 131900 states and 142554 transitions. Word has length 535 [2025-03-16 15:03:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:20,700 INFO L471 AbstractCegarLoop]: Abstraction has 131900 states and 142554 transitions. [2025-03-16 15:03:20,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 131900 states and 142554 transitions. [2025-03-16 15:03:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-16 15:03:20,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:20,709 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:03:20,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:03:20,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:20,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1749489679, now seen corresponding path program 1 times [2025-03-16 15:03:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:20,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593678834] [2025-03-16 15:03:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:20,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-16 15:03:20,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-16 15:03:20,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:20,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 75 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-16 15:03:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593678834] [2025-03-16 15:03:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593678834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:03:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264477613] [2025-03-16 15:03:21,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:21,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:21,477 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 15:03:21,479 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 15:03:21,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-16 15:03:21,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-16 15:03:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:21,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:03:21,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:03:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-03-16 15:03:21,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:03:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264477613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:21,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:03:21,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:03:21,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610263279] [2025-03-16 15:03:21,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:21,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:21,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:03:21,944 INFO L87 Difference]: Start difference. First operand 131900 states and 142554 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:26,001 INFO L93 Difference]: Finished difference Result 339534 states and 367612 transitions. [2025-03-16 15:03:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 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 546 [2025-03-16 15:03:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:26,267 INFO L225 Difference]: With dead ends: 339534 [2025-03-16 15:03:26,267 INFO L226 Difference]: Without dead ends: 208422 [2025-03-16 15:03:26,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 545 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 15:03:26,352 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1025 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:26,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 964 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 15:03:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208422 states. [2025-03-16 15:03:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208422 to 205235. [2025-03-16 15:03:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205235 states, 205234 states have (on average 1.0682148182075095) internal successors, (219234), 205234 states have internal predecessors, (219234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205235 states to 205235 states and 219234 transitions. [2025-03-16 15:03:28,703 INFO L78 Accepts]: Start accepts. Automaton has 205235 states and 219234 transitions. Word has length 546 [2025-03-16 15:03:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:28,704 INFO L471 AbstractCegarLoop]: Abstraction has 205235 states and 219234 transitions. [2025-03-16 15:03:28,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 205235 states and 219234 transitions. [2025-03-16 15:03:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-16 15:03:28,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:28,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:03:28,727 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 15:03:28,921 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,SelfDestructingSolverStorable16 [2025-03-16 15:03:28,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 175206188, now seen corresponding path program 1 times [2025-03-16 15:03:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287511221] [2025-03-16 15:03:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:28,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-16 15:03:29,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-16 15:03:29,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:29,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-16 15:03:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287511221] [2025-03-16 15:03:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287511221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328047654] [2025-03-16 15:03:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:29,726 INFO L87 Difference]: Start difference. First operand 205235 states and 219234 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:33,373 INFO L93 Difference]: Finished difference Result 494677 states and 528771 transitions. [2025-03-16 15:03:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 608 [2025-03-16 15:03:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:33,758 INFO L225 Difference]: With dead ends: 494677 [2025-03-16 15:03:33,758 INFO L226 Difference]: Without dead ends: 290230 [2025-03-16 15:03:33,817 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 15:03:33,817 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 952 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:33,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 563 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:03:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290230 states.