./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label47.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 d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:52:14,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:52:14,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:52:14,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:52:14,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:52:14,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:52:14,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:52:14,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:52:14,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:52:14,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:52:14,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:52:14,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:52:14,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:52:14,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:52:14,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:52:14,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:52:14,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:14,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:52:14,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:52:14,965 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 -> d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea [2025-03-16 14:52:15,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:52:15,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:52:15,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:52:15,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:52:15,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:52:15,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2025-03-16 14:52:16,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ff508fa/5d345e9228bb4919820cecacd0accacc/FLAG46fe8ec23 [2025-03-16 14:52:16,638 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:52:16,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2025-03-16 14:52:16,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ff508fa/5d345e9228bb4919820cecacd0accacc/FLAG46fe8ec23 [2025-03-16 14:52:16,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ff508fa/5d345e9228bb4919820cecacd0accacc [2025-03-16 14:52:16,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:52:16,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:52:16,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:16,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:52:16,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:52:16,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:16" (1/1) ... [2025-03-16 14:52:16,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289c747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:16, skipping insertion in model container [2025-03-16 14:52:16,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:16" (1/1) ... [2025-03-16 14:52:16,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:52:16,851 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/Problem11_label47.c[5129,5142] [2025-03-16 14:52:17,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:17,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:52:17,084 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/Problem11_label47.c[5129,5142] [2025-03-16 14:52:17,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:17,181 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:52:17,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17 WrapperNode [2025-03-16 14:52:17,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:17,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:17,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:52:17,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:52:17,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,273 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:52:17,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:17,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:52:17,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:52:17,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:52:17,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:52:17,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:52:17,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:52:17,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:52:17,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:52:17,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (1/1) ... [2025-03-16 14:52:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:17,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:52:17,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:52:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:52:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:52:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:52:17,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:52:17,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:52:17,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:52:18,534 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:52:18,534 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:52:18,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:52:18,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:52:18,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:18 BoogieIcfgContainer [2025-03-16 14:52:18,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:52:18,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:52:18,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:52:18,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:52:18,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:52:16" (1/3) ... [2025-03-16 14:52:18,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae92a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:18, skipping insertion in model container [2025-03-16 14:52:18,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:17" (2/3) ... [2025-03-16 14:52:18,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae92a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:18, skipping insertion in model container [2025-03-16 14:52:18,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:18" (3/3) ... [2025-03-16 14:52:18,557 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2025-03-16 14:52:18,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:52:18,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label47.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:52:18,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:52:18,622 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;@233f5ba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:52:18,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:52:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 14:52:18,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:18,633 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] [2025-03-16 14:52:18,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:18,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2138662432, now seen corresponding path program 1 times [2025-03-16 14:52:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897377583] [2025-03-16 14:52:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:18,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 14:52:18,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 14:52:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897377583] [2025-03-16 14:52:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897377583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372415849] [2025-03-16 14:52:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:18,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:52:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:18,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:52:18,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:18,775 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:18,803 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:52:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:52:18,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 14:52:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:18,811 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:52:18,811 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:52:18,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:18,817 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:18,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:52:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:52:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:52:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:52:18,855 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 34 [2025-03-16 14:52:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:18,855 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:52:18,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:52:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 14:52:18,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:18,859 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] [2025-03-16 14:52:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:52:18,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:18,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1174486813, now seen corresponding path program 1 times [2025-03-16 14:52:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434029012] [2025-03-16 14:52:18,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:18,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 14:52:18,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 14:52:18,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:18,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434029012] [2025-03-16 14:52:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434029012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:19,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281943837] [2025-03-16 14:52:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:19,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:19,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:19,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:19,011 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:19,748 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2025-03-16 14:52:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 14:52:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:19,750 INFO L225 Difference]: With dead ends: 639 [2025-03-16 14:52:19,750 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 14:52:19,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:19,754 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 177 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:19,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 14:52:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-16 14:52:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-16 14:52:19,778 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 34 [2025-03-16 14:52:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:19,778 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-16 14:52:19,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-16 14:52:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 14:52:19,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:19,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:19,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:52:19,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash -757076733, now seen corresponding path program 1 times [2025-03-16 14:52:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190581741] [2025-03-16 14:52:19,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:19,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 14:52:19,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 14:52:19,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:19,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190581741] [2025-03-16 14:52:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190581741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278439605] [2025-03-16 14:52:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:19,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:19,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:19,959 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:20,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:20,610 INFO L93 Difference]: Finished difference Result 1198 states and 1828 transitions. [2025-03-16 14:52:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 14:52:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:20,614 INFO L225 Difference]: With dead ends: 1198 [2025-03-16 14:52:20,614 INFO L226 Difference]: Without dead ends: 788 [2025-03-16 14:52:20,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:20,616 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:20,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 175 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-16 14:52:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-16 14:52:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:52:20,647 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 100 [2025-03-16 14:52:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:20,647 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:52:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:52:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 14:52:20,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:20,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:20,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:52:20,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 77356877, now seen corresponding path program 1 times [2025-03-16 14:52:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346023790] [2025-03-16 14:52:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 14:52:20,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 14:52:20,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:20,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:20,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346023790] [2025-03-16 14:52:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346023790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:20,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458394950] [2025-03-16 14:52:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:20,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:20,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:20,914 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:21,527 INFO L93 Difference]: Finished difference Result 2313 states and 3180 transitions. [2025-03-16 14:52:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 14:52:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:21,533 INFO L225 Difference]: With dead ends: 2313 [2025-03-16 14:52:21,535 INFO L226 Difference]: Without dead ends: 1526 [2025-03-16 14:52:21,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:21,536 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:21,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 192 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-16 14:52:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2025-03-16 14:52:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2171916010498687) internal successors, (1855), 1524 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1855 transitions. [2025-03-16 14:52:21,565 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1855 transitions. Word has length 104 [2025-03-16 14:52:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1855 transitions. [2025-03-16 14:52:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1855 transitions. [2025-03-16 14:52:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 14:52:21,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:21,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:21,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:52:21,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 148280280, now seen corresponding path program 1 times [2025-03-16 14:52:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261468492] [2025-03-16 14:52:21,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:21,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 14:52:21,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 14:52:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261468492] [2025-03-16 14:52:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261468492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:21,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:21,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607987205] [2025-03-16 14:52:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:21,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:21,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:21,758 INFO L87 Difference]: Start difference. First operand 1525 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:22,338 INFO L93 Difference]: Finished difference Result 3256 states and 4122 transitions. [2025-03-16 14:52:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:22,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-16 14:52:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:22,349 INFO L225 Difference]: With dead ends: 3256 [2025-03-16 14:52:22,350 INFO L226 Difference]: Without dead ends: 1916 [2025-03-16 14:52:22,352 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-16 14:52:22,354 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 200 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:22,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-16 14:52:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2025-03-16 14:52:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1912 states have (on average 1.2463389121338913) internal successors, (2383), 1912 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2383 transitions. [2025-03-16 14:52:22,393 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2383 transitions. Word has length 161 [2025-03-16 14:52:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:22,395 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2383 transitions. [2025-03-16 14:52:22,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2383 transitions. [2025-03-16 14:52:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 14:52:22,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:22,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:52:22,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:22,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1889459248, now seen corresponding path program 1 times [2025-03-16 14:52:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279392315] [2025-03-16 14:52:22,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:22,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 14:52:22,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 14:52:22,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:52:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279392315] [2025-03-16 14:52:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279392315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026186351] [2025-03-16 14:52:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:22,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:22,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:22,607 INFO L87 Difference]: Start difference. First operand 1913 states and 2383 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:23,293 INFO L93 Difference]: Finished difference Result 4388 states and 5589 transitions. [2025-03-16 14:52:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 216 [2025-03-16 14:52:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:23,302 INFO L225 Difference]: With dead ends: 4388 [2025-03-16 14:52:23,302 INFO L226 Difference]: Without dead ends: 2660 [2025-03-16 14:52:23,305 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-16 14:52:23,307 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 162 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:23,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 390 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-16 14:52:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2466. [2025-03-16 14:52:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.2348884381338743) internal successors, (3044), 2465 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3044 transitions. [2025-03-16 14:52:23,350 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3044 transitions. Word has length 216 [2025-03-16 14:52:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:23,350 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3044 transitions. [2025-03-16 14:52:23,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3044 transitions. [2025-03-16 14:52:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:52:23,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:23,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:52:23,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -255193345, now seen corresponding path program 1 times [2025-03-16 14:52:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994301708] [2025-03-16 14:52:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:23,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:52:23,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:52:23,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:52:23,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:23,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994301708] [2025-03-16 14:52:23,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994301708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793730448] [2025-03-16 14:52:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:23,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:23,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:23,542 INFO L87 Difference]: Start difference. First operand 2466 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:24,189 INFO L93 Difference]: Finished difference Result 5861 states and 7296 transitions. [2025-03-16 14:52:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:24,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-16 14:52:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:24,201 INFO L225 Difference]: With dead ends: 5861 [2025-03-16 14:52:24,202 INFO L226 Difference]: Without dead ends: 3396 [2025-03-16 14:52:24,205 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-16 14:52:24,206 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:24,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 388 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2025-03-16 14:52:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3387. [2025-03-16 14:52:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.207914943886592) internal successors, (4090), 3386 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4090 transitions. [2025-03-16 14:52:24,256 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4090 transitions. Word has length 222 [2025-03-16 14:52:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:24,256 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4090 transitions. [2025-03-16 14:52:24,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4090 transitions. [2025-03-16 14:52:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 14:52:24,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:24,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:24,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:52:24,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 637037593, now seen corresponding path program 1 times [2025-03-16 14:52:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665590085] [2025-03-16 14:52:24,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:24,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 14:52:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 14:52:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 14:52:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665590085] [2025-03-16 14:52:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665590085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:24,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:24,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175645602] [2025-03-16 14:52:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:24,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:24,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:24,482 INFO L87 Difference]: Start difference. First operand 3387 states and 4090 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:25,059 INFO L93 Difference]: Finished difference Result 6787 states and 8204 transitions. [2025-03-16 14:52:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-03-16 14:52:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:25,069 INFO L225 Difference]: With dead ends: 6787 [2025-03-16 14:52:25,069 INFO L226 Difference]: Without dead ends: 3401 [2025-03-16 14:52:25,072 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-16 14:52:25,073 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 137 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 334 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-03-16 14:52:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3019. [2025-03-16 14:52:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3018 states have (on average 1.1815772034459908) internal successors, (3566), 3018 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3566 transitions. [2025-03-16 14:52:25,109 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3566 transitions. Word has length 293 [2025-03-16 14:52:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 3566 transitions. [2025-03-16 14:52:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3566 transitions. [2025-03-16 14:52:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 14:52:25,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:25,113 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:25,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:52:25,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 832008601, now seen corresponding path program 1 times [2025-03-16 14:52:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156448823] [2025-03-16 14:52:25,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:25,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 14:52:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 14:52:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:52:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:25,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156448823] [2025-03-16 14:52:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156448823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:25,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274079501] [2025-03-16 14:52:25,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:25,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:25,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:25,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:25,273 INFO L87 Difference]: Start difference. First operand 3019 states and 3566 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:25,873 INFO L93 Difference]: Finished difference Result 6014 states and 7098 transitions. [2025-03-16 14:52:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 294 [2025-03-16 14:52:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:25,881 INFO L225 Difference]: With dead ends: 6014 [2025-03-16 14:52:25,881 INFO L226 Difference]: Without dead ends: 2996 [2025-03-16 14:52:25,884 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-16 14:52:25,884 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 160 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:25,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 148 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2025-03-16 14:52:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2025-03-16 14:52:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2993 states have (on average 1.1329769462078183) internal successors, (3391), 2993 states have internal predecessors, (3391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 3391 transitions. [2025-03-16 14:52:25,920 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 3391 transitions. Word has length 294 [2025-03-16 14:52:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:25,921 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 3391 transitions. [2025-03-16 14:52:25,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3391 transitions. [2025-03-16 14:52:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 14:52:25,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:25,925 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:25,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:52:25,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:25,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1046280478, now seen corresponding path program 1 times [2025-03-16 14:52:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269477785] [2025-03-16 14:52:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:52:25,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:52:25,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-16 14:52:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269477785] [2025-03-16 14:52:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269477785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375137242] [2025-03-16 14:52:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:26,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:26,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:26,093 INFO L87 Difference]: Start difference. First operand 2994 states and 3391 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:26,598 INFO L93 Difference]: Finished difference Result 6906 states and 7809 transitions. [2025-03-16 14:52:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 299 [2025-03-16 14:52:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:26,608 INFO L225 Difference]: With dead ends: 6906 [2025-03-16 14:52:26,608 INFO L226 Difference]: Without dead ends: 3913 [2025-03-16 14:52:26,611 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-16 14:52:26,612 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 186 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:26,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 144 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2025-03-16 14:52:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 2068. [2025-03-16 14:52:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2067 states have (on average 1.1480406386066764) internal successors, (2373), 2067 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2373 transitions. [2025-03-16 14:52:26,647 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2373 transitions. Word has length 299 [2025-03-16 14:52:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:26,647 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 2373 transitions. [2025-03-16 14:52:26,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2373 transitions. [2025-03-16 14:52:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 14:52:26,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:26,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:52:26,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:26,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2119256911, now seen corresponding path program 1 times [2025-03-16 14:52:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722430594] [2025-03-16 14:52:26,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:26,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 14:52:26,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 14:52:26,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:26,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:26,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:26,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722430594] [2025-03-16 14:52:26,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722430594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:26,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:26,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242579104] [2025-03-16 14:52:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:26,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:26,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:26,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:26,956 INFO L87 Difference]: Start difference. First operand 2068 states and 2373 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:27,861 INFO L93 Difference]: Finished difference Result 6352 states and 7291 transitions. [2025-03-16 14:52:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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 339 [2025-03-16 14:52:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:27,874 INFO L225 Difference]: With dead ends: 6352 [2025-03-16 14:52:27,874 INFO L226 Difference]: Without dead ends: 4285 [2025-03-16 14:52:27,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:27,877 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 254 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:27,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 65 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:52:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2025-03-16 14:52:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3731. [2025-03-16 14:52:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1308310991957105) internal successors, (4218), 3730 states have internal predecessors, (4218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4218 transitions. [2025-03-16 14:52:27,922 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4218 transitions. Word has length 339 [2025-03-16 14:52:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:27,922 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 4218 transitions. [2025-03-16 14:52:27,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4218 transitions. [2025-03-16 14:52:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 14:52:27,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:27,928 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-03-16 14:52:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:52:27,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2025974519, now seen corresponding path program 1 times [2025-03-16 14:52:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126534975] [2025-03-16 14:52:27,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 14:52:27,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 14:52:27,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:27,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 14:52:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126534975] [2025-03-16 14:52:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126534975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545909609] [2025-03-16 14:52:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:28,268 INFO L87 Difference]: Start difference. First operand 3731 states and 4218 transitions. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:29,088 INFO L93 Difference]: Finished difference Result 8751 states and 9871 transitions. [2025-03-16 14:52:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 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 413 [2025-03-16 14:52:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:29,099 INFO L225 Difference]: With dead ends: 8751 [2025-03-16 14:52:29,099 INFO L226 Difference]: Without dead ends: 5021 [2025-03-16 14:52:29,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:29,103 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 254 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:29,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 65 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:52:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2025-03-16 14:52:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 3731. [2025-03-16 14:52:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1308310991957105) internal successors, (4218), 3730 states have internal predecessors, (4218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4218 transitions. [2025-03-16 14:52:29,152 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4218 transitions. Word has length 413 [2025-03-16 14:52:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:29,152 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 4218 transitions. [2025-03-16 14:52:29,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4218 transitions. [2025-03-16 14:52:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-16 14:52:29,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:29,163 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:52:29,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:29,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 908325339, now seen corresponding path program 1 times [2025-03-16 14:52:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619269641] [2025-03-16 14:52:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:29,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-16 14:52:29,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-16 14:52:29,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:29,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-16 14:52:29,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619269641] [2025-03-16 14:52:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619269641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134964449] [2025-03-16 14:52:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:29,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:29,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:29,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:29,458 INFO L87 Difference]: Start difference. First operand 3731 states and 4218 transitions. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:30,245 INFO L93 Difference]: Finished difference Result 11898 states and 13473 transitions. [2025-03-16 14:52:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 664 [2025-03-16 14:52:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:30,258 INFO L225 Difference]: With dead ends: 11898 [2025-03-16 14:52:30,258 INFO L226 Difference]: Without dead ends: 8168 [2025-03-16 14:52:30,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:30,262 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 251 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:30,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 75 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8168 states. [2025-03-16 14:52:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8168 to 7798. [2025-03-16 14:52:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7798 states, 7797 states have (on average 1.1194048993202514) internal successors, (8728), 7797 states have internal predecessors, (8728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 8728 transitions. [2025-03-16 14:52:30,348 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 8728 transitions. Word has length 664 [2025-03-16 14:52:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:30,349 INFO L471 AbstractCegarLoop]: Abstraction has 7798 states and 8728 transitions. [2025-03-16 14:52:30,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 8728 transitions. [2025-03-16 14:52:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-16 14:52:30,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:30,361 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:52:30,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1608716043, now seen corresponding path program 1 times [2025-03-16 14:52:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657736194] [2025-03-16 14:52:30,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:30,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-16 14:52:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-16 14:52:30,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 952 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-16 14:52:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657736194] [2025-03-16 14:52:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657736194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335328129] [2025-03-16 14:52:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:30,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:30,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:30,681 INFO L87 Difference]: Start difference. First operand 7798 states and 8728 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:31,255 INFO L93 Difference]: Finished difference Result 17435 states and 19553 transitions. [2025-03-16 14:52:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 732 [2025-03-16 14:52:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:31,268 INFO L225 Difference]: With dead ends: 17435 [2025-03-16 14:52:31,268 INFO L226 Difference]: Without dead ends: 8716 [2025-03-16 14:52:31,275 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-16 14:52:31,275 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 196 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:31,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 360 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8716 states. [2025-03-16 14:52:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8716 to 8716. [2025-03-16 14:52:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8716 states, 8715 states have (on average 1.1006310958118186) internal successors, (9592), 8715 states have internal predecessors, (9592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 9592 transitions. [2025-03-16 14:52:31,345 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 9592 transitions. Word has length 732 [2025-03-16 14:52:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:31,346 INFO L471 AbstractCegarLoop]: Abstraction has 8716 states and 9592 transitions. [2025-03-16 14:52:31,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 9592 transitions. [2025-03-16 14:52:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-16 14:52:31,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:31,358 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:52:31,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:31,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash -879441487, now seen corresponding path program 1 times [2025-03-16 14:52:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:31,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138925335] [2025-03-16 14:52:31,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:31,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-16 14:52:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-16 14:52:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 1433 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 14:52:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138925335] [2025-03-16 14:52:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138925335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576649135] [2025-03-16 14:52:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:31,636 INFO L87 Difference]: Start difference. First operand 8716 states and 9592 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:32,110 INFO L93 Difference]: Finished difference Result 18164 states and 19958 transitions. [2025-03-16 14:52:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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 832 [2025-03-16 14:52:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:32,111 INFO L225 Difference]: With dead ends: 18164 [2025-03-16 14:52:32,111 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:52:32,118 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-16 14:52:32,118 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:32,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 324 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:52:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:52:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:52:32,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 832 [2025-03-16 14:52:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:32,119 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:52:32,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:52:32,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:52:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:52:32,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:52:32,124 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:32,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:52:33,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:52:33,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:52:33 BoogieIcfgContainer [2025-03-16 14:52:33,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:52:33,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:52:33,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:52:33,045 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:52:33,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:18" (3/4) ... [2025-03-16 14:52:33,047 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:52:33,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:52:33,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:52:33,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:52:33,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:52:33,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:52:33,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:52:33,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:52:33,183 INFO L158 Benchmark]: Toolchain (without parser) took 16513.82ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 119.4MB in the beginning and 180.1MB in the end (delta: -60.7MB). Peak memory consumption was 234.9MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,183 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:52:33,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.04ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 76.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.04ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 59.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,184 INFO L158 Benchmark]: Boogie Preprocessor took 118.43ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 36.0MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,184 INFO L158 Benchmark]: IcfgBuilder took 1157.02ms. Allocated memory is still 167.8MB. Free memory was 36.0MB in the beginning and 107.8MB in the end (delta: -71.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,185 INFO L158 Benchmark]: TraceAbstraction took 14491.96ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 106.5MB in the beginning and 196.6MB in the end (delta: -90.1MB). Peak memory consumption was 265.4MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,185 INFO L158 Benchmark]: Witness Printer took 137.61ms. Allocated memory is still 461.4MB. Free memory was 196.6MB in the beginning and 180.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:33,186 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.21ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.04ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 76.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.04ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 59.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.43ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 36.0MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1157.02ms. Allocated memory is still 167.8MB. Free memory was 36.0MB in the beginning and 107.8MB in the end (delta: -71.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14491.96ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 106.5MB in the beginning and 196.6MB in the end (delta: -90.1MB). Peak memory consumption was 265.4MB. Max. memory is 16.1GB. * Witness Printer took 137.61ms. Allocated memory is still 461.4MB. Free memory was 196.6MB in the beginning and 180.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2477 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2477 mSDsluCounter, 3460 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 1628 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9081 IncrementalHoareTripleChecker+Invalid, 10709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1628 mSolverCounterUnsat, 3107 mSDtfsCounter, 9081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8716occurred in iteration=14, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 4660 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4737 NumberOfCodeBlocks, 4737 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4722 ConstructedInterpolants, 0 QuantifiedInterpolants, 8148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 6731/6731 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312))) || (((a25 == 13) && (a29 <= 599998)) && (a4 == 1))) || ((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a4 == 1)) && (a29 <= 130))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 599998))) || (((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || (((a25 == 12) && (a4 == 0)) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || ((((a4 == 0) && (a25 <= 10)) && (a29 <= 599998)) && (a23 <= 138))) || ((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:52:33,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE