./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label18.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 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:54:25,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:54:25,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:54:25,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:54:25,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:54:25,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:54:25,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:54:25,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:54:25,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:54:25,351 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:54:25,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:54:25,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:54:25,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:54:25,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:54:25,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:54:25,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:54:25,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:54:25,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:54:25,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:54:25,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:54:25,354 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 -> 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 [2025-03-16 14:54:25,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:54:25,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:54:25,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:54:25,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:54:25,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:54:25,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2025-03-16 14:54:26,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f6ecf12/daaf8b48395946068696bff4a65a0583/FLAG6dcf41b5b [2025-03-16 14:54:27,093 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:54:27,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2025-03-16 14:54:27,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f6ecf12/daaf8b48395946068696bff4a65a0583/FLAG6dcf41b5b [2025-03-16 14:54:27,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f6ecf12/daaf8b48395946068696bff4a65a0583 [2025-03-16 14:54:27,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:54:27,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:54:27,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:54:27,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:54:27,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:54:27,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:54:27" (1/1) ... [2025-03-16 14:54:27,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bd1adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:27, skipping insertion in model container [2025-03-16 14:54:27,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:54:27" (1/1) ... [2025-03-16 14:54:27,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:54:27,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c[6604,6617] [2025-03-16 14:54:27,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:54:27,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:54:27,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c[6604,6617] [2025-03-16 14:54:28,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:54:28,149 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:54:28,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28 WrapperNode [2025-03-16 14:54:28,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:54:28,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:54:28,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:54:28,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:54:28,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,468 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:54:28,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:54:28,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:54:28,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:54:28,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:54:28,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,611 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:54:28,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:54:28,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:54:28,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:54:28,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:54:28,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (1/1) ... [2025-03-16 14:54:28,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:54:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:54:28,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:54:28,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:54:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:54:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:54:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:54:28,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:54:28,876 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:54:28,877 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:54:32,099 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:54:32,099 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:54:32,099 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:54:32,269 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:54:32,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:54:32,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:54:32,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:54:32,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:54:32 BoogieIcfgContainer [2025-03-16 14:54:32,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:54:32,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:54:32,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:54:32,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:54:32,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:54:27" (1/3) ... [2025-03-16 14:54:32,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f03e680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:54:32, skipping insertion in model container [2025-03-16 14:54:32,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:54:28" (2/3) ... [2025-03-16 14:54:32,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f03e680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:54:32, skipping insertion in model container [2025-03-16 14:54:32,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:54:32" (3/3) ... [2025-03-16 14:54:32,314 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label18.c [2025-03-16 14:54:32,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:54:32,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label18.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:54:32,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:54:32,397 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;@392fa6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:54:32,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:54:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 14:54:32,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:32,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:32,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:32,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1725794262, now seen corresponding path program 1 times [2025-03-16 14:54:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963653259] [2025-03-16 14:54:32,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:32,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 14:54:32,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 14:54:32,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:32,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963653259] [2025-03-16 14:54:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963653259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:32,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:32,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:54:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961711980] [2025-03-16 14:54:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:54:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:32,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:54:32,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:54:32,570 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:32,634 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:54:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:54:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 14:54:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:32,645 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:54:32,645 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:54:32,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:54:32,650 INFO L435 NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:32,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:54:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:54:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:54:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:54:32,717 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 52 [2025-03-16 14:54:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:32,718 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:54:32,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:54:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 14:54:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:32,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:54:32,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -302156533, now seen corresponding path program 1 times [2025-03-16 14:54:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966696596] [2025-03-16 14:54:32,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:32,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 14:54:32,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 14:54:32,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:32,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966696596] [2025-03-16 14:54:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966696596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923448903] [2025-03-16 14:54:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:33,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:33,061 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:37,784 INFO L93 Difference]: Finished difference Result 3009 states and 5747 transitions. [2025-03-16 14:54:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 14:54:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:37,797 INFO L225 Difference]: With dead ends: 3009 [2025-03-16 14:54:37,797 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 14:54:37,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:37,802 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 2205 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:37,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 692 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 14:54:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 14:54:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2025-03-16 14:54:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5751662971175167) internal successors, (3552), 2255 states have internal predecessors, (3552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3552 transitions. [2025-03-16 14:54:37,889 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3552 transitions. Word has length 52 [2025-03-16 14:54:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:37,889 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3552 transitions. [2025-03-16 14:54:37,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3552 transitions. [2025-03-16 14:54:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 14:54:37,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:37,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:54:37,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1679522309, now seen corresponding path program 1 times [2025-03-16 14:54:37,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:37,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897091766] [2025-03-16 14:54:37,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:37,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 14:54:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 14:54:37,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:37,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897091766] [2025-03-16 14:54:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897091766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:38,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909829706] [2025-03-16 14:54:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:38,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:38,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:38,208 INFO L87 Difference]: Start difference. First operand 2256 states and 3552 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:41,173 INFO L93 Difference]: Finished difference Result 6050 states and 9915 transitions. [2025-03-16 14:54:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:41,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-16 14:54:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:41,187 INFO L225 Difference]: With dead ends: 6050 [2025-03-16 14:54:41,188 INFO L226 Difference]: Without dead ends: 3758 [2025-03-16 14:54:41,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:41,190 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 688 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:41,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 690 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 14:54:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2025-03-16 14:54:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3007. [2025-03-16 14:54:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4321357285429142) internal successors, (4305), 3006 states have internal predecessors, (4305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4305 transitions. [2025-03-16 14:54:41,237 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4305 transitions. Word has length 123 [2025-03-16 14:54:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4305 transitions. [2025-03-16 14:54:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4305 transitions. [2025-03-16 14:54:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 14:54:41,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:41,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:41,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:54:41,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:41,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2068723401, now seen corresponding path program 1 times [2025-03-16 14:54:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518829499] [2025-03-16 14:54:41,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:41,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 14:54:41,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 14:54:41,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:41,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:54:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518829499] [2025-03-16 14:54:41,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518829499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:54:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975824770] [2025-03-16 14:54:41,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:41,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:54:41,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:54:41,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:54:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:54:41,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 14:54:41,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 14:54:41,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:41,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:54:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:54:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:54:42,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:54:42,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975824770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:54:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:54:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763300066] [2025-03-16 14:54:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:42,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:42,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:42,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:42,018 INFO L87 Difference]: Start difference. First operand 3007 states and 4305 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:43,962 INFO L93 Difference]: Finished difference Result 8266 states and 11518 transitions. [2025-03-16 14:54:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 262 [2025-03-16 14:54:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:43,973 INFO L225 Difference]: With dead ends: 8266 [2025-03-16 14:54:43,973 INFO L226 Difference]: Without dead ends: 5260 [2025-03-16 14:54:43,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:43,976 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:43,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 426 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2025-03-16 14:54:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2025-03-16 14:54:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.1983266780756798) internal successors, (6302), 5259 states have internal predecessors, (6302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 6302 transitions. [2025-03-16 14:54:44,038 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 6302 transitions. Word has length 262 [2025-03-16 14:54:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 5260 states and 6302 transitions. [2025-03-16 14:54:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 6302 transitions. [2025-03-16 14:54:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 14:54:44,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:44,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:44,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:54:44,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:54:44,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:44,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -176602980, now seen corresponding path program 1 times [2025-03-16 14:54:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191026225] [2025-03-16 14:54:44,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:44,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 14:54:44,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 14:54:44,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:44,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:54:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191026225] [2025-03-16 14:54:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191026225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129632896] [2025-03-16 14:54:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:44,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:54:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:44,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:54:44,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:44,508 INFO L87 Difference]: Start difference. First operand 5260 states and 6302 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:47,022 INFO L93 Difference]: Finished difference Result 12060 states and 15067 transitions. [2025-03-16 14:54:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:47,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 264 [2025-03-16 14:54:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:47,037 INFO L225 Difference]: With dead ends: 12060 [2025-03-16 14:54:47,037 INFO L226 Difference]: Without dead ends: 7515 [2025-03-16 14:54:47,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:54:47,042 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 775 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:47,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 325 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:54:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2025-03-16 14:54:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 7513. [2025-03-16 14:54:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7512 states have (on average 1.1813099041533546) internal successors, (8874), 7512 states have internal predecessors, (8874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 8874 transitions. [2025-03-16 14:54:47,128 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 8874 transitions. Word has length 264 [2025-03-16 14:54:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 7513 states and 8874 transitions. [2025-03-16 14:54:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 8874 transitions. [2025-03-16 14:54:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-16 14:54:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:47,134 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:47,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:54:47,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:47,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash -843145135, now seen corresponding path program 1 times [2025-03-16 14:54:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859072463] [2025-03-16 14:54:47,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-16 14:54:47,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-16 14:54:47,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:47,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 152 proven. 108 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-16 14:54:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859072463] [2025-03-16 14:54:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859072463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:54:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427674295] [2025-03-16 14:54:47,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:47,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:54:47,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:54:47,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:54:47,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:54:47,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-16 14:54:47,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-16 14:54:47,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:47,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:47,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:54:47,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:54:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:54:47,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:54:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427674295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:54:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:54:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525721474] [2025-03-16 14:54:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:47,708 INFO L87 Difference]: Start difference. First operand 7513 states and 8874 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:49,656 INFO L93 Difference]: Finished difference Result 16527 states and 20145 transitions. [2025-03-16 14:54:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:49,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2025-03-16 14:54:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:49,679 INFO L225 Difference]: With dead ends: 16527 [2025-03-16 14:54:49,679 INFO L226 Difference]: Without dead ends: 9766 [2025-03-16 14:54:49,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:49,685 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 788 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:49,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 234 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2025-03-16 14:54:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2025-03-16 14:54:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.1859703020993344) internal successors, (11581), 9765 states have internal predecessors, (11581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 11581 transitions. [2025-03-16 14:54:49,796 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 11581 transitions. Word has length 341 [2025-03-16 14:54:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:49,796 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 11581 transitions. [2025-03-16 14:54:49,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 11581 transitions. [2025-03-16 14:54:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-16 14:54:49,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:49,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:49,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:54:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 14:54:50,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1759382322, now seen corresponding path program 1 times [2025-03-16 14:54:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482657927] [2025-03-16 14:54:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:50,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-16 14:54:50,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-16 14:54:50,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:50,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 14:54:50,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:50,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482657927] [2025-03-16 14:54:50,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482657927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752394251] [2025-03-16 14:54:50,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:50,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:50,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:50,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:50,256 INFO L87 Difference]: Start difference. First operand 9766 states and 11581 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:52,604 INFO L93 Difference]: Finished difference Result 27041 states and 32468 transitions. [2025-03-16 14:54:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 379 [2025-03-16 14:54:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:52,639 INFO L225 Difference]: With dead ends: 27041 [2025-03-16 14:54:52,639 INFO L226 Difference]: Without dead ends: 18027 [2025-03-16 14:54:52,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:52,651 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 635 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:52,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1264 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2025-03-16 14:54:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 16525. [2025-03-16 14:54:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.1817961752602275) internal successors, (19528), 16524 states have internal predecessors, (19528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19528 transitions. [2025-03-16 14:54:52,891 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19528 transitions. Word has length 379 [2025-03-16 14:54:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:52,893 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19528 transitions. [2025-03-16 14:54:52,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19528 transitions. [2025-03-16 14:54:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-16 14:54:52,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:52,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:52,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:54:52,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash -173013954, now seen corresponding path program 1 times [2025-03-16 14:54:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681347419] [2025-03-16 14:54:52,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:52,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-16 14:54:52,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-16 14:54:52,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:52,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 14:54:53,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:53,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681347419] [2025-03-16 14:54:53,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681347419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:53,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:53,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634536911] [2025-03-16 14:54:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:53,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:53,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:53,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:53,152 INFO L87 Difference]: Start difference. First operand 16525 states and 19528 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:55,414 INFO L93 Difference]: Finished difference Result 45065 states and 53945 transitions. [2025-03-16 14:54:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 380 [2025-03-16 14:54:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:55,463 INFO L225 Difference]: With dead ends: 45065 [2025-03-16 14:54:55,463 INFO L226 Difference]: Without dead ends: 29292 [2025-03-16 14:54:55,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:55,482 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 721 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:55,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1343 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:54:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29292 states. [2025-03-16 14:54:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29292 to 27790. [2025-03-16 14:54:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27790 states, 27789 states have (on average 1.1431141818705244) internal successors, (31766), 27789 states have internal predecessors, (31766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27790 states to 27790 states and 31766 transitions. [2025-03-16 14:54:55,817 INFO L78 Accepts]: Start accepts. Automaton has 27790 states and 31766 transitions. Word has length 380 [2025-03-16 14:54:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:55,818 INFO L471 AbstractCegarLoop]: Abstraction has 27790 states and 31766 transitions. [2025-03-16 14:54:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27790 states and 31766 transitions. [2025-03-16 14:54:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-16 14:54:55,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:55,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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:55,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:54:55,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:55,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 63849980, now seen corresponding path program 1 times [2025-03-16 14:54:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847031302] [2025-03-16 14:54:55,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:55,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 14:54:55,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 14:54:55,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:55,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 336 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:54:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847031302] [2025-03-16 14:54:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847031302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:54:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655605328] [2025-03-16 14:54:56,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:54:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:54:56,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:54:56,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:54:56,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 14:54:56,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 14:54:56,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:56,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:54:56,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:54:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 238 proven. 51 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 14:54:56,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:54:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:54:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655605328] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:54:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:54:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-03-16 14:54:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76507708] [2025-03-16 14:54:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:56,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:54:56,936 INFO L87 Difference]: Start difference. First operand 27790 states and 31766 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:59,308 INFO L93 Difference]: Finished difference Result 75856 states and 87543 transitions. [2025-03-16 14:54:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:59,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2025-03-16 14:54:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:59,371 INFO L225 Difference]: With dead ends: 75856 [2025-03-16 14:54:59,372 INFO L226 Difference]: Without dead ends: 48818 [2025-03-16 14:54:59,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:54:59,392 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 713 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:59,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1289 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48818 states. [2025-03-16 14:54:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48818 to 45814. [2025-03-16 14:54:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45814 states, 45813 states have (on average 1.117433916137341) internal successors, (51193), 45813 states have internal predecessors, (51193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45814 states to 45814 states and 51193 transitions. [2025-03-16 14:54:59,784 INFO L78 Accepts]: Start accepts. Automaton has 45814 states and 51193 transitions. Word has length 383 [2025-03-16 14:54:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 45814 states and 51193 transitions. [2025-03-16 14:54:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45814 states and 51193 transitions. [2025-03-16 14:54:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-16 14:54:59,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:59,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:59,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:54:59,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:54:59,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 703416410, now seen corresponding path program 1 times [2025-03-16 14:54:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789754097] [2025-03-16 14:54:59,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:00,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 14:55:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 14:55:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 14:55:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789754097] [2025-03-16 14:55:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789754097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585171635] [2025-03-16 14:55:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:00,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:00,283 INFO L87 Difference]: Start difference. First operand 45814 states and 51193 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:02,615 INFO L93 Difference]: Finished difference Result 103643 states and 117131 transitions. [2025-03-16 14:55:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 412 [2025-03-16 14:55:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:02,691 INFO L225 Difference]: With dead ends: 103643 [2025-03-16 14:55:02,692 INFO L226 Difference]: Without dead ends: 58581 [2025-03-16 14:55:02,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:02,729 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:02,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1268 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58581 states. [2025-03-16 14:55:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58581 to 58581. [2025-03-16 14:55:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58581 states, 58580 states have (on average 1.105223625810857) internal successors, (64744), 58580 states have internal predecessors, (64744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58581 states to 58581 states and 64744 transitions. [2025-03-16 14:55:03,422 INFO L78 Accepts]: Start accepts. Automaton has 58581 states and 64744 transitions. Word has length 412 [2025-03-16 14:55:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 58581 states and 64744 transitions. [2025-03-16 14:55:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 58581 states and 64744 transitions. [2025-03-16 14:55:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-16 14:55:03,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:03,430 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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 14:55:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:55:03,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1097424994, now seen corresponding path program 1 times [2025-03-16 14:55:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173517166] [2025-03-16 14:55:03,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:03,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-16 14:55:03,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-16 14:55:03,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:03,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-16 14:55:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173517166] [2025-03-16 14:55:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173517166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855047316] [2025-03-16 14:55:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:03,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:03,580 INFO L87 Difference]: Start difference. First operand 58581 states and 64744 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:05,735 INFO L93 Difference]: Finished difference Result 120165 states and 132559 transitions. [2025-03-16 14:55:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 463 [2025-03-16 14:55:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:05,798 INFO L225 Difference]: With dead ends: 120165 [2025-03-16 14:55:05,798 INFO L226 Difference]: Without dead ends: 62336 [2025-03-16 14:55:05,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:05,832 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 721 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:05,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 150 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:55:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62336 states. [2025-03-16 14:55:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62336 to 58581. [2025-03-16 14:55:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58581 states, 58580 states have (on average 1.1009047456469785) internal successors, (64491), 58580 states have internal predecessors, (64491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58581 states to 58581 states and 64491 transitions. [2025-03-16 14:55:06,394 INFO L78 Accepts]: Start accepts. Automaton has 58581 states and 64491 transitions. Word has length 463 [2025-03-16 14:55:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:06,394 INFO L471 AbstractCegarLoop]: Abstraction has 58581 states and 64491 transitions. [2025-03-16 14:55:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 58581 states and 64491 transitions. [2025-03-16 14:55:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 14:55:06,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:06,402 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 14:55:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:55:06,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:06,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1935809488, now seen corresponding path program 1 times [2025-03-16 14:55:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517537183] [2025-03-16 14:55:06,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 14:55:06,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 14:55:06,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:06,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-16 14:55:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517537183] [2025-03-16 14:55:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517537183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022709785] [2025-03-16 14:55:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:06,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:06,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:06,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:06,552 INFO L87 Difference]: Start difference. First operand 58581 states and 64491 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:08,488 INFO L93 Difference]: Finished difference Result 117161 states and 128979 transitions. [2025-03-16 14:55:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:08,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 483 [2025-03-16 14:55:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:08,715 INFO L225 Difference]: With dead ends: 117161 [2025-03-16 14:55:08,715 INFO L226 Difference]: Without dead ends: 59332 [2025-03-16 14:55:08,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:08,728 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 793 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:08,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 219 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:55:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59332 states. [2025-03-16 14:55:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59332 to 58581. [2025-03-16 14:55:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58581 states, 58580 states have (on average 1.0823489245476272) internal successors, (63404), 58580 states have internal predecessors, (63404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58581 states to 58581 states and 63404 transitions. [2025-03-16 14:55:09,090 INFO L78 Accepts]: Start accepts. Automaton has 58581 states and 63404 transitions. Word has length 483 [2025-03-16 14:55:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 58581 states and 63404 transitions. [2025-03-16 14:55:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58581 states and 63404 transitions. [2025-03-16 14:55:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-16 14:55:09,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:09,097 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2025-03-16 14:55:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:55:09,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 18942925, now seen corresponding path program 1 times [2025-03-16 14:55:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374352138] [2025-03-16 14:55:09,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-16 14:55:09,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-16 14:55:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-16 14:55:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374352138] [2025-03-16 14:55:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374352138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:09,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:09,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150032968] [2025-03-16 14:55:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:09,240 INFO L87 Difference]: Start difference. First operand 58581 states and 63404 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:11,505 INFO L93 Difference]: Finished difference Result 127675 states and 138538 transitions. [2025-03-16 14:55:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 532 [2025-03-16 14:55:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:11,576 INFO L225 Difference]: With dead ends: 127675 [2025-03-16 14:55:11,576 INFO L226 Difference]: Without dead ends: 69846 [2025-03-16 14:55:11,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:11,616 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 804 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:11,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1149 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:55:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69846 states. [2025-03-16 14:55:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69846 to 69846. [2025-03-16 14:55:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69846 states, 69845 states have (on average 1.078387858830267) internal successors, (75320), 69845 states have internal predecessors, (75320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69846 states to 69846 states and 75320 transitions. [2025-03-16 14:55:12,363 INFO L78 Accepts]: Start accepts. Automaton has 69846 states and 75320 transitions. Word has length 532 [2025-03-16 14:55:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 69846 states and 75320 transitions. [2025-03-16 14:55:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 69846 states and 75320 transitions. [2025-03-16 14:55:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1055 [2025-03-16 14:55:12,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:12,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:12,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:55:12,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:12,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:12,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1967670414, now seen corresponding path program 1 times [2025-03-16 14:55:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048719688] [2025-03-16 14:55:12,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:12,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:12,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1054 statements into 1 equivalence classes. [2025-03-16 14:55:12,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1054 of 1054 statements. [2025-03-16 14:55:12,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:12,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-16 14:55:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048719688] [2025-03-16 14:55:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048719688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:12,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607292884] [2025-03-16 14:55:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:12,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:12,864 INFO L87 Difference]: Start difference. First operand 69846 states and 75320 transitions. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:15,038 INFO L93 Difference]: Finished difference Result 168229 states and 182208 transitions. [2025-03-16 14:55:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:15,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1054 [2025-03-16 14:55:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:15,135 INFO L225 Difference]: With dead ends: 168229 [2025-03-16 14:55:15,135 INFO L226 Difference]: Without dead ends: 99135 [2025-03-16 14:55:15,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:15,174 INFO L435 NwaCegarLoop]: 1096 mSDtfsCounter, 794 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:15,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1102 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:55:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99135 states. [2025-03-16 14:55:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99135 to 89372. [2025-03-16 14:55:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89372 states, 89371 states have (on average 1.0754383412963937) internal successors, (96113), 89371 states have internal predecessors, (96113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89372 states to 89372 states and 96113 transitions. [2025-03-16 14:55:15,878 INFO L78 Accepts]: Start accepts. Automaton has 89372 states and 96113 transitions. Word has length 1054 [2025-03-16 14:55:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:15,878 INFO L471 AbstractCegarLoop]: Abstraction has 89372 states and 96113 transitions. [2025-03-16 14:55:15,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 89372 states and 96113 transitions. [2025-03-16 14:55:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2025-03-16 14:55:15,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:15,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:55:15,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -943048567, now seen corresponding path program 1 times [2025-03-16 14:55:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687631426] [2025-03-16 14:55:15,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1070 statements into 1 equivalence classes. [2025-03-16 14:55:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1070 of 1070 statements. [2025-03-16 14:55:16,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:16,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-16 14:55:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:16,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687631426] [2025-03-16 14:55:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687631426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540069568] [2025-03-16 14:55:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:16,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:16,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:16,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:16,398 INFO L87 Difference]: Start difference. First operand 89372 states and 96113 transitions. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:18,932 INFO L93 Difference]: Finished difference Result 216293 states and 233241 transitions. [2025-03-16 14:55:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 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 1070 [2025-03-16 14:55:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:19,080 INFO L225 Difference]: With dead ends: 216293 [2025-03-16 14:55:19,081 INFO L226 Difference]: Without dead ends: 127673 [2025-03-16 14:55:19,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:19,122 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 671 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:19,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 288 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:55:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127673 states. [2025-03-16 14:55:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127673 to 106645. [2025-03-16 14:55:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106645 states, 106644 states have (on average 1.0825269119687935) internal successors, (115445), 106644 states have internal predecessors, (115445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106645 states to 106645 states and 115445 transitions. [2025-03-16 14:55:20,456 INFO L78 Accepts]: Start accepts. Automaton has 106645 states and 115445 transitions. Word has length 1070 [2025-03-16 14:55:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:20,457 INFO L471 AbstractCegarLoop]: Abstraction has 106645 states and 115445 transitions. [2025-03-16 14:55:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 106645 states and 115445 transitions. [2025-03-16 14:55:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2025-03-16 14:55:20,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:20,521 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:20,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:55:20,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -8338925, now seen corresponding path program 1 times [2025-03-16 14:55:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:20,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008764932] [2025-03-16 14:55:20,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:20,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1071 statements into 1 equivalence classes. [2025-03-16 14:55:20,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-16 14:55:20,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:20,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-16 14:55:21,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:21,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008764932] [2025-03-16 14:55:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008764932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:21,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:55:21,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725419157] [2025-03-16 14:55:21,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:21,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:55:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:21,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:55:21,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:55:21,732 INFO L87 Difference]: Start difference. First operand 106645 states and 115445 transitions. Second operand has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:24,137 INFO L93 Difference]: Finished difference Result 215814 states and 233436 transitions. [2025-03-16 14:55:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:55:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 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 1071 [2025-03-16 14:55:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:24,274 INFO L225 Difference]: With dead ends: 215814 [2025-03-16 14:55:24,274 INFO L226 Difference]: Without dead ends: 106166 [2025-03-16 14:55:24,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:55:24,344 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 2317 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2317 Valid, 1319 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106166 states. [2025-03-16 14:55:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106166 to 102139. [2025-03-16 14:55:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102139 states, 102138 states have (on average 1.0726566018523958) internal successors, (109559), 102138 states have internal predecessors, (109559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102139 states to 102139 states and 109559 transitions. [2025-03-16 14:55:25,298 INFO L78 Accepts]: Start accepts. Automaton has 102139 states and 109559 transitions. Word has length 1071 [2025-03-16 14:55:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:25,299 INFO L471 AbstractCegarLoop]: Abstraction has 102139 states and 109559 transitions. [2025-03-16 14:55:25,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 102139 states and 109559 transitions. [2025-03-16 14:55:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2025-03-16 14:55:25,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:25,336 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:55:25,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:25,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1877680149, now seen corresponding path program 1 times [2025-03-16 14:55:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664927212] [2025-03-16 14:55:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-03-16 14:55:25,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-03-16 14:55:25,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:25,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 875 proven. 63 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-16 14:55:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664927212] [2025-03-16 14:55:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664927212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:55:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734927997] [2025-03-16 14:55:26,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:55:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:55:26,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:55:26,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:55:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-03-16 14:55:26,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-03-16 14:55:26,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:26,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:55:26,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:55:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-16 14:55:26,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:55:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734927997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:26,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:55:26,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:55:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663627538] [2025-03-16 14:55:26,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:26,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:26,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:26,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:26,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:55:26,926 INFO L87 Difference]: Start difference. First operand 102139 states and 109559 transitions. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:29,062 INFO L93 Difference]: Finished difference Result 203526 states and 218361 transitions. [2025-03-16 14:55:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1072 [2025-03-16 14:55:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:29,165 INFO L225 Difference]: With dead ends: 203526 [2025-03-16 14:55:29,165 INFO L226 Difference]: Without dead ends: 102139 [2025-03-16 14:55:29,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1072 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:55:29,193 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 750 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:29,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 963 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 14:55:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102139 states. [2025-03-16 14:55:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102139 to 100637. [2025-03-16 14:55:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100637 states, 100636 states have (on average 1.060664175841647) internal successors, (106741), 100636 states have internal predecessors, (106741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100637 states to 100637 states and 106741 transitions. [2025-03-16 14:55:30,268 INFO L78 Accepts]: Start accepts. Automaton has 100637 states and 106741 transitions. Word has length 1072 [2025-03-16 14:55:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:30,269 INFO L471 AbstractCegarLoop]: Abstraction has 100637 states and 106741 transitions. [2025-03-16 14:55:30,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 100637 states and 106741 transitions. [2025-03-16 14:55:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2025-03-16 14:55:30,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:30,331 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:30,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:55:30,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:55:30,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 435889555, now seen corresponding path program 1 times [2025-03-16 14:55:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368242115] [2025-03-16 14:55:30,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:30,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1172 statements into 1 equivalence classes. [2025-03-16 14:55:30,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1172 of 1172 statements. [2025-03-16 14:55:30,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:30,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2025-03-16 14:55:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368242115] [2025-03-16 14:55:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368242115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:31,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165958103] [2025-03-16 14:55:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:31,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:31,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:31,258 INFO L87 Difference]: Start difference. First operand 100637 states and 106741 transitions. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:33,428 INFO L93 Difference]: Finished difference Result 201273 states and 213477 transitions. [2025-03-16 14:55:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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 1172 [2025-03-16 14:55:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:33,545 INFO L225 Difference]: With dead ends: 201273 [2025-03-16 14:55:33,545 INFO L226 Difference]: Without dead ends: 100637 [2025-03-16 14:55:33,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:33,611 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:33,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 390 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:55:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100637 states. [2025-03-16 14:55:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100637 to 100637. [2025-03-16 14:55:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100637 states, 100636 states have (on average 1.046275686633014) internal successors, (105293), 100636 states have internal predecessors, (105293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100637 states to 100637 states and 105293 transitions. [2025-03-16 14:55:34,874 INFO L78 Accepts]: Start accepts. Automaton has 100637 states and 105293 transitions. Word has length 1172 [2025-03-16 14:55:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 100637 states and 105293 transitions. [2025-03-16 14:55:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 100637 states and 105293 transitions. [2025-03-16 14:55:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1452 [2025-03-16 14:55:34,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:55:34,924 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:55:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:55:34,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:55:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:55:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1731185508, now seen corresponding path program 1 times [2025-03-16 14:55:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:55:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112954188] [2025-03-16 14:55:34,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:55:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:55:34,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1451 statements into 1 equivalence classes. [2025-03-16 14:55:35,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1451 of 1451 statements. [2025-03-16 14:55:35,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:55:35,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:55:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2025-03-16 14:55:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:55:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112954188] [2025-03-16 14:55:35,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112954188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:55:35,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:55:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:55:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10713244] [2025-03-16 14:55:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:55:35,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:55:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:55:35,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:55:35,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:35,601 INFO L87 Difference]: Start difference. First operand 100637 states and 105293 transitions. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:55:38,293 INFO L93 Difference]: Finished difference Result 221548 states and 231703 transitions. [2025-03-16 14:55:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:55:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 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 1451 [2025-03-16 14:55:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:55:38,296 INFO L225 Difference]: With dead ends: 221548 [2025-03-16 14:55:38,296 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:55:38,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:55:38,342 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 729 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:55:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1177 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:55:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:55:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:55:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:55:38,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1451 [2025-03-16 14:55:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:55:38,344 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:55:38,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:55:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:55:38,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:55:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:55:38,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:55:38,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:55:38,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:55:42,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:55:42,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:55:42 BoogieIcfgContainer [2025-03-16 14:55:42,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:55:42,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:55:42,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:55:42,291 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:55:42,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:54:32" (3/4) ... [2025-03-16 14:55:42,294 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:55:42,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-16 14:55:42,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:55:42,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:55:42,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:55:42,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:55:42,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:55:42,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:55:42,565 INFO L158 Benchmark]: Toolchain (without parser) took 75429.41ms. Allocated memory was 142.6MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 90.7MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-16 14:55:42,565 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:55:42,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1014.96ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 90.7MB in the beginning and 63.4MB in the end (delta: 27.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-03-16 14:55:42,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 317.01ms. Allocated memory was 151.0MB in the beginning and 394.3MB in the end (delta: 243.3MB). Free memory was 63.4MB in the beginning and 289.8MB in the end (delta: -226.4MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-03-16 14:55:42,566 INFO L158 Benchmark]: Boogie Preprocessor took 310.84ms. Allocated memory is still 394.3MB. Free memory was 289.8MB in the beginning and 265.3MB in the end (delta: 24.5MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2025-03-16 14:55:42,566 INFO L158 Benchmark]: IcfgBuilder took 3523.68ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 265.3MB in the beginning and 357.5MB in the end (delta: -92.2MB). Peak memory consumption was 311.7MB. Max. memory is 16.1GB. [2025-03-16 14:55:42,567 INFO L158 Benchmark]: TraceAbstraction took 69983.54ms. Allocated memory was 788.5MB in the beginning and 6.0GB in the end (delta: 5.2GB). Free memory was 357.5MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-16 14:55:42,567 INFO L158 Benchmark]: Witness Printer took 273.37ms. Allocated memory is still 6.0GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 54.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 14:55:42,568 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1014.96ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 90.7MB in the beginning and 63.4MB in the end (delta: 27.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 317.01ms. Allocated memory was 151.0MB in the beginning and 394.3MB in the end (delta: 243.3MB). Free memory was 63.4MB in the beginning and 289.8MB in the end (delta: -226.4MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 310.84ms. Allocated memory is still 394.3MB. Free memory was 289.8MB in the beginning and 265.3MB in the end (delta: 24.5MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. * IcfgBuilder took 3523.68ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 265.3MB in the beginning and 357.5MB in the end (delta: -92.2MB). Peak memory consumption was 311.7MB. Max. memory is 16.1GB. * TraceAbstraction took 69983.54ms. Allocated memory was 788.5MB in the beginning and 6.0GB in the end (delta: 5.2GB). Free memory was 357.5MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 273.37ms. Allocated memory is still 6.0GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 54.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 181]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1503 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.0s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 45.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16231 SdHoareTripleChecker+Valid, 38.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16231 mSDsluCounter, 15729 SdHoareTripleChecker+Invalid, 32.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 10747 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47089 IncrementalHoareTripleChecker+Invalid, 57836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10747 mSolverCounterUnsat, 15578 mSDtfsCounter, 47089 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2499 GetRequests, 2463 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106645occurred in iteration=15, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 47587 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 13074 NumberOfCodeBlocks, 13074 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 13433 ConstructedInterpolants, 0 QuantifiedInterpolants, 23383 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2617 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 14164/14509 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4828]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((14 <= a7) && (190 <= a2)) && (a24 <= 13)) || (((a2 <= 170) && (a24 == 14)) && (3 != a5))) || (((5 <= a5) && (256 <= a17)) && (a24 <= 13))) || (((a7 == 12) && (3 == a5)) && (a24 <= 13))) || (((190 <= a2) && (a7 == 12)) && (a24 <= 13))) || ((((a2 <= 170) && (256 <= a17)) && (a5 <= 4)) && (a24 == 15))) || ((((a2 <= 170) && (13 <= a7)) && (((long long) a17 + 124) <= 0)) && (3 == a5))) || (((a7 == 13) && (3 != a5)) && (a24 == 15))) || ((((256 <= a17) && (a5 <= 4)) && (a24 == 15)) && (190 <= a2))) || (((a7 == 13) && (3 == a5)) && (a24 <= 13))) || (((a2 <= 170) && (a24 == 15)) && (5 == a5))) || (((14 <= a7) && (3 != a5)) && (a24 <= 13))) || (((a24 == 14) && (3 != a5)) && (a7 == 12))) || (((5 <= a5) && (a7 == 13)) && (a24 <= 13))) || (((a2 <= 170) && (a7 == 13)) && (a24 == 15))) || (((a7 == 13) && (190 <= a2)) && (a24 <= 13))) || (((a24 == 15) && (190 <= a2)) && (3 == a5))) || (((a2 <= 170) && (14 <= a7)) && (3 == a5))) || (((3 != a5) && (a24 == 15)) && (a7 == 12))) || ((a24 == 14) && (190 <= a2))) || (((5 <= a5) && (a7 == 12)) && (a24 <= 13))) || (((a2 <= 170) && (a5 <= 4)) && (a24 <= 13))) || (((5 == a5) && (190 <= a2)) && (a24 <= 13))) || (((a2 <= 170) && (a24 == 14)) && (256 <= a17))) || ((5 <= a5) && (a24 == 14))) || (((256 <= a17) && (190 <= a2)) && (a24 <= 13))) || (((a2 <= 170) && (a24 == 14)) && (a7 == 12))) || ((14 <= a7) && (a24 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:55:42,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE