./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem16_label11.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 ad24518eb48bdb2cd9eb62c6c7c8e6761cdaf552ed2e2f0623280cf19933d94d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:53:43,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:53:43,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:53:43,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:53:43,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:53:43,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:53:43,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:53:43,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:53:43,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:53:43,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:53:43,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:53:43,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:53:43,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:53:43,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:53:43,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:53:43,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:53:43,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:53:43,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:53:43,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:53:43,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:43,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:53:43,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:53:43,804 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 -> ad24518eb48bdb2cd9eb62c6c7c8e6761cdaf552ed2e2f0623280cf19933d94d [2025-03-03 10:53:44,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:53:44,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:53:44,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:53:44,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:53:44,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:53:44,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2025-03-03 10:53:45,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1408e2e/5e63618adfaf43f380c96bfe3f1751d7/FLAG441854ce3 [2025-03-03 10:53:45,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:53:45,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2025-03-03 10:53:45,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1408e2e/5e63618adfaf43f380c96bfe3f1751d7/FLAG441854ce3 [2025-03-03 10:53:45,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1408e2e/5e63618adfaf43f380c96bfe3f1751d7 [2025-03-03 10:53:45,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:53:45,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:53:45,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:45,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:53:45,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:53:45,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:45" (1/1) ... [2025-03-03 10:53:45,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69df3533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:45, skipping insertion in model container [2025-03-03 10:53:45,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:45" (1/1) ... [2025-03-03 10:53:45,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:53:45,822 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/Problem16_label11.c[5798,5811] [2025-03-03 10:53:46,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:46,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:53:46,119 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/Problem16_label11.c[5798,5811] [2025-03-03 10:53:46,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:46,235 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:53:46,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46 WrapperNode [2025-03-03 10:53:46,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:46,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:46,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:53:46,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:53:46,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,364 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:53:46,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:46,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:53:46,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:53:46,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:53:46,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,428 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-03 10:53:46,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:53:46,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:53:46,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:53:46,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:53:46,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (1/1) ... [2025-03-03 10:53:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:46,535 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-03 10:53:46,538 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-03 10:53:46,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:53:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:53:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:53:46,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:53:46,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:53:46,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:53:48,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:53:48,313 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:53:48,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:53:48,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:53:48,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:53:48,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:48 BoogieIcfgContainer [2025-03-03 10:53:48,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:53:48,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:53:48,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:53:48,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:53:48,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:53:45" (1/3) ... [2025-03-03 10:53:48,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce71abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:48, skipping insertion in model container [2025-03-03 10:53:48,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:46" (2/3) ... [2025-03-03 10:53:48,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce71abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:48, skipping insertion in model container [2025-03-03 10:53:48,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:48" (3/3) ... [2025-03-03 10:53:48,345 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label11.c [2025-03-03 10:53:48,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:53:48,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label11.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:53:48,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:53:48,425 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;@4922cbc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:53:48,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:53:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 10:53:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:48,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:48,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -799095375, now seen corresponding path program 1 times [2025-03-03 10:53:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047216129] [2025-03-03 10:53:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:48,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 10:53:48,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 10:53:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:48,763 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-03 10:53:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047216129] [2025-03-03 10:53:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047216129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390122107] [2025-03-03 10:53:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:48,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:48,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:48,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:48,781 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:50,005 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:53:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 10:53:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:50,020 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:53:50,021 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:53:50,024 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-03 10:53:50,026 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 331 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:50,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:53:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:53:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:53:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-03-03 10:53:50,083 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 55 [2025-03-03 10:53:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:50,083 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-03-03 10:53:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-03-03 10:53:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 10:53:50,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:50,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:50,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:53:50,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:50,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1137830879, now seen corresponding path program 1 times [2025-03-03 10:53:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023305773] [2025-03-03 10:53:50,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:50,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 10:53:50,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 10:53:50,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:50,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023305773] [2025-03-03 10:53:50,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023305773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:50,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:50,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728021726] [2025-03-03 10:53:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:50,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:50,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:50,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:50,265 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:51,281 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-03-03 10:53:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-03 10:53:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:51,286 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:53:51,286 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:53:51,288 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-03 10:53:51,289 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:51,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:53:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:53:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-03-03 10:53:51,319 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 120 [2025-03-03 10:53:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-03-03 10:53:51,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-03-03 10:53:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 10:53:51,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:51,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:51,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:53:51,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1034183396, now seen corresponding path program 1 times [2025-03-03 10:53:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520534285] [2025-03-03 10:53:51,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:51,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 10:53:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 10:53:51,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:51,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520534285] [2025-03-03 10:53:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520534285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:51,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243047197] [2025-03-03 10:53:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:51,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:51,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:51,603 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:53,203 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-03-03 10:53:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-03 10:53:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:53,214 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:53:53,214 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:53:53,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:53,219 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:53,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 41 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:53:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:53:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:53:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5034692107545533) internal successors, (3467), 2306 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-03-03 10:53:53,260 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 123 [2025-03-03 10:53:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:53,261 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-03-03 10:53:53,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-03-03 10:53:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 10:53:53,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:53,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:53:53,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:53:53,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2055081142, now seen corresponding path program 1 times [2025-03-03 10:53:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:53,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123095334] [2025-03-03 10:53:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 10:53:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 10:53:53,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:53,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 10:53:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123095334] [2025-03-03 10:53:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123095334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:53,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:53,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28312322] [2025-03-03 10:53:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:53,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:53,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:53,424 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:54,465 INFO L93 Difference]: Finished difference Result 6257 states and 9726 transitions. [2025-03-03 10:53:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-03-03 10:53:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:54,477 INFO L225 Difference]: With dead ends: 6257 [2025-03-03 10:53:54,477 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:53:54,479 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-03 10:53:54,480 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:54,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:53:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-03 10:53:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3539719626168225) internal successors, (5795), 4280 states have internal predecessors, (5795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5795 transitions. [2025-03-03 10:53:54,539 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5795 transitions. Word has length 142 [2025-03-03 10:53:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5795 transitions. [2025-03-03 10:53:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5795 transitions. [2025-03-03 10:53:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 10:53:54,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:54,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:53:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:53:54,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash -779246289, now seen corresponding path program 1 times [2025-03-03 10:53:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462855971] [2025-03-03 10:53:54,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 10:53:54,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 10:53:54,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:54,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462855971] [2025-03-03 10:53:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462855971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:54,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063334167] [2025-03-03 10:53:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:54,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:54,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:54,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:54,707 INFO L87 Difference]: Start difference. First operand 4281 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:55,563 INFO L93 Difference]: Finished difference Result 9547 states and 12996 transitions. [2025-03-03 10:53:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-03 10:53:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:55,576 INFO L225 Difference]: With dead ends: 9547 [2025-03-03 10:53:55,576 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:53:55,581 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-03 10:53:55,581 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 281 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:55,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 545 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:53:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:53:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:53:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2977126518942101) internal successors, (7262), 5596 states have internal predecessors, (7262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 7262 transitions. [2025-03-03 10:53:55,652 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 7262 transitions. Word has length 238 [2025-03-03 10:53:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:55,652 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 7262 transitions. [2025-03-03 10:53:55,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 7262 transitions. [2025-03-03 10:53:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 10:53:55,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:55,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:53:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:53:55,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 848356269, now seen corresponding path program 1 times [2025-03-03 10:53:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979191729] [2025-03-03 10:53:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:55,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 10:53:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 10:53:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:55,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 10:53:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979191729] [2025-03-03 10:53:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979191729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:55,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:55,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542884679] [2025-03-03 10:53:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:55,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:55,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:55,842 INFO L87 Difference]: Start difference. First operand 5597 states and 7262 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:56,779 INFO L93 Difference]: Finished difference Result 14153 states and 18440 transitions. [2025-03-03 10:53:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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-03 10:53:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:56,794 INFO L225 Difference]: With dead ends: 14153 [2025-03-03 10:53:56,794 INFO L226 Difference]: Without dead ends: 7900 [2025-03-03 10:53:56,797 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-03 10:53:56,799 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:56,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-03 10:53:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 6913. [2025-03-03 10:53:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0727719907407407) internal successors, (7415), 6912 states have internal predecessors, (7415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7415 transitions. [2025-03-03 10:53:56,885 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7415 transitions. Word has length 322 [2025-03-03 10:53:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:56,885 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7415 transitions. [2025-03-03 10:53:56,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7415 transitions. [2025-03-03 10:53:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-03 10:53:56,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:56,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:53:56,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -355601055, now seen corresponding path program 1 times [2025-03-03 10:53:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254420623] [2025-03-03 10:53:56,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:56,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-03 10:53:56,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-03 10:53:56,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:56,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:53:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254420623] [2025-03-03 10:53:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254420623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:57,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:57,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:57,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665355581] [2025-03-03 10:53:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:57,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:57,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:57,256 INFO L87 Difference]: Start difference. First operand 6913 states and 7415 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:58,038 INFO L93 Difference]: Finished difference Result 16785 states and 18059 transitions. [2025-03-03 10:53:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 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 386 [2025-03-03 10:53:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:58,058 INFO L225 Difference]: With dead ends: 16785 [2025-03-03 10:53:58,059 INFO L226 Difference]: Without dead ends: 10203 [2025-03-03 10:53:58,065 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-03 10:53:58,065 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:58,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 45 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2025-03-03 10:53:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 9874. [2025-03-03 10:53:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 9873 states have (on average 1.0731287349336573) internal successors, (10595), 9873 states have internal predecessors, (10595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10595 transitions. [2025-03-03 10:53:58,176 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10595 transitions. Word has length 386 [2025-03-03 10:53:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:58,178 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 10595 transitions. [2025-03-03 10:53:58,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10595 transitions. [2025-03-03 10:53:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-03 10:53:58,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:58,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:58,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:53:58,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1420498165, now seen corresponding path program 1 times [2025-03-03 10:53:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440479785] [2025-03-03 10:53:58,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-03 10:53:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-03 10:53:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:58,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:53:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440479785] [2025-03-03 10:53:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440479785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:58,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337999670] [2025-03-03 10:53:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:58,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:58,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:58,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:58,417 INFO L87 Difference]: Start difference. First operand 9874 states and 10595 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:59,081 INFO L93 Difference]: Finished difference Result 23036 states and 24793 transitions. [2025-03-03 10:53:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 394 [2025-03-03 10:53:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:59,100 INFO L225 Difference]: With dead ends: 23036 [2025-03-03 10:53:59,101 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:53:59,109 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-03 10:53:59,110 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 294 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:59,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 40 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:53:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11848. [2025-03-03 10:53:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0697222925635181) internal successors, (12673), 11847 states have internal predecessors, (12673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12673 transitions. [2025-03-03 10:53:59,237 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12673 transitions. Word has length 394 [2025-03-03 10:53:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:59,238 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12673 transitions. [2025-03-03 10:53:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12673 transitions. [2025-03-03 10:53:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 10:53:59,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:59,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:53:59,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 912615740, now seen corresponding path program 1 times [2025-03-03 10:53:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233576441] [2025-03-03 10:53:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:59,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 10:53:59,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 10:53:59,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:59,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:53:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233576441] [2025-03-03 10:53:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233576441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:59,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342141114] [2025-03-03 10:53:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:59,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:59,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:59,484 INFO L87 Difference]: Start difference. First operand 11848 states and 12673 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:00,172 INFO L93 Difference]: Finished difference Result 25997 states and 27870 transitions. [2025-03-03 10:54:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:00,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 448 [2025-03-03 10:54:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:00,189 INFO L225 Difference]: With dead ends: 25997 [2025-03-03 10:54:00,189 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:54:00,199 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-03 10:54:00,203 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 279 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:00,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 435 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:54:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-03 10:54:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.063888285941683) internal successors, (14704), 13821 states have internal predecessors, (14704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14704 transitions. [2025-03-03 10:54:00,329 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14704 transitions. Word has length 448 [2025-03-03 10:54:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:00,330 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14704 transitions. [2025-03-03 10:54:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14704 transitions. [2025-03-03 10:54:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 10:54:00,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:00,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:54:00,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:00,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1254079447, now seen corresponding path program 1 times [2025-03-03 10:54:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293606631] [2025-03-03 10:54:00,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 10:54:00,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 10:54:00,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:00,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-03 10:54:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293606631] [2025-03-03 10:54:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293606631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857289244] [2025-03-03 10:54:00,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:00,795 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-03 10:54:00,798 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-03 10:54:00,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 10:54:00,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 10:54:00,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:00,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:00,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:54:00,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2025-03-03 10:54:01,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857289244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:54:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069549965] [2025-03-03 10:54:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:01,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:01,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:01,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:01,455 INFO L87 Difference]: Start difference. First operand 13822 states and 14704 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:01,979 INFO L93 Difference]: Finished difference Result 15798 states and 16730 transitions. [2025-03-03 10:54:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 509 [2025-03-03 10:54:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:01,997 INFO L225 Difference]: With dead ends: 15798 [2025-03-03 10:54:01,997 INFO L226 Difference]: Without dead ends: 15796 [2025-03-03 10:54:02,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:02,002 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:02,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-03 10:54:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 14151. [2025-03-03 10:54:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0630388692579504) internal successors, (15042), 14150 states have internal predecessors, (15042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 15042 transitions. [2025-03-03 10:54:02,136 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 15042 transitions. Word has length 509 [2025-03-03 10:54:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:02,138 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 15042 transitions. [2025-03-03 10:54:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 15042 transitions. [2025-03-03 10:54:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-03-03 10:54:02,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:02,147 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:02,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:54:02,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 300392895, now seen corresponding path program 1 times [2025-03-03 10:54:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555859297] [2025-03-03 10:54:02,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:02,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-03-03 10:54:02,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-03-03 10:54:02,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:02,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-03 10:54:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555859297] [2025-03-03 10:54:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555859297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877048943] [2025-03-03 10:54:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:02,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:02,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:02,985 INFO L87 Difference]: Start difference. First operand 14151 states and 15042 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:03,549 INFO L93 Difference]: Finished difference Result 28300 states and 30088 transitions. [2025-03-03 10:54:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 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 849 [2025-03-03 10:54:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:03,567 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:54:03,567 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:54:03,577 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-03 10:54:03,578 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:03,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 102 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:54:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-03 10:54:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.062089923337247) internal successors, (15378), 14479 states have internal predecessors, (15378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15378 transitions. [2025-03-03 10:54:03,774 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15378 transitions. Word has length 849 [2025-03-03 10:54:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:03,775 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15378 transitions. [2025-03-03 10:54:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15378 transitions. [2025-03-03 10:54:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-03-03 10:54:03,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:03,790 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:03,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:54:03,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:03,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -90749013, now seen corresponding path program 1 times [2025-03-03 10:54:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087808645] [2025-03-03 10:54:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-03 10:54:03,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-03 10:54:03,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:03,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-03 10:54:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087808645] [2025-03-03 10:54:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087808645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368860080] [2025-03-03 10:54:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:04,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:04,203 INFO L87 Difference]: Start difference. First operand 14480 states and 15378 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:04,743 INFO L93 Difference]: Finished difference Result 28300 states and 30087 transitions. [2025-03-03 10:54:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 857 [2025-03-03 10:54:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:04,756 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:54:04,757 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:54:04,766 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-03 10:54:04,767 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:04,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:54:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-03-03 10:54:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0454416961130741) internal successors, (14793), 14150 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14793 transitions. [2025-03-03 10:54:04,876 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14793 transitions. Word has length 857 [2025-03-03 10:54:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:04,876 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14793 transitions. [2025-03-03 10:54:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14793 transitions. [2025-03-03 10:54:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2025-03-03 10:54:04,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:04,886 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:54:04,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash -833068351, now seen corresponding path program 1 times [2025-03-03 10:54:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094342969] [2025-03-03 10:54:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 858 statements into 1 equivalence classes. [2025-03-03 10:54:04,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 858 of 858 statements. [2025-03-03 10:54:04,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:04,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-03 10:54:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094342969] [2025-03-03 10:54:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094342969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898417659] [2025-03-03 10:54:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:05,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:05,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:05,505 INFO L87 Difference]: Start difference. First operand 14151 states and 14793 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:06,063 INFO L93 Difference]: Finished difference Result 29945 states and 31355 transitions. [2025-03-03 10:54:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:06,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 858 [2025-03-03 10:54:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:06,078 INFO L225 Difference]: With dead ends: 29945 [2025-03-03 10:54:06,079 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:54:06,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03 10:54:06,089 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 206 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 54 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:54:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-03 10:54:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.045098158390567) internal successors, (17195), 16453 states have internal predecessors, (17195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17195 transitions. [2025-03-03 10:54:06,215 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17195 transitions. Word has length 858 [2025-03-03 10:54:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:06,216 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17195 transitions. [2025-03-03 10:54:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17195 transitions. [2025-03-03 10:54:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2025-03-03 10:54:06,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:06,226 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:54:06,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:06,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1696213924, now seen corresponding path program 1 times [2025-03-03 10:54:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968414090] [2025-03-03 10:54:06,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-03-03 10:54:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-03-03 10:54:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 526 proven. 660 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:54:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968414090] [2025-03-03 10:54:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968414090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184893924] [2025-03-03 10:54:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:07,156 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-03 10:54:07,158 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-03 10:54:07,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-03-03 10:54:07,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-03-03 10:54:07,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:07,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:07,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:54:07,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 715 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-03-03 10:54:07,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184893924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:54:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588243985] [2025-03-03 10:54:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:07,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:07,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:07,529 INFO L87 Difference]: Start difference. First operand 16454 states and 17195 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:08,110 INFO L93 Difference]: Finished difference Result 32248 states and 33721 transitions. [2025-03-03 10:54:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 912 [2025-03-03 10:54:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:08,123 INFO L225 Difference]: With dead ends: 32248 [2025-03-03 10:54:08,123 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:54:08,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:08,132 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 226 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:08,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:54:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16125. [2025-03-03 10:54:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0386380550731829) internal successors, (16747), 16124 states have internal predecessors, (16747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16747 transitions. [2025-03-03 10:54:08,253 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16747 transitions. Word has length 912 [2025-03-03 10:54:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16747 transitions. [2025-03-03 10:54:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16747 transitions. [2025-03-03 10:54:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-03-03 10:54:08,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:08,268 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, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:54:08,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:08,468 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-03 10:54:08,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:08,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1081982743, now seen corresponding path program 1 times [2025-03-03 10:54:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179138770] [2025-03-03 10:54:08,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:08,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-03-03 10:54:08,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-03-03 10:54:08,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:08,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2574 backedges. 1861 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-03 10:54:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179138770] [2025-03-03 10:54:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179138770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:54:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520606335] [2025-03-03 10:54:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:09,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:54:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:09,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:54:09,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:09,447 INFO L87 Difference]: Start difference. First operand 16125 states and 16747 transitions. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:10,462 INFO L93 Difference]: Finished difference Result 31591 states and 32826 transitions. [2025-03-03 10:54:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:54:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 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 1276 [2025-03-03 10:54:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:10,476 INFO L225 Difference]: With dead ends: 31591 [2025-03-03 10:54:10,476 INFO L226 Difference]: Without dead ends: 16126 [2025-03-03 10:54:10,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:54:10,486 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 209 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:10,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 572 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:54:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16126 states. [2025-03-03 10:54:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16126 to 16125. [2025-03-03 10:54:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0380178615728106) internal successors, (16737), 16124 states have internal predecessors, (16737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16737 transitions. [2025-03-03 10:54:10,603 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16737 transitions. Word has length 1276 [2025-03-03 10:54:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:10,603 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16737 transitions. [2025-03-03 10:54:10,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16737 transitions. [2025-03-03 10:54:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-03-03 10:54:10,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:10,618 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 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-03 10:54:10,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:54:10,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:10,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1912311585, now seen corresponding path program 1 times [2025-03-03 10:54:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:10,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049087057] [2025-03-03 10:54:10,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:10,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:10,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-03-03 10:54:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-03-03 10:54:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 1836 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 10:54:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049087057] [2025-03-03 10:54:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049087057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927978365] [2025-03-03 10:54:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:11,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:11,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:11,809 INFO L87 Difference]: Start difference. First operand 16125 states and 16737 transitions. Second operand has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:12,667 INFO L93 Difference]: Finished difference Result 31600 states and 32815 transitions. [2025-03-03 10:54:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:54:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 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 1290 [2025-03-03 10:54:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:12,682 INFO L225 Difference]: With dead ends: 31600 [2025-03-03 10:54:12,682 INFO L226 Difference]: Without dead ends: 16135 [2025-03-03 10:54:12,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:12,692 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:12,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 443 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:54:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2025-03-03 10:54:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 15796. [2025-03-03 10:54:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0381133270022158) internal successors, (16397), 15795 states have internal predecessors, (16397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16397 transitions. [2025-03-03 10:54:12,799 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16397 transitions. Word has length 1290 [2025-03-03 10:54:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:12,799 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16397 transitions. [2025-03-03 10:54:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16397 transitions. [2025-03-03 10:54:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-03-03 10:54:12,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:12,813 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:54:12,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:54:12,814 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:12,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 889143746, now seen corresponding path program 1 times [2025-03-03 10:54:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691668712] [2025-03-03 10:54:12,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-03-03 10:54:12,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-03-03 10:54:12,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:12,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 1793 proven. 0 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-03 10:54:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691668712] [2025-03-03 10:54:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691668712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:13,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285419258] [2025-03-03 10:54:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:13,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:13,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:13,637 INFO L87 Difference]: Start difference. First operand 15796 states and 16397 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 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-03 10:54:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:14,164 INFO L93 Difference]: Finished difference Result 31590 states and 32795 transitions. [2025-03-03 10:54:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 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 1305 [2025-03-03 10:54:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:14,177 INFO L225 Difference]: With dead ends: 31590 [2025-03-03 10:54:14,177 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:54:14,185 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-03 10:54:14,186 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 225 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:14,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 437 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:54:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-03 10:54:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0368321886586034) internal successors, (17059), 16453 states have internal predecessors, (17059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17059 transitions. [2025-03-03 10:54:14,372 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17059 transitions. Word has length 1305 [2025-03-03 10:54:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17059 transitions. [2025-03-03 10:54:14,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 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-03 10:54:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17059 transitions. [2025-03-03 10:54:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2025-03-03 10:54:14,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:14,385 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:54:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:54:14,386 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 424968460, now seen corresponding path program 1 times [2025-03-03 10:54:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223216857] [2025-03-03 10:54:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:14,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1330 statements into 1 equivalence classes. [2025-03-03 10:54:14,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1330 of 1330 statements. [2025-03-03 10:54:14,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:14,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 1969 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-03-03 10:54:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:15,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223216857] [2025-03-03 10:54:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223216857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946666919] [2025-03-03 10:54:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:15,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:15,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:15,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:15,283 INFO L87 Difference]: Start difference. First operand 16454 states and 17059 transitions. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:16,035 INFO L93 Difference]: Finished difference Result 32248 states and 33449 transitions. [2025-03-03 10:54:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:54:16,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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 1330 [2025-03-03 10:54:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:16,049 INFO L225 Difference]: With dead ends: 32248 [2025-03-03 10:54:16,049 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:54:16,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:16,057 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:16,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 563 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:54:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-03 10:54:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0361028383881359) internal successors, (17047), 16453 states have internal predecessors, (17047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17047 transitions. [2025-03-03 10:54:16,178 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17047 transitions. Word has length 1330 [2025-03-03 10:54:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17047 transitions. [2025-03-03 10:54:16,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17047 transitions. [2025-03-03 10:54:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2025-03-03 10:54:16,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:16,192 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:16,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:54:16,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -126331913, now seen corresponding path program 1 times [2025-03-03 10:54:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364894854] [2025-03-03 10:54:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:16,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1359 statements into 1 equivalence classes. [2025-03-03 10:54:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1359 of 1359 statements. [2025-03-03 10:54:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3199 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-03 10:54:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364894854] [2025-03-03 10:54:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364894854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:16,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:54:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353903383] [2025-03-03 10:54:16,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:54:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:16,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:54:16,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:16,973 INFO L87 Difference]: Start difference. First operand 16454 states and 17047 transitions. Second operand has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:17,580 INFO L93 Difference]: Finished difference Result 31978 states and 33151 transitions. [2025-03-03 10:54:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:54:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 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 1359 [2025-03-03 10:54:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:17,595 INFO L225 Difference]: With dead ends: 31978 [2025-03-03 10:54:17,595 INFO L226 Difference]: Without dead ends: 16125 [2025-03-03 10:54:17,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:17,603 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:17,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 465 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-03-03 10:54:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2025-03-03 10:54:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0354130488712479) internal successors, (16695), 16124 states have internal predecessors, (16695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16695 transitions. [2025-03-03 10:54:17,731 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16695 transitions. Word has length 1359 [2025-03-03 10:54:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16695 transitions. [2025-03-03 10:54:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16695 transitions. [2025-03-03 10:54:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1575 [2025-03-03 10:54:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:17,749 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:54:17,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:17,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1345900466, now seen corresponding path program 1 times [2025-03-03 10:54:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323222933] [2025-03-03 10:54:17,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:17,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1574 statements into 1 equivalence classes. [2025-03-03 10:54:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1574 of 1574 statements. [2025-03-03 10:54:17,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:17,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4378 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2025-03-03 10:54:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323222933] [2025-03-03 10:54:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323222933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047150765] [2025-03-03 10:54:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:18,490 INFO L87 Difference]: Start difference. First operand 16125 states and 16695 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:19,398 INFO L93 Difference]: Finished difference Result 33898 states and 35119 transitions. [2025-03-03 10:54:19,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:54:19,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 1574 [2025-03-03 10:54:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:19,400 INFO L225 Difference]: With dead ends: 33898 [2025-03-03 10:54:19,400 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:54:19,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:19,412 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 610 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:19,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 41 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:54:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:54:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:54:19,413 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-03 10:54:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:54:19,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1574 [2025-03-03 10:54:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:19,413 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:54:19,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:54:19,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:54:19,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:54:19,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:54:19,417 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] [2025-03-03 10:54:19,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:54:20,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:54:20,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:54:20 BoogieIcfgContainer [2025-03-03 10:54:20,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:54:20,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:54:20,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:54:20,108 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:54:20,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:48" (3/4) ... [2025-03-03 10:54:20,110 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:54:20,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:54:20,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:54:20,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:54:20,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:54:20,254 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:54:20,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:54:20,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:54:20,257 INFO L158 Benchmark]: Toolchain (without parser) took 34647.62ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 108.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,257 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:54:20,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.71ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 49.1MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.84ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 90.1MB in the end (delta: -41.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,258 INFO L158 Benchmark]: Boogie Preprocessor took 142.32ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 56.6MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,258 INFO L158 Benchmark]: IcfgBuilder took 1829.67ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.6MB in the beginning and 98.5MB in the end (delta: -41.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,259 INFO L158 Benchmark]: TraceAbstraction took 31768.00ms. Allocated memory was 285.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 97.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 847.3MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,259 INFO L158 Benchmark]: Witness Printer took 148.26ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:54:20,260 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.61ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.71ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 49.1MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.84ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 90.1MB in the end (delta: -41.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.32ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 56.6MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1829.67ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.6MB in the beginning and 98.5MB in the end (delta: -41.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31768.00ms. Allocated memory was 285.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 97.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 847.3MB. Max. memory is 16.1GB. * Witness Printer took 148.26ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. 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: 182]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5532 SdHoareTripleChecker+Valid, 15.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5532 mSDsluCounter, 5165 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 2744 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20698 IncrementalHoareTripleChecker+Invalid, 23442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2744 mSolverCounterUnsat, 4757 mSDtfsCounter, 20698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1495 GetRequests, 1455 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16454occurred in iteration=13, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 5933 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 15768 NumberOfCodeBlocks, 15768 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 15746 ConstructedInterpolants, 0 QuantifiedInterpolants, 37853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 27215/27911 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: 1783]: Location Invariant Derived location invariant: (((((((((((((a16 == 10) && (a12 == 8)) && (a15 == 3)) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 8))) || ((a12 <= 7) && (a16 <= 11))) || (((a12 == 9) && (a16 != 10)) && (a16 <= 11))) || ((a12 == 9) && (a15 <= 3))) || ((((a16 == 9) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a15 == 3))) || (((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a12 <= 7))) || (((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (a15 <= 3))) || (((((a16 != 10) && (a12 == 8)) && (0 <= ((long long) a18 + 155))) && (a16 <= 11)) && (4 <= a15))) || (((a16 <= 8) && (a12 == 8)) && (4 <= a15))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:54:20,277 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