./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label25.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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:57:37,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:57:37,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:57:37,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:57:37,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:57:37,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:57:37,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:57:37,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:57:37,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:57:37,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:57:37,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:57:37,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:57:37,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:57:37,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:37,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:57:37,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:57:37,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:57:37,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:57:37,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:57:37,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:57:37,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:57:37,094 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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 [2025-03-08 00:57:37,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:57:37,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:57:37,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:57:37,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:57:37,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:57:37,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2025-03-08 00:57:38,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6906af867/54c61ab68fa44e2c9130c668957c017d/FLAG73158735b [2025-03-08 00:57:38,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:57:38,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2025-03-08 00:57:38,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6906af867/54c61ab68fa44e2c9130c668957c017d/FLAG73158735b [2025-03-08 00:57:38,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6906af867/54c61ab68fa44e2c9130c668957c017d [2025-03-08 00:57:38,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:57:38,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:57:38,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:38,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:57:38,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:57:38,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:38" (1/1) ... [2025-03-08 00:57:38,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afd4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:38, skipping insertion in model container [2025-03-08 00:57:38,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:38" (1/1) ... [2025-03-08 00:57:38,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:57:39,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2025-03-08 00:57:39,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:39,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:57:39,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2025-03-08 00:57:39,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:39,089 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:57:39,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39 WrapperNode [2025-03-08 00:57:39,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:39,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:39,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:57:39,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:57:39,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,141 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-08 00:57:39,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:39,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:57:39,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:57:39,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:57:39,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,176 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-08 00:57:39,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:57:39,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:57:39,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:57:39,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:57:39,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (1/1) ... [2025-03-08 00:57:39,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:39,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:39,240 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-08 00:57:39,243 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-08 00:57:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:57:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:57:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:57:39,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:57:39,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:57:39,313 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:57:40,023 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-08 00:57:40,024 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:57:40,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:57:40,036 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:57:40,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:40 BoogieIcfgContainer [2025-03-08 00:57:40,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:57:40,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:57:40,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:57:40,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:57:40,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:38" (1/3) ... [2025-03-08 00:57:40,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba00157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:40, skipping insertion in model container [2025-03-08 00:57:40,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:39" (2/3) ... [2025-03-08 00:57:40,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba00157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:40, skipping insertion in model container [2025-03-08 00:57:40,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:40" (3/3) ... [2025-03-08 00:57:40,045 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2025-03-08 00:57:40,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:57:40,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label25.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:57:40,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:57:40,104 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;@2d98b141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:57:40,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:57:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 00:57:40,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:40,114 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] [2025-03-08 00:57:40,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1172162551, now seen corresponding path program 1 times [2025-03-08 00:57:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840001033] [2025-03-08 00:57:40,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:40,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 00:57:40,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 00:57:40,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:40,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:40,569 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-08 00:57:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:40,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840001033] [2025-03-08 00:57:40,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840001033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:40,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:40,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382737898] [2025-03-08 00:57:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:40,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:40,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:40,596 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 00:57:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:41,215 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-03-08 00:57:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 00:57:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:41,223 INFO L225 Difference]: With dead ends: 528 [2025-03-08 00:57:41,223 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 00:57:41,228 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-08 00:57:41,230 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:41,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:57:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 00:57:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 00:57:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 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-08 00:57:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2025-03-08 00:57:41,269 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 119 [2025-03-08 00:57:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2025-03-08 00:57:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 00:57:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2025-03-08 00:57:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 00:57:41,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:41,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:41,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:57:41,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:41,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1817163091, now seen corresponding path program 1 times [2025-03-08 00:57:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035723068] [2025-03-08 00:57:41,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:41,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 00:57:41,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 00:57:41,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:41,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035723068] [2025-03-08 00:57:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035723068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131682782] [2025-03-08 00:57:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:41,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:41,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:41,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:41,409 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:41,757 INFO L93 Difference]: Finished difference Result 792 states and 1171 transitions. [2025-03-08 00:57:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-08 00:57:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:41,761 INFO L225 Difference]: With dead ends: 792 [2025-03-08 00:57:41,761 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 00:57:41,762 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-08 00:57:41,764 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:41,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 00:57:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 00:57:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 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-08 00:57:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2025-03-08 00:57:41,786 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 124 [2025-03-08 00:57:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:41,787 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2025-03-08 00:57:41,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2025-03-08 00:57:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 00:57:41,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:41,789 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:57:41,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:57:41,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:41,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash -602768756, now seen corresponding path program 1 times [2025-03-08 00:57:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:41,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279409532] [2025-03-08 00:57:41,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:41,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 00:57:41,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 00:57:41,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:41,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279409532] [2025-03-08 00:57:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279409532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914851035] [2025-03-08 00:57:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:42,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:42,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:42,020 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-08 00:57:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:42,392 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2025-03-08 00:57:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-08 00:57:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:42,396 INFO L225 Difference]: With dead ends: 1447 [2025-03-08 00:57:42,396 INFO L226 Difference]: Without dead ends: 921 [2025-03-08 00:57:42,398 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-08 00:57:42,400 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:42,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 55 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-08 00:57:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2025-03-08 00:57:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2902173913043478) internal successors, (1187), 920 states have internal predecessors, (1187), 0 states have call successors, (0), 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-08 00:57:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1187 transitions. [2025-03-08 00:57:42,437 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1187 transitions. Word has length 134 [2025-03-08 00:57:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:42,437 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1187 transitions. [2025-03-08 00:57:42,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-08 00:57:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1187 transitions. [2025-03-08 00:57:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 00:57:42,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:42,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:42,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:57:42,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2059928856, now seen corresponding path program 1 times [2025-03-08 00:57:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059819888] [2025-03-08 00:57:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:42,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 00:57:42,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 00:57:42,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:42,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:57:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059819888] [2025-03-08 00:57:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059819888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:42,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580509235] [2025-03-08 00:57:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:42,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:42,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:42,618 INFO L87 Difference]: Start difference. First operand 921 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:42,947 INFO L93 Difference]: Finished difference Result 2102 states and 2725 transitions. [2025-03-08 00:57:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:42,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-08 00:57:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:42,951 INFO L225 Difference]: With dead ends: 2102 [2025-03-08 00:57:42,952 INFO L226 Difference]: Without dead ends: 1183 [2025-03-08 00:57:42,953 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-08 00:57:42,955 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:42,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 72 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-08 00:57:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2025-03-08 00:57:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2470389170896785) internal successors, (1474), 1182 states have internal predecessors, (1474), 0 states have call successors, (0), 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-08 00:57:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1474 transitions. [2025-03-08 00:57:42,980 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1474 transitions. Word has length 135 [2025-03-08 00:57:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:42,980 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1474 transitions. [2025-03-08 00:57:42,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1474 transitions. [2025-03-08 00:57:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 00:57:42,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:42,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:42,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:57:42,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1040147185, now seen corresponding path program 1 times [2025-03-08 00:57:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174599672] [2025-03-08 00:57:42,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:43,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 00:57:43,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 00:57:43,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:43,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174599672] [2025-03-08 00:57:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174599672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313010032] [2025-03-08 00:57:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:43,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:43,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:43,155 INFO L87 Difference]: Start difference. First operand 1183 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-08 00:57:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:43,637 INFO L93 Difference]: Finished difference Result 3150 states and 3955 transitions. [2025-03-08 00:57:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-08 00:57:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:43,643 INFO L225 Difference]: With dead ends: 3150 [2025-03-08 00:57:43,643 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:43,646 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-08 00:57:43,648 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 382 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:43,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 58 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:57:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-08 00:57:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.221556886227545) internal successors, (2244), 1837 states have internal predecessors, (2244), 0 states have call successors, (0), 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-08 00:57:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2244 transitions. [2025-03-08 00:57:43,681 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2244 transitions. Word has length 138 [2025-03-08 00:57:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:43,682 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2244 transitions. [2025-03-08 00:57:43,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-08 00:57:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2244 transitions. [2025-03-08 00:57:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 00:57:43,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:43,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:57:43,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1216888925, now seen corresponding path program 1 times [2025-03-08 00:57:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537889823] [2025-03-08 00:57:43,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:43,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 00:57:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 00:57:43,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:43,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537889823] [2025-03-08 00:57:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537889823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:43,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468587979] [2025-03-08 00:57:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:43,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:43,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:43,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:43,808 INFO L87 Difference]: Start difference. First operand 1838 states and 2244 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-08 00:57:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:44,091 INFO L93 Difference]: Finished difference Result 2233 states and 2704 transitions. [2025-03-08 00:57:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-08 00:57:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:44,098 INFO L225 Difference]: With dead ends: 2233 [2025-03-08 00:57:44,098 INFO L226 Difference]: Without dead ends: 2231 [2025-03-08 00:57:44,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:44,099 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:44,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-03-08 00:57:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2025-03-08 00:57:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2406349206349205) internal successors, (1954), 1575 states have internal predecessors, (1954), 0 states have call successors, (0), 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-08 00:57:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1954 transitions. [2025-03-08 00:57:44,127 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1954 transitions. Word has length 156 [2025-03-08 00:57:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:44,128 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1954 transitions. [2025-03-08 00:57:44,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-08 00:57:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1954 transitions. [2025-03-08 00:57:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 00:57:44,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:44,132 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:44,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:57:44,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -989353840, now seen corresponding path program 1 times [2025-03-08 00:57:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863464084] [2025-03-08 00:57:44,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:44,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 00:57:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 00:57:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 00:57:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863464084] [2025-03-08 00:57:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863464084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301448762] [2025-03-08 00:57:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:44,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:44,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:44,324 INFO L87 Difference]: Start difference. First operand 1576 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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-08 00:57:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:44,631 INFO L93 Difference]: Finished difference Result 3543 states and 4365 transitions. [2025-03-08 00:57:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 224 [2025-03-08 00:57:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:44,637 INFO L225 Difference]: With dead ends: 3543 [2025-03-08 00:57:44,637 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:44,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:44,639 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:44,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 55 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2025-03-08 00:57:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2397420867526376) internal successors, (2115), 1706 states have internal predecessors, (2115), 0 states have call successors, (0), 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-08 00:57:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2115 transitions. [2025-03-08 00:57:44,664 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2115 transitions. Word has length 224 [2025-03-08 00:57:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:44,664 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2115 transitions. [2025-03-08 00:57:44,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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-08 00:57:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2115 transitions. [2025-03-08 00:57:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 00:57:44,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:44,668 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:57:44,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2072853402, now seen corresponding path program 1 times [2025-03-08 00:57:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967849441] [2025-03-08 00:57:44,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:44,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 00:57:44,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 00:57:44,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 00:57:44,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967849441] [2025-03-08 00:57:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967849441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:44,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011137382] [2025-03-08 00:57:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:44,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:44,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:44,829 INFO L87 Difference]: Start difference. First operand 1707 states and 2115 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 00:57:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:45,140 INFO L93 Difference]: Finished difference Result 3674 states and 4514 transitions. [2025-03-08 00:57:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:45,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 267 [2025-03-08 00:57:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:45,146 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 00:57:45,146 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:45,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:45,148 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:45,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 191 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-08 00:57:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1965160587915078) internal successors, (2198), 1837 states have internal predecessors, (2198), 0 states have call successors, (0), 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-08 00:57:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2198 transitions. [2025-03-08 00:57:45,175 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2198 transitions. Word has length 267 [2025-03-08 00:57:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:45,175 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2198 transitions. [2025-03-08 00:57:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 00:57:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2198 transitions. [2025-03-08 00:57:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-08 00:57:45,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:45,180 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:45,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:57:45,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:45,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -341186289, now seen corresponding path program 1 times [2025-03-08 00:57:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928362765] [2025-03-08 00:57:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 00:57:45,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 00:57:45,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:45,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-08 00:57:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928362765] [2025-03-08 00:57:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928362765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:45,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390653073] [2025-03-08 00:57:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:45,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:45,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:45,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:45,307 INFO L87 Difference]: Start difference. First operand 1838 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-08 00:57:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:45,611 INFO L93 Difference]: Finished difference Result 3674 states and 4394 transitions. [2025-03-08 00:57:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 280 [2025-03-08 00:57:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:45,616 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 00:57:45,617 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 00:57:45,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:45,619 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:45,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 180 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 00:57:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-08 00:57:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.160587915078933) internal successors, (2132), 1837 states have internal predecessors, (2132), 0 states have call successors, (0), 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-08 00:57:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2132 transitions. [2025-03-08 00:57:45,647 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2132 transitions. Word has length 280 [2025-03-08 00:57:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2132 transitions. [2025-03-08 00:57:45,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-08 00:57:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2132 transitions. [2025-03-08 00:57:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-08 00:57:45,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:45,652 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:57:45,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 384163439, now seen corresponding path program 1 times [2025-03-08 00:57:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264556788] [2025-03-08 00:57:45,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:45,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-08 00:57:45,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-08 00:57:45,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:45,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:57:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264556788] [2025-03-08 00:57:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264556788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:57:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222554459] [2025-03-08 00:57:46,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:46,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:57:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:46,177 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-08 00:57:46,179 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-08 00:57:46,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-08 00:57:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-08 00:57:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:46,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:46,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:57:46,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:57:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:57:46,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:57:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222554459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:57:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 00:57:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584387162] [2025-03-08 00:57:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:46,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:46,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:57:46,491 INFO L87 Difference]: Start difference. First operand 1838 states and 2132 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-08 00:57:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:46,823 INFO L93 Difference]: Finished difference Result 3672 states and 4261 transitions. [2025-03-08 00:57:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 289 [2025-03-08 00:57:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:46,826 INFO L225 Difference]: With dead ends: 3672 [2025-03-08 00:57:46,826 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:57:46,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:57:46,829 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 190 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:57:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:57:46,830 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-08 00:57:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:57:46,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2025-03-08 00:57:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:46,830 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:57:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-08 00:57:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:57:46,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:57:46,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:57:46,840 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-08 00:57:47,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:57:47,037 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:47,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:57:47,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:57:47,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:57:47 BoogieIcfgContainer [2025-03-08 00:57:47,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:57:47,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:57:47,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:57:47,196 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:57:47,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:40" (3/4) ... [2025-03-08 00:57:47,198 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:57:47,214 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:57:47,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:57:47,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:57:47,216 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:57:47,322 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:57:47,322 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:57:47,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:57:47,323 INFO L158 Benchmark]: Toolchain (without parser) took 8542.52ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 102.9MB in the beginning and 285.7MB in the end (delta: -182.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,323 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:57:47,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.55ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 77.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.64ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 71.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,324 INFO L158 Benchmark]: Boogie Preprocessor took 68.55ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,324 INFO L158 Benchmark]: IcfgBuilder took 824.90ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 51.7MB in the end (delta: 15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,324 INFO L158 Benchmark]: TraceAbstraction took 7156.41ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 51.7MB in the beginning and 297.5MB in the end (delta: -245.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,325 INFO L158 Benchmark]: Witness Printer took 126.85ms. Allocated memory is still 385.9MB. Free memory was 297.5MB in the beginning and 285.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:47,326 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.55ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 77.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.64ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 71.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.55ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 824.90ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 51.7MB in the end (delta: 15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7156.41ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 51.7MB in the beginning and 297.5MB in the end (delta: -245.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 126.85ms. Allocated memory is still 385.9MB. Free memory was 297.5MB in the beginning and 285.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 543]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 326 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1215 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1215 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3552 IncrementalHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 851 mSDtfsCounter, 3552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2155 NumberOfCodeBlocks, 2155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1773/1915 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: ((((a21 == 1) && (a16 <= 5)) || ((a7 != 1) && (a21 == 1))) || (a21 <= 0)) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:57:47,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE