./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label48.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/Problem01_label48.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 1479ddd90ec2fcde77d063083da596ee818d8098bb47b0581d7cfb4606042d51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:48:29,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:48:29,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:48:29,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:48:29,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:48:29,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:48:29,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:48:29,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:48:29,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:48:29,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:48:29,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:48:29,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:48:29,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:48:29,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:48:29,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:48:29,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:48:29,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:48:29,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:48:29,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:29,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:48:29,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:48:29,440 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 -> 1479ddd90ec2fcde77d063083da596ee818d8098bb47b0581d7cfb4606042d51 [2025-03-03 09:48:29,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:48:29,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:48:29,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:48:29,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:48:29,666 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:48:29,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2025-03-03 09:48:30,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4535a41e/6c82c78448d2499c9bc8ae225f81de6b/FLAG073532b08 [2025-03-03 09:48:31,180 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:48:31,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2025-03-03 09:48:31,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4535a41e/6c82c78448d2499c9bc8ae225f81de6b/FLAG073532b08 [2025-03-03 09:48:31,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4535a41e/6c82c78448d2499c9bc8ae225f81de6b [2025-03-03 09:48:31,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:48:31,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:48:31,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:31,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:48:31,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:48:31,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31, skipping insertion in model container [2025-03-03 09:48:31,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:48:31,639 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/Problem01_label48.c[20593,20606] [2025-03-03 09:48:31,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:31,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:48:31,701 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/Problem01_label48.c[20593,20606] [2025-03-03 09:48:31,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:31,726 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:48:31,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31 WrapperNode [2025-03-03 09:48:31,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:31,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:31,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:48:31,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:48:31,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,798 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-03 09:48:31,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:31,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:48:31,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:48:31,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:48:31,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,836 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 09:48:31,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:48:31,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:48:31,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:48:31,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:48:31,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (1/1) ... [2025-03-03 09:48:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:31,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:31,901 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 09:48:31,907 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 09:48:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:48:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:48:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:48:31,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:48:31,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:48:31,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:48:32,711 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 09:48:32,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:48:32,722 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:48:32,722 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:48:32,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:32 BoogieIcfgContainer [2025-03-03 09:48:32,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:48:32,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:48:32,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:48:32,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:48:32,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:48:31" (1/3) ... [2025-03-03 09:48:32,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce84a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:32, skipping insertion in model container [2025-03-03 09:48:32,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:31" (2/3) ... [2025-03-03 09:48:32,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce84a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:32, skipping insertion in model container [2025-03-03 09:48:32,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:32" (3/3) ... [2025-03-03 09:48:32,731 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2025-03-03 09:48:32,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:48:32,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label48.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:48:32,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:48:32,793 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;@71e01b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:48:32,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:48:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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 09:48:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 09:48:32,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:32,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:32,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:32,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1166810036, now seen corresponding path program 1 times [2025-03-03 09:48:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561762065] [2025-03-03 09:48:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:32,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 09:48:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 09:48:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:33,328 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 09:48:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561762065] [2025-03-03 09:48:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561762065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210133197] [2025-03-03 09:48:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:33,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:33,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:33,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:33,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:33,358 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 09:48:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:33,934 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-03-03 09:48:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 09:48:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:33,942 INFO L225 Difference]: With dead ends: 528 [2025-03-03 09:48:33,943 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 09:48:33,947 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 09:48:33,949 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 51 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:33,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 09:48:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-03 09:48:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 09:48:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-03-03 09:48:33,990 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 121 [2025-03-03 09:48:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:33,991 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-03-03 09:48:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 09:48:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-03-03 09:48:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 09:48:33,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:33,998 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:48:33,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:48:33,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:33,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1724744490, now seen corresponding path program 1 times [2025-03-03 09:48:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568543859] [2025-03-03 09:48:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 09:48:34,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 09:48:34,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:34,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:34,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568543859] [2025-03-03 09:48:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568543859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:34,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65460435] [2025-03-03 09:48:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:34,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:34,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:34,144 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:48:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:34,513 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-03-03 09:48:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 09:48:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:34,516 INFO L225 Difference]: With dead ends: 792 [2025-03-03 09:48:34,516 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 09:48:34,516 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 09:48:34,517 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:34,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 09:48:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-03 09:48:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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 09:48:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2025-03-03 09:48:34,553 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 127 [2025-03-03 09:48:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2025-03-03 09:48:34,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:48:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2025-03-03 09:48:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 09:48:34,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:34,561 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:48:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:48:34,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 720150389, now seen corresponding path program 1 times [2025-03-03 09:48:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303055479] [2025-03-03 09:48:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 09:48:34,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 09:48:34,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:34,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:34,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:34,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303055479] [2025-03-03 09:48:34,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303055479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042034638] [2025-03-03 09:48:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:34,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:34,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:34,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:34,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:34,975 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:48:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:35,486 INFO L93 Difference]: Finished difference Result 1411 states and 1882 transitions. [2025-03-03 09:48:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-03 09:48:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:35,489 INFO L225 Difference]: With dead ends: 1411 [2025-03-03 09:48:35,489 INFO L226 Difference]: Without dead ends: 790 [2025-03-03 09:48:35,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:35,491 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:35,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 80 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-03 09:48:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-03 09:48:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.1634980988593155) internal successors, (918), 789 states have internal predecessors, (918), 0 states have call successors, (0), 0 states 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 09:48:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 918 transitions. [2025-03-03 09:48:35,508 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 918 transitions. Word has length 128 [2025-03-03 09:48:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:35,508 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 918 transitions. [2025-03-03 09:48:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:48:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 918 transitions. [2025-03-03 09:48:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 09:48:35,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:35,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:48:35,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:35,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash -319746824, now seen corresponding path program 1 times [2025-03-03 09:48:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772075474] [2025-03-03 09:48:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:35,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 09:48:35,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 09:48:35,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:35,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:48:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772075474] [2025-03-03 09:48:35,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772075474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:35,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:35,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972782615] [2025-03-03 09:48:35,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:35,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:35,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:35,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:35,669 INFO L87 Difference]: Start difference. First operand 790 states and 918 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 09:48:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:35,987 INFO L93 Difference]: Finished difference Result 1578 states and 1859 transitions. [2025-03-03 09:48:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-03 09:48:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:35,990 INFO L225 Difference]: With dead ends: 1578 [2025-03-03 09:48:35,990 INFO L226 Difference]: Without dead ends: 921 [2025-03-03 09:48:35,991 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 09:48:35,992 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:35,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-03 09:48:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2025-03-03 09:48:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1532608695652173) internal successors, (1061), 920 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states 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 09:48:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1061 transitions. [2025-03-03 09:48:36,012 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1061 transitions. Word has length 133 [2025-03-03 09:48:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:36,013 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1061 transitions. [2025-03-03 09:48:36,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 09:48:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1061 transitions. [2025-03-03 09:48:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 09:48:36,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:36,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:36,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:48:36,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:36,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1347091844, now seen corresponding path program 1 times [2025-03-03 09:48:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:36,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271018562] [2025-03-03 09:48:36,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 09:48:36,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 09:48:36,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:48:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271018562] [2025-03-03 09:48:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271018562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165737974] [2025-03-03 09:48:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:36,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:36,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:36,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:36,091 INFO L87 Difference]: Start difference. First operand 921 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 09:48:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:36,382 INFO L93 Difference]: Finished difference Result 2364 states and 2732 transitions. [2025-03-03 09:48:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 09:48:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:36,387 INFO L225 Difference]: With dead ends: 2364 [2025-03-03 09:48:36,387 INFO L226 Difference]: Without dead ends: 1576 [2025-03-03 09:48:36,388 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 09:48:36,389 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:36,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 19 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-03 09:48:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2025-03-03 09:48:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1505922165820643) internal successors, (1360), 1182 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 09:48:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1360 transitions. [2025-03-03 09:48:36,408 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1360 transitions. Word has length 142 [2025-03-03 09:48:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1360 transitions. [2025-03-03 09:48:36,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 09:48:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1360 transitions. [2025-03-03 09:48:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 09:48:36,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:36,411 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:48:36,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:36,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1666364301, now seen corresponding path program 1 times [2025-03-03 09:48:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681128543] [2025-03-03 09:48:36,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:36,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 09:48:36,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 09:48:36,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:48:36,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:36,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681128543] [2025-03-03 09:48:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681128543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309602869] [2025-03-03 09:48:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:36,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:36,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:36,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:36,537 INFO L87 Difference]: Start difference. First operand 1183 states and 1360 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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 09:48:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:36,984 INFO L93 Difference]: Finished difference Result 2495 states and 2925 transitions. [2025-03-03 09:48:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 148 [2025-03-03 09:48:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:36,988 INFO L225 Difference]: With dead ends: 2495 [2025-03-03 09:48:36,988 INFO L226 Difference]: Without dead ends: 1445 [2025-03-03 09:48:36,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:36,990 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:36,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 34 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-03-03 09:48:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-03-03 09:48:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.144736842105263) internal successors, (1653), 1444 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states 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 09:48:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1653 transitions. [2025-03-03 09:48:37,010 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1653 transitions. Word has length 148 [2025-03-03 09:48:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1653 transitions. [2025-03-03 09:48:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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 09:48:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1653 transitions. [2025-03-03 09:48:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 09:48:37,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:37,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:48:37,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1404529162, now seen corresponding path program 1 times [2025-03-03 09:48:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:37,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827775972] [2025-03-03 09:48:37,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:37,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 09:48:37,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 09:48:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:48:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827775972] [2025-03-03 09:48:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827775972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805801216] [2025-03-03 09:48:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:37,154 INFO L87 Difference]: Start difference. First operand 1445 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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 09:48:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:37,641 INFO L93 Difference]: Finished difference Result 3281 states and 3775 transitions. [2025-03-03 09:48:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:37,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 162 [2025-03-03 09:48:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:37,647 INFO L225 Difference]: With dead ends: 3281 [2025-03-03 09:48:37,647 INFO L226 Difference]: Without dead ends: 1969 [2025-03-03 09:48:37,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:37,649 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 347 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:37,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 42 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-03 09:48:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-03 09:48:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.136091453456723) internal successors, (2087), 1837 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states 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 09:48:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2087 transitions. [2025-03-03 09:48:37,677 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2087 transitions. Word has length 162 [2025-03-03 09:48:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2087 transitions. [2025-03-03 09:48:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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 09:48:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2087 transitions. [2025-03-03 09:48:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 09:48:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:37,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:37,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:48:37,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1356591038, now seen corresponding path program 1 times [2025-03-03 09:48:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920955630] [2025-03-03 09:48:37,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:37,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 09:48:37,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 09:48:37,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:37,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920955630] [2025-03-03 09:48:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920955630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:48:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117400218] [2025-03-03 09:48:37,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:37,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:37,898 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 09:48:37,900 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 09:48:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 09:48:37,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 09:48:37,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:37,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:37,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:48:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:48:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:48:38,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:48:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117400218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:48:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:48:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233406731] [2025-03-03 09:48:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:38,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:38,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:48:38,126 INFO L87 Difference]: Start difference. First operand 1838 states and 2087 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 09:48:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:38,420 INFO L93 Difference]: Finished difference Result 3936 states and 4472 transitions. [2025-03-03 09:48:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 179 [2025-03-03 09:48:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:38,428 INFO L225 Difference]: With dead ends: 3936 [2025-03-03 09:48:38,429 INFO L226 Difference]: Without dead ends: 1969 [2025-03-03 09:48:38,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:48:38,431 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:38,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 173 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-03 09:48:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2025-03-03 09:48:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.0955451348182883) internal successors, (1869), 1706 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states 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 09:48:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1869 transitions. [2025-03-03 09:48:38,460 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1869 transitions. Word has length 179 [2025-03-03 09:48:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1869 transitions. [2025-03-03 09:48:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 09:48:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1869 transitions. [2025-03-03 09:48:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 09:48:38,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:38,463 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:38,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:48:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:38,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2092795103, now seen corresponding path program 1 times [2025-03-03 09:48:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262223828] [2025-03-03 09:48:38,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:38,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 09:48:38,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 09:48:38,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:38,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262223828] [2025-03-03 09:48:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262223828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:48:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147688409] [2025-03-03 09:48:38,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:38,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:38,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:38,896 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 09:48:38,898 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 09:48:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 09:48:38,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 09:48:38,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:38,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:38,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:48:38,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:48:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:48:39,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:48:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147688409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:39,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:48:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:48:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218290469] [2025-03-03 09:48:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:39,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:48:39,116 INFO L87 Difference]: Start difference. First operand 1707 states and 1869 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 09:48:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:39,409 INFO L93 Difference]: Finished difference Result 3412 states and 3754 transitions. [2025-03-03 09:48:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 184 [2025-03-03 09:48:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:39,414 INFO L225 Difference]: With dead ends: 3412 [2025-03-03 09:48:39,414 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 09:48:39,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:48:39,416 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:39,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 164 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 09:48:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2025-03-03 09:48:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.074792243767313) internal successors, (1552), 1444 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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 09:48:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1552 transitions. [2025-03-03 09:48:39,437 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1552 transitions. Word has length 184 [2025-03-03 09:48:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:39,437 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1552 transitions. [2025-03-03 09:48:39,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 09:48:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1552 transitions. [2025-03-03 09:48:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 09:48:39,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:39,439 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:39,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:48:39,640 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,SelfDestructingSolverStorable8 [2025-03-03 09:48:39,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -311236877, now seen corresponding path program 1 times [2025-03-03 09:48:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342813474] [2025-03-03 09:48:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 09:48:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 09:48:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:48:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342813474] [2025-03-03 09:48:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342813474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310227304] [2025-03-03 09:48:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:39,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:39,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:39,816 INFO L87 Difference]: Start difference. First operand 1445 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 09:48:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:40,107 INFO L93 Difference]: Finished difference Result 3019 states and 3253 transitions. [2025-03-03 09:48:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 222 [2025-03-03 09:48:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:40,112 INFO L225 Difference]: With dead ends: 3019 [2025-03-03 09:48:40,112 INFO L226 Difference]: Without dead ends: 1576 [2025-03-03 09:48:40,114 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 09:48:40,114 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:40,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 38 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-03 09:48:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2025-03-03 09:48:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.080332409972299) internal successors, (1560), 1444 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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 09:48:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1560 transitions. [2025-03-03 09:48:40,138 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1560 transitions. Word has length 222 [2025-03-03 09:48:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:40,138 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1560 transitions. [2025-03-03 09:48:40,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 09:48:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1560 transitions. [2025-03-03 09:48:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 09:48:40,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:40,141 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:48:40,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -8454071, now seen corresponding path program 1 times [2025-03-03 09:48:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419790826] [2025-03-03 09:48:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:40,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 09:48:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 09:48:40,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:40,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 09:48:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419790826] [2025-03-03 09:48:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419790826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639098311] [2025-03-03 09:48:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:40,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:40,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:40,276 INFO L87 Difference]: Start difference. First operand 1445 states and 1560 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 09:48:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:40,580 INFO L93 Difference]: Finished difference Result 3150 states and 3415 transitions. [2025-03-03 09:48:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 265 [2025-03-03 09:48:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:40,585 INFO L225 Difference]: With dead ends: 3150 [2025-03-03 09:48:40,585 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 09:48:40,587 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 09:48:40,588 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:40,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 178 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 09:48:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-03-03 09:48:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.0726846424384526) internal successors, (1830), 1706 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 09:48:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1830 transitions. [2025-03-03 09:48:40,609 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1830 transitions. Word has length 265 [2025-03-03 09:48:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1830 transitions. [2025-03-03 09:48:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 09:48:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1830 transitions. [2025-03-03 09:48:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 09:48:40,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:40,612 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:48:40,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 878263090, now seen corresponding path program 1 times [2025-03-03 09:48:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479627431] [2025-03-03 09:48:40,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:40,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 09:48:40,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 09:48:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 09:48:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479627431] [2025-03-03 09:48:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479627431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337680220] [2025-03-03 09:48:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:40,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:40,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:40,710 INFO L87 Difference]: Start difference. First operand 1707 states and 1830 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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 09:48:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:40,979 INFO L93 Difference]: Finished difference Result 3412 states and 3676 transitions. [2025-03-03 09:48:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 278 [2025-03-03 09:48:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:40,984 INFO L225 Difference]: With dead ends: 3412 [2025-03-03 09:48:40,984 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 09:48:40,986 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 09:48:40,986 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:40,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 169 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 09:48:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-03 09:48:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0669569951007076) internal successors, (1960), 1837 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states 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 09:48:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1960 transitions. [2025-03-03 09:48:41,010 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1960 transitions. Word has length 278 [2025-03-03 09:48:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:41,010 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1960 transitions. [2025-03-03 09:48:41,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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 09:48:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1960 transitions. [2025-03-03 09:48:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-03 09:48:41,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:41,014 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:48:41,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 382929042, now seen corresponding path program 1 times [2025-03-03 09:48:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120655171] [2025-03-03 09:48:41,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:41,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 09:48:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 09:48:41,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:41,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 246 proven. 84 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:48:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120655171] [2025-03-03 09:48:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120655171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:48:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020051883] [2025-03-03 09:48:41,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:41,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:41,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:48:41,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:48:41,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 09:48:41,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 09:48:41,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:41,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:41,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:48:41,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:48:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-03 09:48:41,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:48:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020051883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:48:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 09:48:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739385569] [2025-03-03 09:48:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:41,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:41,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:48:41,595 INFO L87 Difference]: Start difference. First operand 1838 states and 1960 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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 09:48:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:41,875 INFO L93 Difference]: Finished difference Result 4065 states and 4356 transitions. [2025-03-03 09:48:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 287 [2025-03-03 09:48:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:41,876 INFO L225 Difference]: With dead ends: 4065 [2025-03-03 09:48:41,876 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:48:41,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:48:41,879 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:41,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:48:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:48:41,881 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 09:48:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:48:41,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2025-03-03 09:48:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:41,881 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:48:41,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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 09:48:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:48:41,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:48:41,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:48:41,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:48:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:42,087 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:42,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:48:42,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:48:42,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:48:42 BoogieIcfgContainer [2025-03-03 09:48:42,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:48:42,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:48:42,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:48:42,401 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:48:42,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:32" (3/4) ... [2025-03-03 09:48:42,403 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:48:42,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:48:42,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:48:42,421 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:48:42,421 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:48:42,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:48:42,526 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:48:42,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:48:42,526 INFO L158 Benchmark]: Toolchain (without parser) took 11101.16ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 110.1MB in the beginning and 469.6MB in the end (delta: -359.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,527 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:42,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.46ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 82.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.39ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 77.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,527 INFO L158 Benchmark]: Boogie Preprocessor took 65.75ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,527 INFO L158 Benchmark]: IcfgBuilder took 857.12ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 57.6MB in the end (delta: 15.7MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,528 INFO L158 Benchmark]: TraceAbstraction took 9674.37ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 56.8MB in the beginning and 481.9MB in the end (delta: -425.0MB). Peak memory consumption was 205.5MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,528 INFO L158 Benchmark]: Witness Printer took 125.38ms. Allocated memory is still 545.3MB. Free memory was 481.9MB in the beginning and 469.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:42,529 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.46ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 82.5MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.39ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 77.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.75ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 857.12ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 57.6MB in the end (delta: 15.7MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9674.37ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 56.8MB in the beginning and 481.9MB in the end (delta: -425.0MB). Peak memory consumption was 205.5MB. Max. memory is 16.1GB. * Witness Printer took 125.38ms. Allocated memory is still 545.3MB. Free memory was 481.9MB in the beginning and 469.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. 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: 549]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1522 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1522 mSDsluCounter, 1239 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4657 IncrementalHoareTripleChecker+Invalid, 5366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 1160 mSDtfsCounter, 4657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3026 NumberOfCodeBlocks, 3026 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3010 ConstructedInterpolants, 0 QuantifiedInterpolants, 8608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1172 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1925/2030 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: 593]: Location Invariant Derived location invariant: ((((((((((((((((a20 != 1) && (6 <= a16)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8)) || (((a8 <= 13) && (a16 <= 4)) && (a20 == 1))) || (((a8 <= 13) && (a21 == 1)) && (a20 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 4))) || (((a8 <= 13) && (a17 == 1)) && (a20 == 1))) || (((a17 <= 0) && (a21 == 1)) && (15 <= a8))) || (((a8 <= 13) && (a17 <= 0)) && (a20 == 1))) || ((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) || (((((a20 != 1) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || ((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:48:42,548 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