./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label08.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/Problem19_label08.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 3deeb63379d54c05d0983698ddc1fa49b6cf4b0b9b3a770af64a435678802fb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:27:56,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:27:56,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:27:56,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:27:56,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:27:56,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:27:56,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:27:56,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:27:56,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:27:56,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:27:56,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:27:56,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:27:56,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:27:56,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:27:56,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:27:56,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:27:56,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:27:56,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:27:56,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:27:56,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:27:56,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:27:56,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:27:56,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:27:56,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:27:56,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:27:56,568 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 -> 3deeb63379d54c05d0983698ddc1fa49b6cf4b0b9b3a770af64a435678802fb9 [2025-03-16 15:27:56,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:27:56,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:27:56,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:27:56,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:27:56,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:27:56,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label08.c [2025-03-16 15:27:57,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c317a387/9fc293b63abd42228ae1466a82c9adac/FLAGd79952b09 [2025-03-16 15:27:58,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:27:58,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label08.c [2025-03-16 15:27:58,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c317a387/9fc293b63abd42228ae1466a82c9adac/FLAGd79952b09 [2025-03-16 15:27:58,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c317a387/9fc293b63abd42228ae1466a82c9adac [2025-03-16 15:27:58,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:27:58,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:27:58,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:27:58,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:27:58,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:27:58,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:27:58" (1/1) ... [2025-03-16 15:27:58,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27362af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:58, skipping insertion in model container [2025-03-16 15:27:58,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:27:58" (1/1) ... [2025-03-16 15:27:58,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:27:58,912 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/Problem19_label08.c[5076,5089] [2025-03-16 15:27:59,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:27:59,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:27:59,614 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/Problem19_label08.c[5076,5089] [2025-03-16 15:28:00,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:28:00,061 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:28:00,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00 WrapperNode [2025-03-16 15:28:00,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:28:00,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:28:00,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:28:00,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:28:00,069 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:28:00" (1/1) ... [2025-03-16 15:28:00,138 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:28:00" (1/1) ... [2025-03-16 15:28:00,654 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:28:00,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:28:00,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:28:00,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:28:00,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:28:00,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:00,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:00,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,078 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:28:01,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:28:01,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:28:01,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:28:01,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:28:01,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (1/1) ... [2025-03-16 15:28:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:28:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:28:01,602 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:28:01,604 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:28:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:28:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:28:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:28:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:28:01,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:28:01,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:28:07,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:28:07,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:28:07,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:28:07,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:28:07,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:28:07,607 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:28:07,607 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:28:07,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:28:07,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:28:07,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:28:07 BoogieIcfgContainer [2025-03-16 15:28:07,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:28:07,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:28:07,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:28:07,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:28:07,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:27:58" (1/3) ... [2025-03-16 15:28:07,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b69298b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:28:07, skipping insertion in model container [2025-03-16 15:28:07,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:28:00" (2/3) ... [2025-03-16 15:28:07,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b69298b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:28:07, skipping insertion in model container [2025-03-16 15:28:07,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:28:07" (3/3) ... [2025-03-16 15:28:07,658 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label08.c [2025-03-16 15:28:07,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:28:07,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label08.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:28:07,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:28:07,758 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;@3ad426fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:28:07,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:28:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have 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:28:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:28:07,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:07,772 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] [2025-03-16 15:28:07,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 289046074, now seen corresponding path program 1 times [2025-03-16 15:28:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173168653] [2025-03-16 15:28:07,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:07,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:28:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:28:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:07,892 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:28:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173168653] [2025-03-16 15:28:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173168653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339460182] [2025-03-16 15:28:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:07,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:28:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:07,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:28:07,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:28:07,915 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:28:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:07,993 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:28:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:28:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 15:28:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:08,015 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:28:08,015 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:28:08,020 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:28:08,022 INFO L435 NwaCegarLoop]: 3141 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, 3141 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:28:08,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:28:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:28:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:28:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have 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:28:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:28:08,107 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 36 [2025-03-16 15:28:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:08,107 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:28:08,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:28:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:28:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:28:08,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:08,108 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] [2025-03-16 15:28:08,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:28:08,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2041216027, now seen corresponding path program 1 times [2025-03-16 15:28:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:08,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438843509] [2025-03-16 15:28:08,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:08,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:28:08,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:28:08,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:08,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:08,340 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:28:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438843509] [2025-03-16 15:28:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438843509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:08,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15087506] [2025-03-16 15:28:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:08,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:08,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:08,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:08,342 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:28:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:12,872 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2025-03-16 15:28:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 15:28:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:12,882 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 15:28:12,882 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 15:28:12,885 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:28:12,885 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1512 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1392 Invalid, 5628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:28:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 15:28:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2025-03-16 15:28:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have 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:28:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2025-03-16 15:28:12,933 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 36 [2025-03-16 15:28:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:12,933 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2025-03-16 15:28:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:28:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2025-03-16 15:28:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:28:12,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:12,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:28:12,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1197564363, now seen corresponding path program 1 times [2025-03-16 15:28:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408559689] [2025-03-16 15:28:12,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:28:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:28:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:28:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:13,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408559689] [2025-03-16 15:28:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408559689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421799607] [2025-03-16 15:28:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:13,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:13,109 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:28:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:17,817 INFO L93 Difference]: Finished difference Result 9096 states and 15083 transitions. [2025-03-16 15:28:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 15:28:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:17,836 INFO L225 Difference]: With dead ends: 9096 [2025-03-16 15:28:17,836 INFO L226 Difference]: Without dead ends: 5992 [2025-03-16 15:28:17,840 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:28:17,842 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:17,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 989 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:28:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-16 15:28:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5990. [2025-03-16 15:28:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5989 states have (on average 1.606278176657205) internal successors, (9620), 5989 states have internal predecessors, (9620), 0 states have call successors, (0), 0 states have 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:28:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9620 transitions. [2025-03-16 15:28:17,927 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9620 transitions. Word has length 105 [2025-03-16 15:28:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:17,929 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9620 transitions. [2025-03-16 15:28:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:28:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9620 transitions. [2025-03-16 15:28:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 15:28:17,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:17,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:28:17,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:17,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 281902385, now seen corresponding path program 1 times [2025-03-16 15:28:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891086742] [2025-03-16 15:28:17,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 15:28:17,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 15:28:17,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:17,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:28:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891086742] [2025-03-16 15:28:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891086742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627503568] [2025-03-16 15:28:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:18,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:18,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:18,118 INFO L87 Difference]: Start difference. First operand 5990 states and 9620 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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:28:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:22,351 INFO L93 Difference]: Finished difference Result 17558 states and 28307 transitions. [2025-03-16 15:28:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-16 15:28:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:22,379 INFO L225 Difference]: With dead ends: 17558 [2025-03-16 15:28:22,379 INFO L226 Difference]: Without dead ends: 11569 [2025-03-16 15:28:22,389 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:28:22,391 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:22,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1731 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:28:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11569 states. [2025-03-16 15:28:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11569 to 11516. [2025-03-16 15:28:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11516 states, 11515 states have (on average 1.4297003907946157) internal successors, (16463), 11515 states have internal predecessors, (16463), 0 states have call successors, (0), 0 states have 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:28:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11516 states to 11516 states and 16463 transitions. [2025-03-16 15:28:22,596 INFO L78 Accepts]: Start accepts. Automaton has 11516 states and 16463 transitions. Word has length 110 [2025-03-16 15:28:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:22,597 INFO L471 AbstractCegarLoop]: Abstraction has 11516 states and 16463 transitions. [2025-03-16 15:28:22,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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:28:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11516 states and 16463 transitions. [2025-03-16 15:28:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 15:28:22,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:22,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:28:22,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 648474501, now seen corresponding path program 1 times [2025-03-16 15:28:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375555198] [2025-03-16 15:28:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:22,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 15:28:22,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 15:28:22,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:22,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:28:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:22,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375555198] [2025-03-16 15:28:22,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375555198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:22,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:22,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533562728] [2025-03-16 15:28:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:22,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:22,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:22,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:22,742 INFO L87 Difference]: Start difference. First operand 11516 states and 16463 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:27,367 INFO L93 Difference]: Finished difference Result 34167 states and 48910 transitions. [2025-03-16 15:28:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:27,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 15:28:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:27,412 INFO L225 Difference]: With dead ends: 34167 [2025-03-16 15:28:27,412 INFO L226 Difference]: Without dead ends: 22652 [2025-03-16 15:28:27,422 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:28:27,423 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:27,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2075 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:28:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2025-03-16 15:28:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 21270. [2025-03-16 15:28:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21270 states, 21269 states have (on average 1.2866613380977008) internal successors, (27366), 21269 states have internal predecessors, (27366), 0 states have call successors, (0), 0 states have 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:28:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21270 states to 21270 states and 27366 transitions. [2025-03-16 15:28:27,641 INFO L78 Accepts]: Start accepts. Automaton has 21270 states and 27366 transitions. Word has length 133 [2025-03-16 15:28:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 21270 states and 27366 transitions. [2025-03-16 15:28:27,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 21270 states and 27366 transitions. [2025-03-16 15:28:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 15:28:27,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:27,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:27,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:28:27,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1640167229, now seen corresponding path program 1 times [2025-03-16 15:28:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054847523] [2025-03-16 15:28:27,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:27,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 15:28:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 15:28:27,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:27,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:28:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054847523] [2025-03-16 15:28:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054847523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700711425] [2025-03-16 15:28:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:27,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:27,804 INFO L87 Difference]: Start difference. First operand 21270 states and 27366 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have 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:28:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:32,360 INFO L93 Difference]: Finished difference Result 63156 states and 81267 transitions. [2025-03-16 15:28:32,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:32,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-16 15:28:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:32,419 INFO L225 Difference]: With dead ends: 63156 [2025-03-16 15:28:32,419 INFO L226 Difference]: Without dead ends: 41887 [2025-03-16 15:28:32,433 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:28:32,433 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:32,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1886 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:28:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41887 states. [2025-03-16 15:28:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41887 to 40472. [2025-03-16 15:28:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40472 states, 40471 states have (on average 1.1933236144399693) internal successors, (48295), 40471 states have internal predecessors, (48295), 0 states have call successors, (0), 0 states have 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:28:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40472 states to 40472 states and 48295 transitions. [2025-03-16 15:28:32,820 INFO L78 Accepts]: Start accepts. Automaton has 40472 states and 48295 transitions. Word has length 174 [2025-03-16 15:28:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:32,820 INFO L471 AbstractCegarLoop]: Abstraction has 40472 states and 48295 transitions. [2025-03-16 15:28:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have 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:28:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40472 states and 48295 transitions. [2025-03-16 15:28:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 15:28:32,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:32,824 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:28:32,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:28:32,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:32,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 916474462, now seen corresponding path program 1 times [2025-03-16 15:28:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729707228] [2025-03-16 15:28:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:32,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 15:28:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 15:28:32,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:32,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 15:28:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729707228] [2025-03-16 15:28:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729707228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:28:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198163469] [2025-03-16 15:28:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:28:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:33,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:28:33,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:28:33,969 INFO L87 Difference]: Start difference. First operand 40472 states and 48295 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:28:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:40,302 INFO L93 Difference]: Finished difference Result 100134 states and 117551 transitions. [2025-03-16 15:28:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:28:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 403 [2025-03-16 15:28:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:40,358 INFO L225 Difference]: With dead ends: 100134 [2025-03-16 15:28:40,358 INFO L226 Difference]: Without dead ends: 59663 [2025-03-16 15:28:40,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:28:40,377 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 3755 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:40,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2157 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-16 15:28:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59663 states. [2025-03-16 15:28:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59663 to 56891. [2025-03-16 15:28:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56891 states, 56890 states have (on average 1.1544735454385657) internal successors, (65678), 56890 states have internal predecessors, (65678), 0 states have call successors, (0), 0 states have 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:28:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56891 states to 56891 states and 65678 transitions. [2025-03-16 15:28:40,813 INFO L78 Accepts]: Start accepts. Automaton has 56891 states and 65678 transitions. Word has length 403 [2025-03-16 15:28:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:40,814 INFO L471 AbstractCegarLoop]: Abstraction has 56891 states and 65678 transitions. [2025-03-16 15:28:40,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:28:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 56891 states and 65678 transitions. [2025-03-16 15:28:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-16 15:28:40,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:40,818 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:40,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:28:40,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1249453068, now seen corresponding path program 1 times [2025-03-16 15:28:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550872692] [2025-03-16 15:28:40,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:40,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-16 15:28:40,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-16 15:28:40,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:40,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 15:28:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550872692] [2025-03-16 15:28:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550872692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:28:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816161593] [2025-03-16 15:28:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:41,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:28:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:41,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:28:41,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:28:41,624 INFO L87 Difference]: Start difference. First operand 56891 states and 65678 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have 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:28:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:46,416 INFO L93 Difference]: Finished difference Result 116542 states and 134134 transitions. [2025-03-16 15:28:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:28:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 431 [2025-03-16 15:28:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:46,485 INFO L225 Difference]: With dead ends: 116542 [2025-03-16 15:28:46,485 INFO L226 Difference]: Without dead ends: 59621 [2025-03-16 15:28:46,512 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:28:46,513 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:46,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2112 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7319 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:28:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59621 states. [2025-03-16 15:28:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59621 to 59621. [2025-03-16 15:28:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59621 states, 59620 states have (on average 1.1474840657497485) internal successors, (68413), 59620 states have internal predecessors, (68413), 0 states have call successors, (0), 0 states have 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:28:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59621 states to 59621 states and 68413 transitions. [2025-03-16 15:28:47,034 INFO L78 Accepts]: Start accepts. Automaton has 59621 states and 68413 transitions. Word has length 431 [2025-03-16 15:28:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:47,035 INFO L471 AbstractCegarLoop]: Abstraction has 59621 states and 68413 transitions. [2025-03-16 15:28:47,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have 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:28:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 59621 states and 68413 transitions. [2025-03-16 15:28:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-16 15:28:47,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:47,045 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:47,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:28:47,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 660996205, now seen corresponding path program 1 times [2025-03-16 15:28:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880664204] [2025-03-16 15:28:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:47,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-16 15:28:47,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-16 15:28:47,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:47,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:28:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880664204] [2025-03-16 15:28:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880664204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:28:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866834498] [2025-03-16 15:28:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:47,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:47,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:47,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:47,483 INFO L87 Difference]: Start difference. First operand 59621 states and 68413 transitions. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have 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:28:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:52,309 INFO L93 Difference]: Finished difference Result 135756 states and 158847 transitions. [2025-03-16 15:28:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:52,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 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 597 [2025-03-16 15:28:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:52,394 INFO L225 Difference]: With dead ends: 135756 [2025-03-16 15:28:52,394 INFO L226 Difference]: Without dead ends: 78866 [2025-03-16 15:28:52,419 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:28:52,419 INFO L435 NwaCegarLoop]: 2830 mSDtfsCounter, 1453 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:52,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3008 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:28:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78866 states. [2025-03-16 15:28:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78866 to 77396. [2025-03-16 15:28:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77396 states, 77395 states have (on average 1.1401511725563667) internal successors, (88242), 77395 states have internal predecessors, (88242), 0 states have call successors, (0), 0 states have 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:28:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77396 states to 77396 states and 88242 transitions. [2025-03-16 15:28:53,144 INFO L78 Accepts]: Start accepts. Automaton has 77396 states and 88242 transitions. Word has length 597 [2025-03-16 15:28:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:53,145 INFO L471 AbstractCegarLoop]: Abstraction has 77396 states and 88242 transitions. [2025-03-16 15:28:53,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have 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:28:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 77396 states and 88242 transitions. [2025-03-16 15:28:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2025-03-16 15:28:53,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:53,149 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:28:53,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:53,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash -527516064, now seen corresponding path program 1 times [2025-03-16 15:28:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:53,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568398110] [2025-03-16 15:28:53,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:53,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-16 15:28:53,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-16 15:28:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 69 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:28:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568398110] [2025-03-16 15:28:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568398110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:28:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143540161] [2025-03-16 15:28:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:54,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:28:54,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:28:54,678 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:28:54,679 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:28:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-16 15:28:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-16 15:28:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:54,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:28:54,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:28:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:28:54,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:28:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143540161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:28:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:28:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440391500] [2025-03-16 15:28:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:54,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:54,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:54,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:28:54,995 INFO L87 Difference]: Start difference. First operand 77396 states and 88242 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:28:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:59,727 INFO L93 Difference]: Finished difference Result 188945 states and 217820 transitions. [2025-03-16 15:28:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 742 [2025-03-16 15:28:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:59,856 INFO L225 Difference]: With dead ends: 188945 [2025-03-16 15:28:59,856 INFO L226 Difference]: Without dead ends: 114280 [2025-03-16 15:28:59,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:28:59,904 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1541 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 6073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:59,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1650 Invalid, 6073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:28:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114280 states. [2025-03-16 15:29:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114280 to 107426. [2025-03-16 15:29:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107426 states, 107425 states have (on average 1.1416336979287875) internal successors, (122640), 107425 states have internal predecessors, (122640), 0 states have call successors, (0), 0 states have 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:29:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107426 states to 107426 states and 122640 transitions. [2025-03-16 15:29:00,816 INFO L78 Accepts]: Start accepts. Automaton has 107426 states and 122640 transitions. Word has length 742 [2025-03-16 15:29:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:00,817 INFO L471 AbstractCegarLoop]: Abstraction has 107426 states and 122640 transitions. [2025-03-16 15:29:00,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:29:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 107426 states and 122640 transitions. [2025-03-16 15:29:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-03-16 15:29:00,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:00,824 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:29:00,830 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:29:01,024 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,SelfDestructingSolverStorable9 [2025-03-16 15:29:01,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 56036059, now seen corresponding path program 1 times [2025-03-16 15:29:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238351647] [2025-03-16 15:29:01,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:01,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-03-16 15:29:01,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-03-16 15:29:01,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:01,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 15:29:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238351647] [2025-03-16 15:29:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238351647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:29:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941188777] [2025-03-16 15:29:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:01,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:01,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:01,608 INFO L87 Difference]: Start difference. First operand 107426 states and 122640 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have 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:29:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:05,898 INFO L93 Difference]: Finished difference Result 239448 states and 273053 transitions. [2025-03-16 15:29:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:05,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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 853 [2025-03-16 15:29:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:06,054 INFO L225 Difference]: With dead ends: 239448 [2025-03-16 15:29:06,054 INFO L226 Difference]: Without dead ends: 134753 [2025-03-16 15:29:06,118 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:29:06,118 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 1385 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1645 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:06,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 780 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1645 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 15:29:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134753 states. [2025-03-16 15:29:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134753 to 134728. [2025-03-16 15:29:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134728 states, 134727 states have (on average 1.10856769615593) internal successors, (149354), 134727 states have internal predecessors, (149354), 0 states have call successors, (0), 0 states have 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:29:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134728 states to 134728 states and 149354 transitions. [2025-03-16 15:29:07,278 INFO L78 Accepts]: Start accepts. Automaton has 134728 states and 149354 transitions. Word has length 853 [2025-03-16 15:29:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:07,279 INFO L471 AbstractCegarLoop]: Abstraction has 134728 states and 149354 transitions. [2025-03-16 15:29:07,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have 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:29:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 134728 states and 149354 transitions. [2025-03-16 15:29:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2025-03-16 15:29:07,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:07,483 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:07,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:29:07,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:07,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash -407835668, now seen corresponding path program 1 times [2025-03-16 15:29:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538788177] [2025-03-16 15:29:07,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:07,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 895 statements into 1 equivalence classes. [2025-03-16 15:29:07,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 895 of 895 statements. [2025-03-16 15:29:07,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:29:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538788177] [2025-03-16 15:29:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538788177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115003950] [2025-03-16 15:29:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:08,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:08,665 INFO L87 Difference]: Start difference. First operand 134728 states and 149354 transitions. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have 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:29:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:13,706 INFO L93 Difference]: Finished difference Result 314634 states and 351935 transitions. [2025-03-16 15:29:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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 895 [2025-03-16 15:29:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:13,911 INFO L225 Difference]: With dead ends: 314634 [2025-03-16 15:29:13,911 INFO L226 Difference]: Without dead ends: 182637 [2025-03-16 15:29:13,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:29:13,991 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1572 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 2289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 6540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2289 IncrementalHoareTripleChecker+Valid, 4251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:13,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 732 Invalid, 6540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2289 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:29:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182637 states. [2025-03-16 15:29:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182637 to 174310. [2025-03-16 15:29:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174310 states, 174309 states have (on average 1.1255758451944535) internal successors, (196198), 174309 states have internal predecessors, (196198), 0 states have call successors, (0), 0 states have 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:29:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174310 states to 174310 states and 196198 transitions. [2025-03-16 15:29:16,299 INFO L78 Accepts]: Start accepts. Automaton has 174310 states and 196198 transitions. Word has length 895 [2025-03-16 15:29:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:16,303 INFO L471 AbstractCegarLoop]: Abstraction has 174310 states and 196198 transitions. [2025-03-16 15:29:16,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have 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:29:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 174310 states and 196198 transitions. [2025-03-16 15:29:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2025-03-16 15:29:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:16,324 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:29:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:29:16,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -674235208, now seen corresponding path program 1 times [2025-03-16 15:29:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465993304] [2025-03-16 15:29:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:16,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1022 statements into 1 equivalence classes. [2025-03-16 15:29:16,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1022 of 1022 statements. [2025-03-16 15:29:16,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:16,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 761 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-16 15:29:16,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465993304] [2025-03-16 15:29:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465993304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:16,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:29:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291036735] [2025-03-16 15:29:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:16,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:29:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:16,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:29:16,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:29:16,882 INFO L87 Difference]: Start difference. First operand 174310 states and 196198 transitions. Second operand has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)