./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label42.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 43b1e2ddb5478e4d8ee38477d15f5851a49b7cf223d0a089a3fdb9014fd7706f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:11:23,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:11:24,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:11:24,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:11:24,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:11:24,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:11:24,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:11:24,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:11:24,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:11:24,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:11:24,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:11:24,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:11:24,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:11:24,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:11:24,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:11:24,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:11:24,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:24,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:11:24,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:11:24,042 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 -> 43b1e2ddb5478e4d8ee38477d15f5851a49b7cf223d0a089a3fdb9014fd7706f [2025-03-16 14:11:24,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:24,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:24,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:24,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:24,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:24,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2025-03-16 14:11:25,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93284bf91/8aa373cbbe2b41faae87c2b5d24c8d7b/FLAG23d9eeed6 [2025-03-16 14:11:25,727 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:25,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2025-03-16 14:11:25,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93284bf91/8aa373cbbe2b41faae87c2b5d24c8d7b/FLAG23d9eeed6 [2025-03-16 14:11:25,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93284bf91/8aa373cbbe2b41faae87c2b5d24c8d7b [2025-03-16 14:11:25,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:25,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:25,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:25,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:25,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:25,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:25" (1/1) ... [2025-03-16 14:11:25,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285965fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:25, skipping insertion in model container [2025-03-16 14:11:25,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:25" (1/1) ... [2025-03-16 14:11:25,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:26,106 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/Problem03_label42.c[60691,60704] [2025-03-16 14:11:26,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:26,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:26,262 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/Problem03_label42.c[60691,60704] [2025-03-16 14:11:26,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:26,287 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:26,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26 WrapperNode [2025-03-16 14:11:26,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:26,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:26,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:26,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:26,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,397 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:26,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:26,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:26,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:26,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:26,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:11:26,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:26,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:26,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:26,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:26,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (1/1) ... [2025-03-16 14:11:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:26,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:11:26,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:11:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:26,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:26,670 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:26,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:28,208 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:28,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:28,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:28,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:28,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:28 BoogieIcfgContainer [2025-03-16 14:11:28,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:28,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:28,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:28,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:28,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:25" (1/3) ... [2025-03-16 14:11:28,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2487ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:28, skipping insertion in model container [2025-03-16 14:11:28,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:26" (2/3) ... [2025-03-16 14:11:28,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2487ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:28, skipping insertion in model container [2025-03-16 14:11:28,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:28" (3/3) ... [2025-03-16 14:11:28,229 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label42.c [2025-03-16 14:11:28,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:28,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label42.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:28,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:28,304 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;@bd22896, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:28,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 14:11:28,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:28,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:28,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:28,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1896694418, now seen corresponding path program 1 times [2025-03-16 14:11:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176240372] [2025-03-16 14:11:28,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:28,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 14:11:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 14:11:28,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:28,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:28,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176240372] [2025-03-16 14:11:28,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176240372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:28,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:28,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002882267] [2025-03-16 14:11:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:28,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:28,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:28,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:28,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:28,829 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:28,863 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-16 14:11:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:28,876 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:28,876 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:28,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:28,881 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:28,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:28,920 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 195 [2025-03-16 14:11:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:28,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 14:11:28,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:28,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:28,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:28,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -800338478, now seen corresponding path program 1 times [2025-03-16 14:11:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442612700] [2025-03-16 14:11:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:28,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 14:11:29,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 14:11:29,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:29,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:29,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442612700] [2025-03-16 14:11:29,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442612700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:29,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:29,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:29,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905476171] [2025-03-16 14:11:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:29,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:29,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:29,462 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:30,223 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2025-03-16 14:11:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-16 14:11:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:30,226 INFO L225 Difference]: With dead ends: 701 [2025-03-16 14:11:30,226 INFO L226 Difference]: Without dead ends: 464 [2025-03-16 14:11:30,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:30,230 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:30,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-16 14:11:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2025-03-16 14:11:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions. [2025-03-16 14:11:30,257 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 195 [2025-03-16 14:11:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 712 transitions. [2025-03-16 14:11:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions. [2025-03-16 14:11:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-16 14:11:30,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:30,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:30,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:30,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:30,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 891077988, now seen corresponding path program 1 times [2025-03-16 14:11:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018720898] [2025-03-16 14:11:30,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:30,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 14:11:30,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 14:11:30,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:30,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018720898] [2025-03-16 14:11:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018720898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409533637] [2025-03-16 14:11:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:30,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:30,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:30,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:30,469 INFO L87 Difference]: Start difference. First operand 458 states and 712 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:31,203 INFO L93 Difference]: Finished difference Result 1342 states and 2101 transitions. [2025-03-16 14:11:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-03-16 14:11:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:31,206 INFO L225 Difference]: With dead ends: 1342 [2025-03-16 14:11:31,206 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:11:31,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:31,208 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:31,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:11:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867. [2025-03-16 14:11:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.533487297921478) internal successors, (1328), 866 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1328 transitions. [2025-03-16 14:11:31,237 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1328 transitions. Word has length 203 [2025-03-16 14:11:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:31,238 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1328 transitions. [2025-03-16 14:11:31,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1328 transitions. [2025-03-16 14:11:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 14:11:31,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:31,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:31,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:31,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:31,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1560810304, now seen corresponding path program 1 times [2025-03-16 14:11:31,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:31,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602116271] [2025-03-16 14:11:31,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:31,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 14:11:31,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 14:11:31,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:31,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:31,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602116271] [2025-03-16 14:11:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602116271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:31,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:31,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889520210] [2025-03-16 14:11:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:31,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:31,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:31,411 INFO L87 Difference]: Start difference. First operand 867 states and 1328 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:31,754 INFO L93 Difference]: Finished difference Result 1709 states and 2621 transitions. [2025-03-16 14:11:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-16 14:11:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:31,757 INFO L225 Difference]: With dead ends: 1709 [2025-03-16 14:11:31,757 INFO L226 Difference]: Without dead ends: 843 [2025-03-16 14:11:31,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:31,760 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:31,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:11:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-16 14:11:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2025-03-16 14:11:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.477434679334917) internal successors, (1244), 842 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1244 transitions. [2025-03-16 14:11:31,794 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1244 transitions. Word has length 208 [2025-03-16 14:11:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:31,794 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1244 transitions. [2025-03-16 14:11:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1244 transitions. [2025-03-16 14:11:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 14:11:31,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:31,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:31,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:31,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:31,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 279286556, now seen corresponding path program 1 times [2025-03-16 14:11:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146462088] [2025-03-16 14:11:31,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:31,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 14:11:31,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 14:11:31,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:31,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146462088] [2025-03-16 14:11:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146462088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957708767] [2025-03-16 14:11:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:31,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:31,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:31,992 INFO L87 Difference]: Start difference. First operand 843 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:32,633 INFO L93 Difference]: Finished difference Result 2497 states and 3689 transitions. [2025-03-16 14:11:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-16 14:11:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:32,638 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 14:11:32,639 INFO L226 Difference]: Without dead ends: 1655 [2025-03-16 14:11:32,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:32,642 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 209 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:32,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 141 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-16 14:11:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2025-03-16 14:11:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 1.3071342200725513) internal successors, (2162), 1654 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2162 transitions. [2025-03-16 14:11:32,668 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2162 transitions. Word has length 209 [2025-03-16 14:11:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:32,668 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2162 transitions. [2025-03-16 14:11:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2162 transitions. [2025-03-16 14:11:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 14:11:32,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:32,672 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:32,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:11:32,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:32,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1286505383, now seen corresponding path program 1 times [2025-03-16 14:11:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:32,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934782942] [2025-03-16 14:11:32,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:32,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 14:11:32,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 14:11:32,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:32,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:11:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934782942] [2025-03-16 14:11:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934782942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527917283] [2025-03-16 14:11:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:32,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:32,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:32,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:32,942 INFO L87 Difference]: Start difference. First operand 1655 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:33,627 INFO L93 Difference]: Finished difference Result 4961 states and 6482 transitions. [2025-03-16 14:11:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-16 14:11:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:33,636 INFO L225 Difference]: With dead ends: 4961 [2025-03-16 14:11:33,637 INFO L226 Difference]: Without dead ends: 3307 [2025-03-16 14:11:33,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:33,639 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 286 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:33,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 50 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-03-16 14:11:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3304. [2025-03-16 14:11:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3303 states have (on average 1.301544050862852) internal successors, (4299), 3303 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4299 transitions. [2025-03-16 14:11:33,704 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4299 transitions. Word has length 214 [2025-03-16 14:11:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 4299 transitions. [2025-03-16 14:11:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4299 transitions. [2025-03-16 14:11:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 14:11:33,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:33,710 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:11:33,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1937916869, now seen corresponding path program 1 times [2025-03-16 14:11:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216556324] [2025-03-16 14:11:33,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:33,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 14:11:33,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 14:11:33,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:33,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216556324] [2025-03-16 14:11:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216556324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791346595] [2025-03-16 14:11:33,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:33,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:33,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:11:34,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 14:11:34,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 14:11:34,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:34,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:34,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:34,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:11:34,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791346595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:34,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:34,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:11:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143821033] [2025-03-16 14:11:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:34,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:34,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:34,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:34,171 INFO L87 Difference]: Start difference. First operand 3304 states and 4299 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:34,427 INFO L93 Difference]: Finished difference Result 9902 states and 12887 transitions. [2025-03-16 14:11:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:34,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 215 [2025-03-16 14:11:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:34,449 INFO L225 Difference]: With dead ends: 9902 [2025-03-16 14:11:34,450 INFO L226 Difference]: Without dead ends: 6599 [2025-03-16 14:11:34,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:34,456 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:34,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 534 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:11:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2025-03-16 14:11:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6591. [2025-03-16 14:11:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6591 states, 6590 states have (on average 1.301062215477997) internal successors, (8574), 6590 states have internal predecessors, (8574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 8574 transitions. [2025-03-16 14:11:34,590 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 8574 transitions. Word has length 215 [2025-03-16 14:11:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:34,591 INFO L471 AbstractCegarLoop]: Abstraction has 6591 states and 8574 transitions. [2025-03-16 14:11:34,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 8574 transitions. [2025-03-16 14:11:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 14:11:34,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:34,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:34,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:11:34,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:34,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 346433632, now seen corresponding path program 1 times [2025-03-16 14:11:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229695856] [2025-03-16 14:11:34,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:34,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:11:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:11:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229695856] [2025-03-16 14:11:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229695856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065283166] [2025-03-16 14:11:34,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:34,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:34,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:11:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:11:35,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:11:35,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:35,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:35,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:35,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065283166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:35,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:11:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957912468] [2025-03-16 14:11:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:35,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:35,139 INFO L87 Difference]: Start difference. First operand 6591 states and 8574 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:35,893 INFO L93 Difference]: Finished difference Result 16437 states and 21943 transitions. [2025-03-16 14:11:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:35,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 217 [2025-03-16 14:11:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:35,922 INFO L225 Difference]: With dead ends: 16437 [2025-03-16 14:11:35,923 INFO L226 Difference]: Without dead ends: 9847 [2025-03-16 14:11:35,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:35,933 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:35,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 365 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9847 states. [2025-03-16 14:11:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9847 to 9839. [2025-03-16 14:11:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.2354137019719456) internal successors, (12154), 9838 states have internal predecessors, (12154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12154 transitions. [2025-03-16 14:11:36,189 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 12154 transitions. Word has length 217 [2025-03-16 14:11:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:36,189 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 12154 transitions. [2025-03-16 14:11:36,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 12154 transitions. [2025-03-16 14:11:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 14:11:36,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:36,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-16 14:11:36,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:36,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1802276710, now seen corresponding path program 1 times [2025-03-16 14:11:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:36,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970135210] [2025-03-16 14:11:36,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 14:11:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 14:11:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970135210] [2025-03-16 14:11:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970135210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:36,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708600464] [2025-03-16 14:11:36,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:36,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:36,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:36,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:36,641 INFO L87 Difference]: Start difference. First operand 9839 states and 12154 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:37,388 INFO L93 Difference]: Finished difference Result 19699 states and 24349 transitions. [2025-03-16 14:11:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 251 [2025-03-16 14:11:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:37,420 INFO L225 Difference]: With dead ends: 19699 [2025-03-16 14:11:37,420 INFO L226 Difference]: Without dead ends: 9861 [2025-03-16 14:11:37,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:37,437 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 795 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:37,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 43 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2025-03-16 14:11:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 9839. [2025-03-16 14:11:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.2256556210611913) internal successors, (12058), 9838 states have internal predecessors, (12058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12058 transitions. [2025-03-16 14:11:37,601 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 12058 transitions. Word has length 251 [2025-03-16 14:11:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:37,601 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 12058 transitions. [2025-03-16 14:11:37,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 12058 transitions. [2025-03-16 14:11:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 14:11:37,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:37,610 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:37,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:11:37,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1771931016, now seen corresponding path program 1 times [2025-03-16 14:11:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669104402] [2025-03-16 14:11:37,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 14:11:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 14:11:37,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:37,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:11:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669104402] [2025-03-16 14:11:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669104402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836449556] [2025-03-16 14:11:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:37,980 INFO L87 Difference]: Start difference. First operand 9839 states and 12058 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:38,537 INFO L93 Difference]: Finished difference Result 22955 states and 27871 transitions. [2025-03-16 14:11:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-16 14:11:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:38,559 INFO L225 Difference]: With dead ends: 22955 [2025-03-16 14:11:38,559 INFO L226 Difference]: Without dead ends: 13117 [2025-03-16 14:11:38,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:38,570 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:38,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 113 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2025-03-16 14:11:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 13109. [2025-03-16 14:11:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 13108 states have (on average 1.2018614586512053) internal successors, (15754), 13108 states have internal predecessors, (15754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 15754 transitions. [2025-03-16 14:11:38,750 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 15754 transitions. Word has length 265 [2025-03-16 14:11:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:38,751 INFO L471 AbstractCegarLoop]: Abstraction has 13109 states and 15754 transitions. [2025-03-16 14:11:38,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 15754 transitions. [2025-03-16 14:11:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-16 14:11:38,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:38,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:38,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:11:38,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -612830171, now seen corresponding path program 2 times [2025-03-16 14:11:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138387818] [2025-03-16 14:11:38,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:11:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:38,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-16 14:11:38,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-03-16 14:11:38,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:11:38,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:11:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138387818] [2025-03-16 14:11:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138387818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:39,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:11:39,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716055392] [2025-03-16 14:11:39,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:11:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:39,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:11:39,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:39,368 INFO L87 Difference]: Start difference. First operand 13109 states and 15754 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:40,182 INFO L93 Difference]: Finished difference Result 33732 states and 39951 transitions. [2025-03-16 14:11:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:11:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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 272 [2025-03-16 14:11:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:40,183 INFO L225 Difference]: With dead ends: 33732 [2025-03-16 14:11:40,183 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:11:40,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:40,203 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 422 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:40,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 50 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:11:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:11:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:11:40,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2025-03-16 14:11:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:40,204 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:11:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:11:40,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:11:40,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:11:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:11:40,209 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:40,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:11:40,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:11:40,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:11:40 BoogieIcfgContainer [2025-03-16 14:11:40,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:11:40,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:11:40,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:11:40,970 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:11:40,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:28" (3/4) ... [2025-03-16 14:11:40,972 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:11:40,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:11:40,992 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:11:40,994 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:11:40,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:11:41,139 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:11:41,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:11:41,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:11:41,140 INFO L158 Benchmark]: Toolchain (without parser) took 15385.37ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 153.0MB in the beginning and 279.3MB in the end (delta: -126.3MB). Peak memory consumption was 276.1MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,140 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.82ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 93.6MB in the end (delta: 59.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.34ms. Allocated memory is still 201.3MB. Free memory was 93.6MB in the beginning and 79.2MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: Boogie Preprocessor took 134.81ms. Allocated memory is still 201.3MB. Free memory was 79.2MB in the beginning and 68.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: IcfgBuilder took 1685.38ms. Allocated memory is still 201.3MB. Free memory was 68.5MB in the beginning and 142.1MB in the end (delta: -73.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: TraceAbstraction took 12745.78ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 140.6MB in the beginning and 304.4MB in the end (delta: -163.8MB). Peak memory consumption was 401.7MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,144 INFO L158 Benchmark]: Witness Printer took 169.48ms. Allocated memory is still 604.0MB. Free memory was 304.4MB in the beginning and 279.3MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:11:41,145 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.82ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 93.6MB in the end (delta: 59.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.34ms. Allocated memory is still 201.3MB. Free memory was 93.6MB in the beginning and 79.2MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.81ms. Allocated memory is still 201.3MB. Free memory was 79.2MB in the beginning and 68.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1685.38ms. Allocated memory is still 201.3MB. Free memory was 68.5MB in the beginning and 142.1MB in the end (delta: -73.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12745.78ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 140.6MB in the beginning and 304.4MB in the end (delta: -163.8MB). Peak memory consumption was 401.7MB. Max. memory is 16.1GB. * Witness Printer took 169.48ms. Allocated memory is still 604.0MB. Free memory was 304.4MB in the beginning and 279.3MB in the end (delta: 25.1MB). 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: 1633]: 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, 241 locations, 457 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3054 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3054 mSDsluCounter, 1944 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 1058 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5406 IncrementalHoareTripleChecker+Invalid, 6464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1058 mSolverCounterUnsat, 1535 mSDtfsCounter, 5406 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13109occurred in iteration=10, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2876 NumberOfCodeBlocks, 2876 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2863 ConstructedInterpolants, 0 QuantifiedInterpolants, 7292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 431/453 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: 1668]: Location Invariant Derived location invariant: ((a5 == 1) && (((((a26 == 1) || (a6 == 1)) || (a12 != 1)) || (a27 == 1)) || (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:11:41,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE