./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:07:51,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:07:51,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:07:51,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:07:51,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:07:51,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:07:51,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:07:51,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:07:51,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:07:51,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:07:51,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:07:51,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:07:51,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:07:51,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:07:51,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:07:51,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:07:51,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:07:51,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:51,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:07:51,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:07:51,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:07:51,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:07:51,307 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 -> 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 [2025-03-16 15:07:51,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:07:51,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:07:51,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:07:51,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:07:51,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:07:51,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2025-03-16 15:07:52,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe05b138b/a1f07f265f22432aa04723119917274f/FLAG806cdd6e9 [2025-03-16 15:07:53,026 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:07:53,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2025-03-16 15:07:53,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe05b138b/a1f07f265f22432aa04723119917274f/FLAG806cdd6e9 [2025-03-16 15:07:53,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe05b138b/a1f07f265f22432aa04723119917274f [2025-03-16 15:07:53,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:07:53,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:07:53,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:53,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:07:53,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:07:53,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:53,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c49cb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53, skipping insertion in model container [2025-03-16 15:07:53,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:53,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:07:53,422 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/Problem15_label08.c[6299,6312] [2025-03-16 15:07:53,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:53,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:07:53,668 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/Problem15_label08.c[6299,6312] [2025-03-16 15:07:53,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:53,845 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:07:53,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53 WrapperNode [2025-03-16 15:07:53,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:53,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:53,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:07:53,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:07:53,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:53,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,005 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:07:54,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:54,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:07:54,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:07:54,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:07:54,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,154 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:07:54,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:07:54,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:07:54,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:07:54,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:07:54,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (1/1) ... [2025-03-16 15:07:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:54,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:07:54,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:07:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:07:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:07:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:07:54,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:07:54,347 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:07:54,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:07:56,340 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:07:56,399 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:07:56,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:07:56,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:07:56,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:07:56,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:56 BoogieIcfgContainer [2025-03-16 15:07:56,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:07:56,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:07:56,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:07:56,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:07:56,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:07:53" (1/3) ... [2025-03-16 15:07:56,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc9162c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:56, skipping insertion in model container [2025-03-16 15:07:56,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:53" (2/3) ... [2025-03-16 15:07:56,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc9162c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:56, skipping insertion in model container [2025-03-16 15:07:56,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:56" (3/3) ... [2025-03-16 15:07:56,426 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label08.c [2025-03-16 15:07:56,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:07:56,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label08.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:07:56,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:07:56,503 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;@d43a9a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:07:56,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:07:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 15:07:56,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:56,514 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] [2025-03-16 15:07:56,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1967281639, now seen corresponding path program 1 times [2025-03-16 15:07:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833082641] [2025-03-16 15:07:56,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 15:07:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 15:07:56,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833082641] [2025-03-16 15:07:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833082641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:56,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:56,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690439817] [2025-03-16 15:07:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:07:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:56,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:07:56,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:56,653 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:56,685 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:07:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:07:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 15:07:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:56,696 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:07:56,696 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:07:56,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:56,700 INFO L435 NwaCegarLoop]: 626 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, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:56,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:07:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:07:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:07:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:07:56,734 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 50 [2025-03-16 15:07:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:07:56,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:07:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 15:07:56,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:56,739 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] [2025-03-16 15:07:56,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:56,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:56,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1852868787, now seen corresponding path program 1 times [2025-03-16 15:07:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:56,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720816944] [2025-03-16 15:07:56,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:56,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 15:07:56,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 15:07:56,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:56,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:56,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720816944] [2025-03-16 15:07:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720816944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44136486] [2025-03-16 15:07:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:56,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:56,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:56,946 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:58,241 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2025-03-16 15:07:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 15:07:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:58,244 INFO L225 Difference]: With dead ends: 1025 [2025-03-16 15:07:58,244 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 15:07:58,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:58,246 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 277 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:58,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 15:07:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-16 15:07:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2025-03-16 15:07:58,267 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 50 [2025-03-16 15:07:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:58,267 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2025-03-16 15:07:58,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2025-03-16 15:07:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 15:07:58,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:58,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:58,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:58,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2090024839, now seen corresponding path program 1 times [2025-03-16 15:07:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096755555] [2025-03-16 15:07:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 15:07:58,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 15:07:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096755555] [2025-03-16 15:07:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096755555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:58,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801169953] [2025-03-16 15:07:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:58,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:58,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:58,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:58,486 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:59,871 INFO L93 Difference]: Finished difference Result 1954 states and 2893 transitions. [2025-03-16 15:07:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-16 15:07:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:59,875 INFO L225 Difference]: With dead ends: 1954 [2025-03-16 15:07:59,875 INFO L226 Difference]: Without dead ends: 1291 [2025-03-16 15:07:59,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:59,877 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:59,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-16 15:07:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1281. [2025-03-16 15:07:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2025-03-16 15:07:59,899 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 125 [2025-03-16 15:07:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2025-03-16 15:07:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2025-03-16 15:07:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 15:07:59,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:59,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:59,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:59,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -243215535, now seen corresponding path program 1 times [2025-03-16 15:07:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700584789] [2025-03-16 15:07:59,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:59,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 15:07:59,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 15:07:59,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:59,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700584789] [2025-03-16 15:08:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700584789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600410747] [2025-03-16 15:08:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:00,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:00,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:00,077 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:01,226 INFO L93 Difference]: Finished difference Result 3765 states and 5263 transitions. [2025-03-16 15:08:01,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-16 15:08:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:01,234 INFO L225 Difference]: With dead ends: 3765 [2025-03-16 15:08:01,234 INFO L226 Difference]: Without dead ends: 2485 [2025-03-16 15:08:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:01,237 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:01,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-16 15:08:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2181. [2025-03-16 15:08:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.2825688073394494) internal successors, (2796), 2180 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2796 transitions. [2025-03-16 15:08:01,271 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2796 transitions. Word has length 129 [2025-03-16 15:08:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2796 transitions. [2025-03-16 15:08:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2796 transitions. [2025-03-16 15:08:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 15:08:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:01,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:08:01,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1579823448, now seen corresponding path program 1 times [2025-03-16 15:08:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657898800] [2025-03-16 15:08:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:01,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 15:08:01,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 15:08:01,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:01,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 15:08:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:01,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657898800] [2025-03-16 15:08:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657898800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801912531] [2025-03-16 15:08:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:01,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:01,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:01,494 INFO L87 Difference]: Start difference. First operand 2181 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:02,648 INFO L93 Difference]: Finished difference Result 5864 states and 7582 transitions. [2025-03-16 15:08:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:02,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 246 [2025-03-16 15:08:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:02,661 INFO L225 Difference]: With dead ends: 5864 [2025-03-16 15:08:02,661 INFO L226 Difference]: Without dead ends: 3684 [2025-03-16 15:08:02,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:02,664 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:02,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 318 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2025-03-16 15:08:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3681. [2025-03-16 15:08:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2025-03-16 15:08:02,721 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 246 [2025-03-16 15:08:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:02,721 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2025-03-16 15:08:02,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2025-03-16 15:08:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-16 15:08:02,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:02,724 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, 2, 2, 2, 2, 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] [2025-03-16 15:08:02,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:08:02,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:02,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash 483508526, now seen corresponding path program 1 times [2025-03-16 15:08:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180260866] [2025-03-16 15:08:02,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-16 15:08:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-16 15:08:02,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 15:08:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180260866] [2025-03-16 15:08:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180260866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235021384] [2025-03-16 15:08:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:03,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:03,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:03,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:03,245 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:04,376 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2025-03-16 15:08:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 322 [2025-03-16 15:08:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:04,387 INFO L225 Difference]: With dead ends: 7660 [2025-03-16 15:08:04,387 INFO L226 Difference]: Without dead ends: 3980 [2025-03-16 15:08:04,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:04,391 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:04,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2025-03-16 15:08:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2025-03-16 15:08:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2025-03-16 15:08:04,441 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 322 [2025-03-16 15:08:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:04,441 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2025-03-16 15:08:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2025-03-16 15:08:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-16 15:08:04,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:04,447 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:04,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:08:04,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash -969298369, now seen corresponding path program 1 times [2025-03-16 15:08:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19648123] [2025-03-16 15:08:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:04,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 15:08:04,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 15:08:04,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:08:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19648123] [2025-03-16 15:08:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19648123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218202695] [2025-03-16 15:08:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:04,674 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:05,865 INFO L93 Difference]: Finished difference Result 8856 states and 10952 transitions. [2025-03-16 15:08:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:05,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 337 [2025-03-16 15:08:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:05,877 INFO L225 Difference]: With dead ends: 8856 [2025-03-16 15:08:05,877 INFO L226 Difference]: Without dead ends: 5176 [2025-03-16 15:08:05,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:05,882 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 263 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:05,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2025-03-16 15:08:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3677. [2025-03-16 15:08:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3676 states have (on average 1.218171926006529) internal successors, (4478), 3676 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4478 transitions. [2025-03-16 15:08:05,933 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4478 transitions. Word has length 337 [2025-03-16 15:08:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:05,934 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 4478 transitions. [2025-03-16 15:08:05,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4478 transitions. [2025-03-16 15:08:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-03-16 15:08:05,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:05,938 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, 2, 2, 2, 2, 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] [2025-03-16 15:08:05,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:08:05,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1726892518, now seen corresponding path program 1 times [2025-03-16 15:08:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961782612] [2025-03-16 15:08:05,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:05,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-16 15:08:05,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-16 15:08:05,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:08:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:06,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961782612] [2025-03-16 15:08:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961782612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:06,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:06,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645920414] [2025-03-16 15:08:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:06,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:06,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:06,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:06,229 INFO L87 Difference]: Start difference. First operand 3677 states and 4478 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:07,352 INFO L93 Difference]: Finished difference Result 9156 states and 11368 transitions. [2025-03-16 15:08:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 396 [2025-03-16 15:08:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:07,365 INFO L225 Difference]: With dead ends: 9156 [2025-03-16 15:08:07,365 INFO L226 Difference]: Without dead ends: 5779 [2025-03-16 15:08:07,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:07,368 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 277 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:07,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 634 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2025-03-16 15:08:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5181. [2025-03-16 15:08:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5180 states have (on average 1.1768339768339768) internal successors, (6096), 5180 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 6096 transitions. [2025-03-16 15:08:07,433 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 6096 transitions. Word has length 396 [2025-03-16 15:08:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:07,434 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 6096 transitions. [2025-03-16 15:08:07,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 6096 transitions. [2025-03-16 15:08:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-16 15:08:07,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:07,441 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:08:07,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1983204756, now seen corresponding path program 1 times [2025-03-16 15:08:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069865781] [2025-03-16 15:08:07,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:07,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-16 15:08:07,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-16 15:08:07,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:07,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069865781] [2025-03-16 15:08:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069865781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255437] [2025-03-16 15:08:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:07,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:07,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:07,661 INFO L87 Difference]: Start difference. First operand 5181 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:08,667 INFO L93 Difference]: Finished difference Result 11867 states and 14276 transitions. [2025-03-16 15:08:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:08,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 402 [2025-03-16 15:08:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:08,684 INFO L225 Difference]: With dead ends: 11867 [2025-03-16 15:08:08,684 INFO L226 Difference]: Without dead ends: 6986 [2025-03-16 15:08:08,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:08,688 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:08,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 602 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2025-03-16 15:08:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 6086. [2025-03-16 15:08:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.162859490550534) internal successors, (7076), 6085 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7076 transitions. [2025-03-16 15:08:08,746 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7076 transitions. Word has length 402 [2025-03-16 15:08:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7076 transitions. [2025-03-16 15:08:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7076 transitions. [2025-03-16 15:08:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-16 15:08:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:08,749 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:08:08,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2030547663, now seen corresponding path program 1 times [2025-03-16 15:08:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942898653] [2025-03-16 15:08:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:08,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-16 15:08:08,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-16 15:08:08,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:08,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:08:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942898653] [2025-03-16 15:08:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942898653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329384200] [2025-03-16 15:08:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:09,023 INFO L87 Difference]: Start difference. First operand 6086 states and 7076 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:10,385 INFO L93 Difference]: Finished difference Result 13666 states and 16223 transitions. [2025-03-16 15:08:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 419 [2025-03-16 15:08:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:10,398 INFO L225 Difference]: With dead ends: 13666 [2025-03-16 15:08:10,398 INFO L226 Difference]: Without dead ends: 7880 [2025-03-16 15:08:10,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:10,405 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:10,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 615 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:08:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2025-03-16 15:08:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7876. [2025-03-16 15:08:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1457777777777778) internal successors, (9023), 7875 states have internal predecessors, (9023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9023 transitions. [2025-03-16 15:08:10,480 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9023 transitions. Word has length 419 [2025-03-16 15:08:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:10,480 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9023 transitions. [2025-03-16 15:08:10,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9023 transitions. [2025-03-16 15:08:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-16 15:08:10,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:10,483 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:08:10,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -88112664, now seen corresponding path program 1 times [2025-03-16 15:08:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154797227] [2025-03-16 15:08:10,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:10,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-16 15:08:10,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-16 15:08:10,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:10,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 49 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154797227] [2025-03-16 15:08:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154797227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269351456] [2025-03-16 15:08:10,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:10,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:10,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:08:10,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-16 15:08:11,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-16 15:08:11,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:11,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:11,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:08:11,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269351456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:11,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114570217] [2025-03-16 15:08:11,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:11,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:11,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:11,209 INFO L87 Difference]: Start difference. First operand 7876 states and 9023 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:12,384 INFO L93 Difference]: Finished difference Result 18509 states and 21584 transitions. [2025-03-16 15:08:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:12,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 427 [2025-03-16 15:08:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:12,401 INFO L225 Difference]: With dead ends: 18509 [2025-03-16 15:08:12,401 INFO L226 Difference]: Without dead ends: 10933 [2025-03-16 15:08:12,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:12,408 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 364 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:12,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 634 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2025-03-16 15:08:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10927. [2025-03-16 15:08:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10927 states, 10926 states have (on average 1.1587040087863811) internal successors, (12660), 10926 states have internal predecessors, (12660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 12660 transitions. [2025-03-16 15:08:12,511 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 12660 transitions. Word has length 427 [2025-03-16 15:08:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:12,511 INFO L471 AbstractCegarLoop]: Abstraction has 10927 states and 12660 transitions. [2025-03-16 15:08:12,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 12660 transitions. [2025-03-16 15:08:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-16 15:08:12,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:12,514 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:12,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:08:12,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:08:12,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:12,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -502392780, now seen corresponding path program 1 times [2025-03-16 15:08:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979381405] [2025-03-16 15:08:12,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:12,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-16 15:08:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-16 15:08:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:08:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979381405] [2025-03-16 15:08:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979381405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927613449] [2025-03-16 15:08:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:13,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:13,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:13,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:13,019 INFO L87 Difference]: Start difference. First operand 10927 states and 12660 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:14,168 INFO L93 Difference]: Finished difference Result 28430 states and 33048 transitions. [2025-03-16 15:08:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:14,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 499 [2025-03-16 15:08:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:14,194 INFO L225 Difference]: With dead ends: 28430 [2025-03-16 15:08:14,194 INFO L226 Difference]: Without dead ends: 17803 [2025-03-16 15:08:14,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:14,204 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 305 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:14,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 173 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17803 states. [2025-03-16 15:08:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17803 to 16009. [2025-03-16 15:08:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16009 states, 16008 states have (on average 1.1511744127936032) internal successors, (18428), 16008 states have internal predecessors, (18428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16009 states to 16009 states and 18428 transitions. [2025-03-16 15:08:14,344 INFO L78 Accepts]: Start accepts. Automaton has 16009 states and 18428 transitions. Word has length 499 [2025-03-16 15:08:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:14,345 INFO L471 AbstractCegarLoop]: Abstraction has 16009 states and 18428 transitions. [2025-03-16 15:08:14,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16009 states and 18428 transitions. [2025-03-16 15:08:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-16 15:08:14,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:14,349 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:08:14,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:08:14,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash -478283577, now seen corresponding path program 1 times [2025-03-16 15:08:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655017361] [2025-03-16 15:08:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:14,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-16 15:08:14,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-16 15:08:14,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:14,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:08:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655017361] [2025-03-16 15:08:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655017361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482132500] [2025-03-16 15:08:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:14,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:14,650 INFO L87 Difference]: Start difference. First operand 16009 states and 18428 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:15,737 INFO L93 Difference]: Finished difference Result 39516 states and 45916 transitions. [2025-03-16 15:08:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 538 [2025-03-16 15:08:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:15,772 INFO L225 Difference]: With dead ends: 39516 [2025-03-16 15:08:15,772 INFO L226 Difference]: Without dead ends: 23807 [2025-03-16 15:08:15,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:15,785 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:15,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 620 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23807 states. [2025-03-16 15:08:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23807 to 23189. [2025-03-16 15:08:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23189 states, 23188 states have (on average 1.13903743315508) internal successors, (26412), 23188 states have internal predecessors, (26412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23189 states to 23189 states and 26412 transitions. [2025-03-16 15:08:15,968 INFO L78 Accepts]: Start accepts. Automaton has 23189 states and 26412 transitions. Word has length 538 [2025-03-16 15:08:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:15,969 INFO L471 AbstractCegarLoop]: Abstraction has 23189 states and 26412 transitions. [2025-03-16 15:08:15,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23189 states and 26412 transitions. [2025-03-16 15:08:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-16 15:08:15,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:15,975 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:08:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:08:15,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -179220219, now seen corresponding path program 1 times [2025-03-16 15:08:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669855543] [2025-03-16 15:08:15,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:16,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:08:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:08:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 565 proven. 39 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-16 15:08:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669855543] [2025-03-16 15:08:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669855543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890854857] [2025-03-16 15:08:16,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:16,354 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 15:08:16,355 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 15:08:16,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:08:16,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:08:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:16,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:16,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-16 15:08:16,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890854857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:16,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:16,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:16,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095054485] [2025-03-16 15:08:16,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:16,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:16,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:16,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:16,571 INFO L87 Difference]: Start difference. First operand 23189 states and 26412 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:17,619 INFO L93 Difference]: Finished difference Result 49665 states and 56864 transitions. [2025-03-16 15:08:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:17,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 578 [2025-03-16 15:08:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:17,654 INFO L225 Difference]: With dead ends: 49665 [2025-03-16 15:08:17,654 INFO L226 Difference]: Without dead ends: 26776 [2025-03-16 15:08:17,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:17,673 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 364 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:17,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 443 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2025-03-16 15:08:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 19239. [2025-03-16 15:08:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19239 states, 19238 states have (on average 1.125532799667325) internal successors, (21653), 19238 states have internal predecessors, (21653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19239 states to 19239 states and 21653 transitions. [2025-03-16 15:08:17,859 INFO L78 Accepts]: Start accepts. Automaton has 19239 states and 21653 transitions. Word has length 578 [2025-03-16 15:08:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 19239 states and 21653 transitions. [2025-03-16 15:08:17,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19239 states and 21653 transitions. [2025-03-16 15:08:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-16 15:08:17,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:17,866 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:17,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:08:18,067 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,SelfDestructingSolverStorable13 [2025-03-16 15:08:18,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:18,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1462767039, now seen corresponding path program 1 times [2025-03-16 15:08:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704352310] [2025-03-16 15:08:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:18,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-16 15:08:18,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-16 15:08:18,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:18,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:08:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704352310] [2025-03-16 15:08:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704352310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411746549] [2025-03-16 15:08:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:18,387 INFO L87 Difference]: Start difference. First operand 19239 states and 21653 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:19,446 INFO L93 Difference]: Finished difference Result 46851 states and 52872 transitions. [2025-03-16 15:08:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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 612 [2025-03-16 15:08:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:19,474 INFO L225 Difference]: With dead ends: 46851 [2025-03-16 15:08:19,474 INFO L226 Difference]: Without dead ends: 24922 [2025-03-16 15:08:19,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:19,490 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 181 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:19,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 525 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24922 states. [2025-03-16 15:08:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24922 to 22231. [2025-03-16 15:08:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22231 states, 22230 states have (on average 1.0825011246063878) internal successors, (24064), 22230 states have internal predecessors, (24064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22231 states to 22231 states and 24064 transitions. [2025-03-16 15:08:19,753 INFO L78 Accepts]: Start accepts. Automaton has 22231 states and 24064 transitions. Word has length 612 [2025-03-16 15:08:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:19,753 INFO L471 AbstractCegarLoop]: Abstraction has 22231 states and 24064 transitions. [2025-03-16 15:08:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22231 states and 24064 transitions. [2025-03-16 15:08:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-16 15:08:19,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:19,761 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:08:19,761 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1964881204, now seen corresponding path program 1 times [2025-03-16 15:08:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109176026] [2025-03-16 15:08:19,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:19,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-16 15:08:19,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-16 15:08:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 223 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:21,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:21,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109176026] [2025-03-16 15:08:21,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109176026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:21,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873174892] [2025-03-16 15:08:21,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:21,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:21,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:21,081 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 15:08:21,083 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 15:08:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-16 15:08:21,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-16 15:08:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:21,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 15:08:21,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 521 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:23,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 521 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:24,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873174892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:24,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:24,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-16 15:08:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584671506] [2025-03-16 15:08:24,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 15:08:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 15:08:24,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:08:24,890 INFO L87 Difference]: Start difference. First operand 22231 states and 24064 transitions. Second operand has 11 states, 11 states have (on average 123.72727272727273) internal successors, (1361), 11 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:33,145 INFO L93 Difference]: Finished difference Result 79484 states and 84935 transitions. [2025-03-16 15:08:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-16 15:08:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 123.72727272727273) internal successors, (1361), 11 states have internal predecessors, (1361), 0 states have call successors, (0), 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 722 [2025-03-16 15:08:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:33,197 INFO L225 Difference]: With dead ends: 79484 [2025-03-16 15:08:33,197 INFO L226 Difference]: Without dead ends: 55217 [2025-03-16 15:08:33,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1522 GetRequests, 1467 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=532, Invalid=2660, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 15:08:33,220 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8124 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 13823 mSolverCounterSat, 2272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8124 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 16095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2272 IncrementalHoareTripleChecker+Valid, 13823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:33,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8124 Valid, 528 Invalid, 16095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2272 Valid, 13823 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-16 15:08:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55217 states. [2025-03-16 15:08:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55217 to 23726. [2025-03-16 15:08:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23726 states, 23725 states have (on average 1.067186512118019) internal successors, (25319), 23725 states have internal predecessors, (25319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23726 states to 23726 states and 25319 transitions. [2025-03-16 15:08:33,617 INFO L78 Accepts]: Start accepts. Automaton has 23726 states and 25319 transitions. Word has length 722 [2025-03-16 15:08:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:33,617 INFO L471 AbstractCegarLoop]: Abstraction has 23726 states and 25319 transitions. [2025-03-16 15:08:33,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.72727272727273) internal successors, (1361), 11 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 23726 states and 25319 transitions. [2025-03-16 15:08:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-03-16 15:08:33,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:33,624 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:33,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:08:33,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:33,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 875837750, now seen corresponding path program 1 times [2025-03-16 15:08:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618536623] [2025-03-16 15:08:33,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:33,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-03-16 15:08:33,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-03-16 15:08:33,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:33,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:08:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:34,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618536623] [2025-03-16 15:08:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618536623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:34,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554397756] [2025-03-16 15:08:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:34,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:34,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:34,423 INFO L87 Difference]: Start difference. First operand 23726 states and 25319 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:35,888 INFO L93 Difference]: Finished difference Result 55545 states and 59195 transitions. [2025-03-16 15:08:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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 749 [2025-03-16 15:08:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:35,917 INFO L225 Difference]: With dead ends: 55545 [2025-03-16 15:08:35,917 INFO L226 Difference]: Without dead ends: 32119 [2025-03-16 15:08:35,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:35,930 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 518 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:35,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 167 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:08:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32119 states. [2025-03-16 15:08:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32119 to 30020. [2025-03-16 15:08:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30020 states, 30019 states have (on average 1.0661580998700824) internal successors, (32005), 30019 states have internal predecessors, (32005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30020 states to 30020 states and 32005 transitions. [2025-03-16 15:08:36,166 INFO L78 Accepts]: Start accepts. Automaton has 30020 states and 32005 transitions. Word has length 749 [2025-03-16 15:08:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:36,166 INFO L471 AbstractCegarLoop]: Abstraction has 30020 states and 32005 transitions. [2025-03-16 15:08:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30020 states and 32005 transitions. [2025-03-16 15:08:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2025-03-16 15:08:36,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:36,176 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:08:36,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 347495003, now seen corresponding path program 1 times [2025-03-16 15:08:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661314249] [2025-03-16 15:08:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:36,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 816 statements into 1 equivalence classes. [2025-03-16 15:08:36,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 816 of 816 statements. [2025-03-16 15:08:36,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:36,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-03-16 15:08:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661314249] [2025-03-16 15:08:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661314249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706585950] [2025-03-16 15:08:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:36,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:36,619 INFO L87 Difference]: Start difference. First operand 30020 states and 32005 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:37,470 INFO L93 Difference]: Finished difference Result 62428 states and 66573 transitions. [2025-03-16 15:08:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 816 [2025-03-16 15:08:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:37,501 INFO L225 Difference]: With dead ends: 62428 [2025-03-16 15:08:37,501 INFO L226 Difference]: Without dead ends: 30914 [2025-03-16 15:08:37,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:37,520 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 223 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 502 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:08:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30914 states. [2025-03-16 15:08:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30914 to 27315. [2025-03-16 15:08:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27315 states, 27314 states have (on average 1.061580142051695) internal successors, (28996), 27314 states have internal predecessors, (28996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27315 states to 27315 states and 28996 transitions. [2025-03-16 15:08:37,849 INFO L78 Accepts]: Start accepts. Automaton has 27315 states and 28996 transitions. Word has length 816 [2025-03-16 15:08:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:37,849 INFO L471 AbstractCegarLoop]: Abstraction has 27315 states and 28996 transitions. [2025-03-16 15:08:37,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 27315 states and 28996 transitions. [2025-03-16 15:08:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2025-03-16 15:08:37,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:37,868 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:37,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:08:37,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:37,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1078127820, now seen corresponding path program 1 times [2025-03-16 15:08:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258849452] [2025-03-16 15:08:37,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:37,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-03-16 15:08:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-03-16 15:08:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-16 15:08:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258849452] [2025-03-16 15:08:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258849452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256069860] [2025-03-16 15:08:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:38,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:38,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:38,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:38,283 INFO L87 Difference]: Start difference. First operand 27315 states and 28996 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:38,989 INFO L93 Difference]: Finished difference Result 48020 states and 50604 transitions. [2025-03-16 15:08:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 872 [2025-03-16 15:08:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:39,008 INFO L225 Difference]: With dead ends: 48020 [2025-03-16 15:08:39,008 INFO L226 Difference]: Without dead ends: 21005 [2025-03-16 15:08:39,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:39,022 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:39,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 88 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21005 states. [2025-03-16 15:08:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21005 to 18000. [2025-03-16 15:08:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18000 states, 17999 states have (on average 1.043835768653814) internal successors, (18788), 17999 states have internal predecessors, (18788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18000 states to 18000 states and 18788 transitions. [2025-03-16 15:08:39,205 INFO L78 Accepts]: Start accepts. Automaton has 18000 states and 18788 transitions. Word has length 872 [2025-03-16 15:08:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:39,205 INFO L471 AbstractCegarLoop]: Abstraction has 18000 states and 18788 transitions. [2025-03-16 15:08:39,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18000 states and 18788 transitions. [2025-03-16 15:08:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2025-03-16 15:08:39,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:39,217 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:39,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:08:39,217 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash -865236482, now seen corresponding path program 1 times [2025-03-16 15:08:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107281586] [2025-03-16 15:08:39,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 898 statements into 1 equivalence classes. [2025-03-16 15:08:39,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 898 of 898 statements. [2025-03-16 15:08:39,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:39,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:08:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107281586] [2025-03-16 15:08:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107281586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176956837] [2025-03-16 15:08:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:39,717 INFO L87 Difference]: Start difference. First operand 18000 states and 18788 transitions. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:40,437 INFO L93 Difference]: Finished difference Result 38102 states and 39843 transitions. [2025-03-16 15:08:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 898 [2025-03-16 15:08:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:40,456 INFO L225 Difference]: With dead ends: 38102 [2025-03-16 15:08:40,456 INFO L226 Difference]: Without dead ends: 20402 [2025-03-16 15:08:40,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:40,467 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 321 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:40,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 94 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-16 15:08:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 17699. [2025-03-16 15:08:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17699 states, 17698 states have (on average 1.0442422872640977) internal successors, (18481), 17698 states have internal predecessors, (18481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17699 states to 17699 states and 18481 transitions. [2025-03-16 15:08:40,646 INFO L78 Accepts]: Start accepts. Automaton has 17699 states and 18481 transitions. Word has length 898 [2025-03-16 15:08:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 17699 states and 18481 transitions. [2025-03-16 15:08:40,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17699 states and 18481 transitions. [2025-03-16 15:08:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-03-16 15:08:40,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:40,657 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:40,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:08:40,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:40,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -857313605, now seen corresponding path program 1 times [2025-03-16 15:08:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918527839] [2025-03-16 15:08:40,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:40,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-03-16 15:08:40,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-03-16 15:08:40,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 15:08:41,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918527839] [2025-03-16 15:08:41,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918527839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:41,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:41,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307598027] [2025-03-16 15:08:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:41,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:41,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:41,206 INFO L87 Difference]: Start difference. First operand 17699 states and 18481 transitions. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:41,908 INFO L93 Difference]: Finished difference Result 39304 states and 41146 transitions. [2025-03-16 15:08:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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 911 [2025-03-16 15:08:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:41,929 INFO L225 Difference]: With dead ends: 39304 [2025-03-16 15:08:41,929 INFO L226 Difference]: Without dead ends: 21905 [2025-03-16 15:08:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:41,941 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 32 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:41,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 441 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2025-03-16 15:08:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 21006. [2025-03-16 15:08:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21006 states, 21005 states have (on average 1.0418471792430373) internal successors, (21884), 21005 states have internal predecessors, (21884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 21884 transitions. [2025-03-16 15:08:42,139 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 21884 transitions. Word has length 911 [2025-03-16 15:08:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:42,140 INFO L471 AbstractCegarLoop]: Abstraction has 21006 states and 21884 transitions. [2025-03-16 15:08:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 21884 transitions. [2025-03-16 15:08:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2025-03-16 15:08:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:42,150 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:42,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:08:42,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:42,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1908947969, now seen corresponding path program 1 times [2025-03-16 15:08:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209523108] [2025-03-16 15:08:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:42,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 923 statements into 1 equivalence classes. [2025-03-16 15:08:42,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 923 of 923 statements. [2025-03-16 15:08:42,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:42,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2025-03-16 15:08:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209523108] [2025-03-16 15:08:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209523108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520228844] [2025-03-16 15:08:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:42,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:42,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:42,591 INFO L87 Difference]: Start difference. First operand 21006 states and 21884 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:43,232 INFO L93 Difference]: Finished difference Result 45307 states and 47130 transitions. [2025-03-16 15:08:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:43,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 923 [2025-03-16 15:08:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:43,255 INFO L225 Difference]: With dead ends: 45307 [2025-03-16 15:08:43,255 INFO L226 Difference]: Without dead ends: 24302 [2025-03-16 15:08:43,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:43,270 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 258 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:43,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 446 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:08:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2025-03-16 15:08:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 15302. [2025-03-16 15:08:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15302 states, 15301 states have (on average 1.0379713744199726) internal successors, (15882), 15301 states have internal predecessors, (15882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 15882 transitions. [2025-03-16 15:08:43,415 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 15882 transitions. Word has length 923 [2025-03-16 15:08:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 15302 states and 15882 transitions. [2025-03-16 15:08:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 15882 transitions. [2025-03-16 15:08:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2025-03-16 15:08:43,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:43,428 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:43,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:08:43,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 962149941, now seen corresponding path program 1 times [2025-03-16 15:08:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228431820] [2025-03-16 15:08:43,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-03-16 15:08:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-03-16 15:08:43,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 812 proven. 179 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:08:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228431820] [2025-03-16 15:08:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228431820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096844663] [2025-03-16 15:08:45,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:45,184 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 15:08:45,185 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 15:08:45,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-03-16 15:08:45,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-03-16 15:08:45,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:45,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:45,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:08:45,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 781 proven. 49 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:08:45,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:08:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096844663] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:46,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:08:46,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-16 15:08:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583373197] [2025-03-16 15:08:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:46,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:46,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:46,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:08:46,285 INFO L87 Difference]: Start difference. First operand 15302 states and 15882 transitions. Second operand has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:47,334 INFO L93 Difference]: Finished difference Result 34508 states and 35781 transitions. [2025-03-16 15:08:47,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 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 983 [2025-03-16 15:08:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:47,349 INFO L225 Difference]: With dead ends: 34508 [2025-03-16 15:08:47,349 INFO L226 Difference]: Without dead ends: 19207 [2025-03-16 15:08:47,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1970 GetRequests, 1962 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:08:47,358 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 293 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:47,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 53 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2025-03-16 15:08:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 16199. [2025-03-16 15:08:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16199 states, 16198 states have (on average 1.0372885541424868) internal successors, (16802), 16198 states have internal predecessors, (16802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16199 states to 16199 states and 16802 transitions. [2025-03-16 15:08:47,503 INFO L78 Accepts]: Start accepts. Automaton has 16199 states and 16802 transitions. Word has length 983 [2025-03-16 15:08:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:47,504 INFO L471 AbstractCegarLoop]: Abstraction has 16199 states and 16802 transitions. [2025-03-16 15:08:47,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16199 states and 16802 transitions. [2025-03-16 15:08:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2025-03-16 15:08:47,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:47,519 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:47,526 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 15:08:47,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:47,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:47,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1077342077, now seen corresponding path program 1 times [2025-03-16 15:08:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613973156] [2025-03-16 15:08:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:47,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1226 statements into 1 equivalence classes. [2025-03-16 15:08:47,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1226 of 1226 statements. [2025-03-16 15:08:47,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:47,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2296 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2025-03-16 15:08:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613973156] [2025-03-16 15:08:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613973156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:48,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065483614] [2025-03-16 15:08:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:48,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:48,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:48,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:48,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:48,091 INFO L87 Difference]: Start difference. First operand 16199 states and 16802 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:48,665 INFO L93 Difference]: Finished difference Result 31498 states and 32730 transitions. [2025-03-16 15:08:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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 1226 [2025-03-16 15:08:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:48,678 INFO L225 Difference]: With dead ends: 31498 [2025-03-16 15:08:48,679 INFO L226 Difference]: Without dead ends: 15599 [2025-03-16 15:08:48,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:48,687 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:48,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 418 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:08:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15599 states. [2025-03-16 15:08:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15599 to 12597. [2025-03-16 15:08:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12597 states, 12596 states have (on average 1.032232454747539) internal successors, (13002), 12596 states have internal predecessors, (13002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12597 states to 12597 states and 13002 transitions. [2025-03-16 15:08:48,789 INFO L78 Accepts]: Start accepts. Automaton has 12597 states and 13002 transitions. Word has length 1226 [2025-03-16 15:08:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 12597 states and 13002 transitions. [2025-03-16 15:08:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12597 states and 13002 transitions. [2025-03-16 15:08:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2025-03-16 15:08:48,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:48,804 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:08:48,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:08:48,805 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:48,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash -157810749, now seen corresponding path program 1 times [2025-03-16 15:08:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:48,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52900181] [2025-03-16 15:08:48,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1277 statements into 1 equivalence classes. [2025-03-16 15:08:48,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1277 of 1277 statements. [2025-03-16 15:08:48,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:48,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1218 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2025-03-16 15:08:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52900181] [2025-03-16 15:08:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52900181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106750084] [2025-03-16 15:08:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:49,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:49,372 INFO L87 Difference]: Start difference. First operand 12597 states and 13002 transitions. Second operand has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:50,303 INFO L93 Difference]: Finished difference Result 25194 states and 26014 transitions. [2025-03-16 15:08:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:50,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 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 1277 [2025-03-16 15:08:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:50,304 INFO L225 Difference]: With dead ends: 25194 [2025-03-16 15:08:50,304 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:08:50,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:50,311 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 346 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:50,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 403 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:08:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:08:50,311 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 15:08:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:08:50,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1277 [2025-03-16 15:08:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:08:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:08:50,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:08:50,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:08:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:08:50,316 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, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:50,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:08:56,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:08:56,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:08:56 BoogieIcfgContainer [2025-03-16 15:08:56,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:08:56,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:08:56,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:08:56,706 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:08:56,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:56" (3/4) ... [2025-03-16 15:08:56,708 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:08:56,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:08:56,733 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:08:56,734 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:08:56,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:08:56,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:08:56,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:08:56,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:08:56,889 INFO L158 Benchmark]: Toolchain (without parser) took 63645.25ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 101.9MB in the beginning and 585.8MB in the end (delta: -483.9MB). Peak memory consumption was 854.1MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,889 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:08:56,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.86ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.6MB in the end (delta: 12.3MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.18ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 52.3MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,890 INFO L158 Benchmark]: Boogie Preprocessor took 234.24ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 52.3MB in the beginning and 58.0MB in the end (delta: -5.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,890 INFO L158 Benchmark]: IcfgBuilder took 2175.49ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 58.0MB in the beginning and 237.8MB in the end (delta: -179.8MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,890 INFO L158 Benchmark]: TraceAbstraction took 60286.07ms. Allocated memory was 352.3MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 234.1MB in the beginning and 606.7MB in the end (delta: -372.6MB). Peak memory consumption was 921.5MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,891 INFO L158 Benchmark]: Witness Printer took 181.05ms. Allocated memory is still 1.5GB. Free memory was 606.7MB in the beginning and 585.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:08:56,891 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.86ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.6MB in the end (delta: 12.3MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.18ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 52.3MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 234.24ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 52.3MB in the beginning and 58.0MB in the end (delta: -5.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2175.49ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 58.0MB in the beginning and 237.8MB in the end (delta: -179.8MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. * TraceAbstraction took 60286.07ms. Allocated memory was 352.3MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 234.1MB in the beginning and 606.7MB in the end (delta: -372.6MB). Peak memory consumption was 921.5MB. Max. memory is 16.1GB. * Witness Printer took 181.05ms. Allocated memory is still 1.5GB. Free memory was 606.7MB in the beginning and 585.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 170]: 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, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13873 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13873 mSDsluCounter, 9988 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1244 mSDsCounter, 6067 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36198 IncrementalHoareTripleChecker+Invalid, 42265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6067 mSolverCounterUnsat, 8744 mSDtfsCounter, 36198 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4562 GetRequests, 4469 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30020occurred in iteration=17, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 74772 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 17217 NumberOfCodeBlocks, 17217 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18891 ConstructedInterpolants, 0 QuantifiedInterpolants, 58670 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3203 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 21908/22948 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: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 144) <= 0)) || (((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || ((((a29 <= 41) && (3 != a2)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a29 + 192415)))) || (((0 <= ((long long) a29 + 15)) && (((long long) a0 + 99) <= 0)) && (((long long) 89 + a4) <= 0))) || (((((long long) 148 + a0) <= 0) && (44 <= a29)) && (a2 == 1))) || ((((3 != a2) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 192415)))) || ((((a29 <= 41) && (((long long) 148 + a0) <= 0)) && (0 <= ((long long) 599998 + a0))) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 43))) || (((3 != a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((long long) 89 + a4) <= 0) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || ((((3 != a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (3 == a2))) || (((((0 <= ((long long) a29 + 15)) && (0 <= ((long long) 599998 + a0))) && (((long long) a0 + 147) <= 0)) && (3 == a2)) && (a29 <= 43))) || ((((((long long) 148 + a0) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (3 == a2))) || (((a29 <= 41) && (0 <= ((long long) a4 + 85))) && (a2 == 1))) || ((((a29 <= 41) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((long long) 98 + a0) <= 0) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && ((((3 != a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 192415))) || (((3 != a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0))))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:08:56,909 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