./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label52.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/Problem02_label52.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 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:49:33,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:49:33,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:49:33,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:49:33,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:49:33,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:49:33,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:49:33,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:49:33,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:49:33,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:49:33,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:49:33,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:49:33,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:49:33,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:49:33,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:49:33,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:33,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:49:33,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:49:33,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:49:33,199 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 -> 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 [2025-03-03 09:49:33,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:49:33,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:49:33,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:49:33,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:49:33,430 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:49:33,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2025-03-03 09:49:34,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bbd3544/8fdff99023d1438599238502cc4b69f2/FLAGfffc26b63 [2025-03-03 09:49:34,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:49:34,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2025-03-03 09:49:34,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bbd3544/8fdff99023d1438599238502cc4b69f2/FLAGfffc26b63 [2025-03-03 09:49:35,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bbd3544/8fdff99023d1438599238502cc4b69f2 [2025-03-03 09:49:35,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:49:35,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:49:35,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:35,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:49:35,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:49:35,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2f2612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35, skipping insertion in model container [2025-03-03 09:49:35,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:49:35,371 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/Problem02_label52.c[17244,17257] [2025-03-03 09:49:35,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:35,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:49:35,464 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/Problem02_label52.c[17244,17257] [2025-03-03 09:49:35,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:35,492 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:49:35,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35 WrapperNode [2025-03-03 09:49:35,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:35,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:35,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:49:35,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:49:35,498 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:49:35" (1/1) ... [2025-03-03 09:49:35,512 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:49:35" (1/1) ... [2025-03-03 09:49:35,541 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-03 09:49:35,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:35,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:49:35,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:49:35,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:49:35,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,572 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:49:35,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:49:35,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:49:35,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:49:35,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:49:35,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (1/1) ... [2025-03-03 09:49:35,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:35,629 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:49:35,636 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:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:49:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:49:35,709 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:49:35,711 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:49:36,498 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 09:49:36,498 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:49:36,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:49:36,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:49:36,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:36 BoogieIcfgContainer [2025-03-03 09:49:36,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:49:36,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:49:36,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:49:36,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:49:36,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:35" (1/3) ... [2025-03-03 09:49:36,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dc8aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:36, skipping insertion in model container [2025-03-03 09:49:36,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:35" (2/3) ... [2025-03-03 09:49:36,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dc8aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:36, skipping insertion in model container [2025-03-03 09:49:36,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:36" (3/3) ... [2025-03-03 09:49:36,520 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label52.c [2025-03-03 09:49:36,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:49:36,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label52.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:49:36,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:49:36,585 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;@72993d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:49:36,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:49:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:49:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 09:49:36,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:36,598 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] [2025-03-03 09:49:36,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1454828776, now seen corresponding path program 1 times [2025-03-03 09:49:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236266451] [2025-03-03 09:49:36,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:36,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 09:49:36,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 09:49:36,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:36,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:36,984 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:49:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236266451] [2025-03-03 09:49:36,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236266451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:36,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:36,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91666732] [2025-03-03 09:49:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:36,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:37,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:37,009 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 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 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:49:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:37,630 INFO L93 Difference]: Finished difference Result 601 states and 1032 transitions. [2025-03-03 09:49:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-03 09:49:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:37,641 INFO L225 Difference]: With dead ends: 601 [2025-03-03 09:49:37,641 INFO L226 Difference]: Without dead ends: 310 [2025-03-03 09:49:37,645 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:49:37,649 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:37,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:49:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-03 09:49:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-03-03 09:49:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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:49:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2025-03-03 09:49:37,684 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 104 [2025-03-03 09:49:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:37,684 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2025-03-03 09:49:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:49:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2025-03-03 09:49:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 09:49:37,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:37,687 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:49:37,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:49:37,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1441962531, now seen corresponding path program 1 times [2025-03-03 09:49:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128856052] [2025-03-03 09:49:37,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:37,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 09:49:37,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 09:49:37,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:37,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128856052] [2025-03-03 09:49:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128856052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87203055] [2025-03-03 09:49:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:37,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:37,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:37,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:37,867 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:49:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:38,246 INFO L93 Difference]: Finished difference Result 913 states and 1314 transitions. [2025-03-03 09:49:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-03 09:49:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:38,249 INFO L225 Difference]: With dead ends: 913 [2025-03-03 09:49:38,249 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 09:49:38,250 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:49:38,251 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 97 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:49:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 09:49:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 598. [2025-03-03 09:49:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3969849246231156) internal successors, (834), 597 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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:49:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 834 transitions. [2025-03-03 09:49:38,271 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 834 transitions. Word has length 122 [2025-03-03 09:49:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:38,271 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 834 transitions. [2025-03-03 09:49:38,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:49:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions. [2025-03-03 09:49:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 09:49:38,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:38,274 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:49:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:49:38,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:38,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1007807293, now seen corresponding path program 1 times [2025-03-03 09:49:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894668662] [2025-03-03 09:49:38,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 09:49:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 09:49:38,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:38,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:38,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894668662] [2025-03-03 09:49:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894668662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:38,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734865688] [2025-03-03 09:49:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:38,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:38,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:38,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:38,404 INFO L87 Difference]: Start difference. First operand 598 states and 834 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:38,770 INFO L93 Difference]: Finished difference Result 1771 states and 2477 transitions. [2025-03-03 09:49:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:38,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-03 09:49:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:38,778 INFO L225 Difference]: With dead ends: 1771 [2025-03-03 09:49:38,778 INFO L226 Difference]: Without dead ends: 1175 [2025-03-03 09:49:38,779 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:49:38,779 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 185 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:38,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 119 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-03 09:49:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2025-03-03 09:49:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.3458262350936967) internal successors, (1580), 1174 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states 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:49:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1580 transitions. [2025-03-03 09:49:38,807 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1580 transitions. Word has length 123 [2025-03-03 09:49:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:38,809 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1580 transitions. [2025-03-03 09:49:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1580 transitions. [2025-03-03 09:49:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 09:49:38,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:38,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 09:49:38,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:49:38,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -522749882, now seen corresponding path program 1 times [2025-03-03 09:49:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:38,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096829497] [2025-03-03 09:49:38,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:38,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 09:49:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 09:49:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096829497] [2025-03-03 09:49:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096829497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:38,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692737995] [2025-03-03 09:49:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:38,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:38,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:38,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:38,953 INFO L87 Difference]: Start difference. First operand 1175 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:49:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:39,314 INFO L93 Difference]: Finished difference Result 3468 states and 4670 transitions. [2025-03-03 09:49:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-03 09:49:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:39,320 INFO L225 Difference]: With dead ends: 3468 [2025-03-03 09:49:39,320 INFO L226 Difference]: Without dead ends: 2295 [2025-03-03 09:49:39,322 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:49:39,322 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:39,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 88 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-03-03 09:49:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2025-03-03 09:49:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2903225806451613) internal successors, (2960), 2294 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states 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:49:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2960 transitions. [2025-03-03 09:49:39,354 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2960 transitions. Word has length 126 [2025-03-03 09:49:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:39,355 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2960 transitions. [2025-03-03 09:49:39,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:49:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2960 transitions. [2025-03-03 09:49:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 09:49:39,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:39,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:49:39,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:39,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash 138921238, now seen corresponding path program 1 times [2025-03-03 09:49:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:39,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628481428] [2025-03-03 09:49:39,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:39,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 09:49:39,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 09:49:39,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:39,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628481428] [2025-03-03 09:49:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628481428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:49:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515199454] [2025-03-03 09:49:39,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:49:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:39,723 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:49:39,725 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:49:39,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 09:49:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 09:49:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:39,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:49:39,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:49:39,922 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:49:39,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:49:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515199454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:49:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:49:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922540452] [2025-03-03 09:49:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:39,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:39,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:49:39,924 INFO L87 Difference]: Start difference. First operand 2295 states and 2960 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:49:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:40,295 INFO L93 Difference]: Finished difference Result 5987 states and 7669 transitions. [2025-03-03 09:49:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 131 [2025-03-03 09:49:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:40,302 INFO L225 Difference]: With dead ends: 5987 [2025-03-03 09:49:40,302 INFO L226 Difference]: Without dead ends: 2144 [2025-03-03 09:49:40,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:49:40,306 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 42 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:40,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 275 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2025-03-03 09:49:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2144. [2025-03-03 09:49:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2143 states have (on average 1.2417172188520764) internal successors, (2661), 2143 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states 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:49:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2661 transitions. [2025-03-03 09:49:40,358 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2661 transitions. Word has length 131 [2025-03-03 09:49:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:40,359 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 2661 transitions. [2025-03-03 09:49:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:49:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2661 transitions. [2025-03-03 09:49:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 09:49:40,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:40,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-03 09:49:40,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:49:40,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:49:40,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 849669905, now seen corresponding path program 1 times [2025-03-03 09:49:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094360094] [2025-03-03 09:49:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:40,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 09:49:40,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 09:49:40,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:40,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094360094] [2025-03-03 09:49:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094360094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743762413] [2025-03-03 09:49:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:40,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:40,645 INFO L87 Difference]: Start difference. First operand 2144 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:41,059 INFO L93 Difference]: Finished difference Result 4703 states and 5834 transitions. [2025-03-03 09:49:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-03 09:49:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:41,070 INFO L225 Difference]: With dead ends: 4703 [2025-03-03 09:49:41,070 INFO L226 Difference]: Without dead ends: 2561 [2025-03-03 09:49:41,073 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:49:41,073 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 152 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:41,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 59 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:49:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-03-03 09:49:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2025-03-03 09:49:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2560 states have (on average 1.224609375) internal successors, (3135), 2560 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states 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:49:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3135 transitions. [2025-03-03 09:49:41,138 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3135 transitions. Word has length 133 [2025-03-03 09:49:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:41,138 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3135 transitions. [2025-03-03 09:49:41,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3135 transitions. [2025-03-03 09:49:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 09:49:41,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:41,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:49:41,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:49:41,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:41,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash 307190471, now seen corresponding path program 1 times [2025-03-03 09:49:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:41,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288861685] [2025-03-03 09:49:41,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:41,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 09:49:41,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 09:49:41,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:41,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288861685] [2025-03-03 09:49:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288861685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:49:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788889591] [2025-03-03 09:49:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:41,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:49:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:41,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:49:41,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:49:41,336 INFO L87 Difference]: Start difference. First operand 2561 states and 3135 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:49:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:41,980 INFO L93 Difference]: Finished difference Result 5815 states and 7094 transitions. [2025-03-03 09:49:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:49:41,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 09:49:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:41,989 INFO L225 Difference]: With dead ends: 5815 [2025-03-03 09:49:41,989 INFO L226 Difference]: Without dead ends: 3256 [2025-03-03 09:49:41,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:49:41,992 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 340 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:41,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 118 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:49:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2025-03-03 09:49:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 2976. [2025-03-03 09:49:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.186218487394958) internal successors, (3529), 2975 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states 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:49:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3529 transitions. [2025-03-03 09:49:42,036 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3529 transitions. Word has length 137 [2025-03-03 09:49:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:42,036 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 3529 transitions. [2025-03-03 09:49:42,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:49:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3529 transitions. [2025-03-03 09:49:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 09:49:42,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:42,040 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:42,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:49:42,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 293207779, now seen corresponding path program 1 times [2025-03-03 09:49:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079620175] [2025-03-03 09:49:42,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:42,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 09:49:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 09:49:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079620175] [2025-03-03 09:49:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079620175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725705286] [2025-03-03 09:49:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:42,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:42,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:42,100 INFO L87 Difference]: Start difference. First operand 2976 states and 3529 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:49:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:42,409 INFO L93 Difference]: Finished difference Result 5379 states and 6368 transitions. [2025-03-03 09:49:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-03 09:49:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:42,417 INFO L225 Difference]: With dead ends: 5379 [2025-03-03 09:49:42,417 INFO L226 Difference]: Without dead ends: 1985 [2025-03-03 09:49:42,420 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:49:42,420 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 121 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:42,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 232 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-03-03 09:49:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2025-03-03 09:49:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.1295362903225807) internal successors, (2241), 1984 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states 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:49:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2241 transitions. [2025-03-03 09:49:42,448 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2241 transitions. Word has length 140 [2025-03-03 09:49:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2241 transitions. [2025-03-03 09:49:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:49:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2241 transitions. [2025-03-03 09:49:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 09:49:42,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:42,451 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:42,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:49:42,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 786827697, now seen corresponding path program 1 times [2025-03-03 09:49:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707756534] [2025-03-03 09:49:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:42,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 09:49:42,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 09:49:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:49:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707756534] [2025-03-03 09:49:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707756534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084999503] [2025-03-03 09:49:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:42,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:42,535 INFO L87 Difference]: Start difference. First operand 1985 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:49:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:42,850 INFO L93 Difference]: Finished difference Result 4529 states and 5121 transitions. [2025-03-03 09:49:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 176 [2025-03-03 09:49:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:42,856 INFO L225 Difference]: With dead ends: 4529 [2025-03-03 09:49:42,856 INFO L226 Difference]: Without dead ends: 2546 [2025-03-03 09:49:42,858 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:49:42,859 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 130 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:42,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 217 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-03-03 09:49:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2405. [2025-03-03 09:49:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2404 states have (on average 1.1019134775374375) internal successors, (2649), 2404 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states 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:49:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 2649 transitions. [2025-03-03 09:49:42,891 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 2649 transitions. Word has length 176 [2025-03-03 09:49:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:42,891 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 2649 transitions. [2025-03-03 09:49:42,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:49:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2649 transitions. [2025-03-03 09:49:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 09:49:42,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:42,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:49:42,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1563667146, now seen corresponding path program 1 times [2025-03-03 09:49:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707241618] [2025-03-03 09:49:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:42,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 09:49:42,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 09:49:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:49:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707241618] [2025-03-03 09:49:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707241618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077779546] [2025-03-03 09:49:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:42,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:42,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:42,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:42,983 INFO L87 Difference]: Start difference. First operand 2405 states and 2649 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:49:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:43,288 INFO L93 Difference]: Finished difference Result 4943 states and 5469 transitions. [2025-03-03 09:49:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 187 [2025-03-03 09:49:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:43,293 INFO L225 Difference]: With dead ends: 4943 [2025-03-03 09:49:43,293 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:49:43,296 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:49:43,297 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 72 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:43,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 70 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:49:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:49:43,299 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:49:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:49:43,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2025-03-03 09:49:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:49:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:49:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:49:43,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:49:43,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:49:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:49:43,306 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:43,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:49:43,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:49:43,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:43 BoogieIcfgContainer [2025-03-03 09:49:43,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:49:43,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:49:43,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:49:43,556 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:49:43,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:36" (3/4) ... [2025-03-03 09:49:43,560 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:49:43,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:49:43,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:49:43,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:49:43,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:49:43,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:49:43,672 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:49:43,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:49:43,673 INFO L158 Benchmark]: Toolchain (without parser) took 8558.18ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 110.6MB in the beginning and 94.5MB in the end (delta: 16.1MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,677 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:49:43,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.44ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 84.8MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.19ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 79.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,677 INFO L158 Benchmark]: Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 75.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:49:43,678 INFO L158 Benchmark]: IcfgBuilder took 914.10ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 63.2MB in the end (delta: 12.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,678 INFO L158 Benchmark]: TraceAbstraction took 7041.74ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 62.4MB in the beginning and 106.4MB in the end (delta: -44.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,678 INFO L158 Benchmark]: Witness Printer took 116.61ms. Allocated memory is still 218.1MB. Free memory was 106.4MB in the beginning and 94.5MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:49:43,679 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.22ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.44ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 84.8MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.19ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 79.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 75.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 914.10ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 63.2MB in the end (delta: 12.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7041.74ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 62.4MB in the beginning and 106.4MB in the end (delta: -44.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 116.61ms. Allocated memory is still 218.1MB. Free memory was 106.4MB in the beginning and 94.5MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 494]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1481 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1481 mSDsluCounter, 1392 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 698 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4192 IncrementalHoareTripleChecker+Invalid, 4890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 698 mSolverCounterUnsat, 1196 mSDtfsCounter, 4192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2976occurred in iteration=7, InterpolantAutomatonStates: 32, 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, 10 MinimizatonAttempts, 428 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1510 NumberOfCodeBlocks, 1510 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1499 ConstructedInterpolants, 0 QuantifiedInterpolants, 4570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 431/447 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: 616]: Location Invariant Derived location invariant: (((((((((((((a11 == 1) && (a19 == 1)) && (a28 <= 7)) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1))) || ((a11 <= 0) && (a25 == 0))) || (((9 <= a28) && (a11 <= 0)) && (a28 <= 10))) || (((a11 == 1) && (a25 == 0)) && (a28 <= 7))) || (((((a17 == 8) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((a17 <= 7) && (a19 == 1))) || ((a17 <= 7) && (a25 == 0))) || (((a28 <= 9) && (a11 <= 0)) && (a19 == 1))) || ((a11 <= 0) && (a28 <= 7))) || ((a28 <= 9) && (a17 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:49:43,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE