./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label32.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/Problem14_label32.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 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:16,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:16,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:16,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:16,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:16,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:16,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:16,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:16,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:16,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:16,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:16,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:16,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:16,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:16,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:16,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:16,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:16,452 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 -> 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c [2025-03-16 15:06:16,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:16,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:16,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:16,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:16,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:16,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-03-16 15:06:17,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc511783/573356af7a544c2988b8d038b727b2c0/FLAGbab60917e [2025-03-16 15:06:18,069 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:18,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-03-16 15:06:18,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc511783/573356af7a544c2988b8d038b727b2c0/FLAGbab60917e [2025-03-16 15:06:18,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc511783/573356af7a544c2988b8d038b727b2c0 [2025-03-16 15:06:18,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:18,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:18,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:18,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:18,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:18,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f40adac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18, skipping insertion in model container [2025-03-16 15:06:18,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:18,523 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/Problem14_label32.c[5661,5674] [2025-03-16 15:06:18,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:18,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:18,710 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/Problem14_label32.c[5661,5674] [2025-03-16 15:06:18,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:18,783 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:18,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18 WrapperNode [2025-03-16 15:06:18,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:18,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:18,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:18,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:18,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,856 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:18,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:18,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:18,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:18,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:18,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,904 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 15:06:18,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:18,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:18,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:18,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:18,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:18,985 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 15:06:18,989 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 15:06:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:19,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:19,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:20,073 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:20,074 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:20,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:20,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:20,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20 BoogieIcfgContainer [2025-03-16 15:06:20,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:20,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:20,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:20,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:20,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:18" (1/3) ... [2025-03-16 15:06:20,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aa1d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:20, skipping insertion in model container [2025-03-16 15:06:20,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18" (2/3) ... [2025-03-16 15:06:20,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aa1d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:20, skipping insertion in model container [2025-03-16 15:06:20,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20" (3/3) ... [2025-03-16 15:06:20,093 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label32.c [2025-03-16 15:06:20,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:20,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label32.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:20,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:20,161 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;@20309db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:20,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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 15:06:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 15:06:20,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1887592002, now seen corresponding path program 1 times [2025-03-16 15:06:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049887397] [2025-03-16 15:06:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 15:06:20,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 15:06:20,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:20,294 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 15:06:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049887397] [2025-03-16 15:06:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049887397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384472449] [2025-03-16 15:06:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:06:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:20,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:06:20,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:20,323 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:06:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:20,355 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:06:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:06:20,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2025-03-16 15:06:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:20,363 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:06:20,363 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:06:20,365 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 15:06:20,367 INFO L435 NwaCegarLoop]: 298 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, 298 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 15:06:20,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:06:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:06:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:06:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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 15:06:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:06:20,398 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 54 [2025-03-16 15:06:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:20,398 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:06:20,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:06:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:06:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 15:06:20,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:06:20,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1677413687, now seen corresponding path program 1 times [2025-03-16 15:06:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209698754] [2025-03-16 15:06:20,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 15:06:20,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 15:06:20,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:20,600 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 15:06:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209698754] [2025-03-16 15:06:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209698754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218859231] [2025-03-16 15:06:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:20,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:20,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:20,605 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:06:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:21,238 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2025-03-16 15:06:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2025-03-16 15:06:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:21,241 INFO L225 Difference]: With dead ends: 539 [2025-03-16 15:06:21,241 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:06:21,242 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 15:06:21,242 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 52 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:06:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:06:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 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 15:06:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2025-03-16 15:06:21,260 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 54 [2025-03-16 15:06:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:21,261 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2025-03-16 15:06:21,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:06:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2025-03-16 15:06:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 15:06:21,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:21,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:21,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:06:21,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:21,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 220402695, now seen corresponding path program 1 times [2025-03-16 15:06:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755710193] [2025-03-16 15:06:21,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 15:06:21,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 15:06:21,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755710193] [2025-03-16 15:06:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755710193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:21,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997404508] [2025-03-16 15:06:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:21,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,462 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 15:06:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:22,037 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2025-03-16 15:06:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:22,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2025-03-16 15:06:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:22,040 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:06:22,040 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:06:22,041 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 15:06:22,042 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:22,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:06:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:06:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 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 15:06:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2025-03-16 15:06:22,059 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 129 [2025-03-16 15:06:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:22,060 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2025-03-16 15:06:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 15:06:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2025-03-16 15:06:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 15:06:22,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:22,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:22,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:06:22,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1639656465, now seen corresponding path program 1 times [2025-03-16 15:06:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914719535] [2025-03-16 15:06:22,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:22,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 15:06:22,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 15:06:22,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:22,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914719535] [2025-03-16 15:06:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914719535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:22,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843600578] [2025-03-16 15:06:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:22,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:22,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:22,365 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:23,147 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2025-03-16 15:06:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 15:06:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:23,153 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:06:23,153 INFO L226 Difference]: Without dead ends: 1249 [2025-03-16 15:06:23,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:23,156 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:23,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:06:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-16 15:06:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2025-03-16 15:06:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 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 15:06:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2025-03-16 15:06:23,199 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 133 [2025-03-16 15:06:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:23,199 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2025-03-16 15:06:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2025-03-16 15:06:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 15:06:23,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:23,210 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:23,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:06:23,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 305902664, now seen corresponding path program 1 times [2025-03-16 15:06:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261079658] [2025-03-16 15:06:23,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:23,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 15:06:23,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 15:06:23,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:23,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 15:06:23,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261079658] [2025-03-16 15:06:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261079658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:23,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:23,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452724291] [2025-03-16 15:06:23,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:23,465 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 15:06:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:24,036 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2025-03-16 15:06:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 213 [2025-03-16 15:06:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:24,044 INFO L225 Difference]: With dead ends: 2704 [2025-03-16 15:06:24,044 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:06:24,046 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 15:06:24,048 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:24,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:06:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2025-03-16 15:06:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 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 15:06:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2025-03-16 15:06:24,075 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 213 [2025-03-16 15:06:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:24,076 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2025-03-16 15:06:24,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 15:06:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2025-03-16 15:06:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-16 15:06:24,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:24,080 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, 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, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:06:24,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -976574552, now seen corresponding path program 1 times [2025-03-16 15:06:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486349318] [2025-03-16 15:06:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:24,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-16 15:06:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-16 15:06:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:24,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 206 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:06:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486349318] [2025-03-16 15:06:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486349318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393845688] [2025-03-16 15:06:24,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:24,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:24,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:06:24,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-16 15:06:24,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-16 15:06:24,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:24,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:24,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:24,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 15:06:24,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:24,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393845688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:24,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:24,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798594296] [2025-03-16 15:06:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:24,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:24,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:24,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:24,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:24,774 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 15:06:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:25,219 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2025-03-16 15:06:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 340 [2025-03-16 15:06:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:25,225 INFO L225 Difference]: With dead ends: 3387 [2025-03-16 15:06:25,225 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:06:25,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:25,227 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:25,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 252 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:06:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2025-03-16 15:06:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1321428571428571) internal successors, (2219), 1960 states have internal predecessors, (2219), 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 15:06:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2219 transitions. [2025-03-16 15:06:25,253 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2219 transitions. Word has length 340 [2025-03-16 15:06:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:25,254 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2219 transitions. [2025-03-16 15:06:25,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 15:06:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2219 transitions. [2025-03-16 15:06:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 15:06:25,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:25,257 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, 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, 2, 2, 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] [2025-03-16 15:06:25,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:06:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 15:06:25,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:25,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1891760334, now seen corresponding path program 1 times [2025-03-16 15:06:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802442286] [2025-03-16 15:06:25,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:25,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 15:06:25,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 15:06:25,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:25,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 289 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:25,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802442286] [2025-03-16 15:06:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802442286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32540242] [2025-03-16 15:06:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:25,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:25,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:25,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:25,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:06:26,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 15:06:26,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 15:06:26,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:26,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:26,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:26,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-16 15:06:26,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32540242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:26,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:26,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185977205] [2025-03-16 15:06:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:26,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:26,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:26,138 INFO L87 Difference]: Start difference. First operand 1961 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 15:06:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:26,590 INFO L93 Difference]: Finished difference Result 4277 states and 4909 transitions. [2025-03-16 15:06:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 344 [2025-03-16 15:06:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:26,598 INFO L225 Difference]: With dead ends: 4277 [2025-03-16 15:06:26,598 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:06:26,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:26,601 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:26,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 250 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:06:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2025-03-16 15:06:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.1202886928628708) internal successors, (2794), 2494 states have internal predecessors, (2794), 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 15:06:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2794 transitions. [2025-03-16 15:06:26,644 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2794 transitions. Word has length 344 [2025-03-16 15:06:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:26,645 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2794 transitions. [2025-03-16 15:06:26,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 15:06:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2794 transitions. [2025-03-16 15:06:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 15:06:26,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:26,649 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:26,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:06:26,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 15:06:26,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:26,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1219275003, now seen corresponding path program 1 times [2025-03-16 15:06:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:26,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090138932] [2025-03-16 15:06:26,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:26,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 15:06:26,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 15:06:26,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:26,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 219 proven. 130 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:06:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090138932] [2025-03-16 15:06:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090138932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894257121] [2025-03-16 15:06:27,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:27,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:27,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:06:27,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 15:06:27,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 15:06:27,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:27,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:27,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:27,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-16 15:06:27,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894257121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:06:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45307712] [2025-03-16 15:06:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:27,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:27,594 INFO L87 Difference]: Start difference. First operand 2495 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 15:06:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:28,036 INFO L93 Difference]: Finished difference Result 5523 states and 6311 transitions. [2025-03-16 15:06:28,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 353 [2025-03-16 15:06:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:28,045 INFO L225 Difference]: With dead ends: 5523 [2025-03-16 15:06:28,045 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:06:28,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:28,047 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:28,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 51 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:06:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3029. [2025-03-16 15:06:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.1162483487450463) internal successors, (3380), 3028 states have internal predecessors, (3380), 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 15:06:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3380 transitions. [2025-03-16 15:06:28,087 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3380 transitions. Word has length 353 [2025-03-16 15:06:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:28,088 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3380 transitions. [2025-03-16 15:06:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 15:06:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3380 transitions. [2025-03-16 15:06:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-16 15:06:28,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:28,091 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:28,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:28,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:28,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:28,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1268112711, now seen corresponding path program 1 times [2025-03-16 15:06:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973447] [2025-03-16 15:06:28,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:28,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 15:06:28,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 15:06:28,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:28,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973447] [2025-03-16 15:06:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300066608] [2025-03-16 15:06:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:28,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:28,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:28,418 INFO L87 Difference]: Start difference. First operand 3029 states and 3380 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:28,839 INFO L93 Difference]: Finished difference Result 6591 states and 7450 transitions. [2025-03-16 15:06:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:28,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2025-03-16 15:06:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:28,848 INFO L225 Difference]: With dead ends: 6591 [2025-03-16 15:06:28,849 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:06:28,851 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 15:06:28,853 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:28,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 57 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:06:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3741. [2025-03-16 15:06:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.1211229946524064) internal successors, (4193), 3740 states have internal predecessors, (4193), 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 15:06:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4193 transitions. [2025-03-16 15:06:28,910 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4193 transitions. Word has length 378 [2025-03-16 15:06:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4193 transitions. [2025-03-16 15:06:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4193 transitions. [2025-03-16 15:06:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-16 15:06:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:28,916 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, 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, 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] [2025-03-16 15:06:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:06:28,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1217773149, now seen corresponding path program 1 times [2025-03-16 15:06:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127472840] [2025-03-16 15:06:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:28,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-16 15:06:28,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-16 15:06:28,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 15:06:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:29,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127472840] [2025-03-16 15:06:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127472840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:29,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621308506] [2025-03-16 15:06:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:29,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:29,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:29,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:29,182 INFO L87 Difference]: Start difference. First operand 3741 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 15:06:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:29,564 INFO L93 Difference]: Finished difference Result 7837 states and 8809 transitions. [2025-03-16 15:06:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:29,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 438 [2025-03-16 15:06:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:29,576 INFO L225 Difference]: With dead ends: 7837 [2025-03-16 15:06:29,576 INFO L226 Difference]: Without dead ends: 4275 [2025-03-16 15:06:29,579 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 15:06:29,579 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:29,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-16 15:06:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2025-03-16 15:06:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.111839026672906) internal successors, (4752), 4274 states have internal predecessors, (4752), 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 15:06:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4752 transitions. [2025-03-16 15:06:29,631 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4752 transitions. Word has length 438 [2025-03-16 15:06:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4752 transitions. [2025-03-16 15:06:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 15:06:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4752 transitions. [2025-03-16 15:06:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 15:06:29,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:29,638 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:06:29,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash 294365780, now seen corresponding path program 1 times [2025-03-16 15:06:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316586112] [2025-03-16 15:06:29,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 15:06:29,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 15:06:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:29,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-16 15:06:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316586112] [2025-03-16 15:06:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316586112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:29,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:29,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391962922] [2025-03-16 15:06:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:29,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:29,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:29,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:29,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:29,939 INFO L87 Difference]: Start difference. First operand 4275 states and 4752 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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 15:06:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:30,452 INFO L93 Difference]: Finished difference Result 8607 states and 9578 transitions. [2025-03-16 15:06:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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 518 [2025-03-16 15:06:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:30,462 INFO L225 Difference]: With dead ends: 8607 [2025-03-16 15:06:30,462 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:30,466 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 15:06:30,466 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:30,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4275. [2025-03-16 15:06:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0795507721104352) internal successors, (4614), 4274 states have internal predecessors, (4614), 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 15:06:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4614 transitions. [2025-03-16 15:06:30,520 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4614 transitions. Word has length 518 [2025-03-16 15:06:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4614 transitions. [2025-03-16 15:06:30,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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 15:06:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4614 transitions. [2025-03-16 15:06:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-16 15:06:30,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:30,525 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-16 15:06:30,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:06:30,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1568713617, now seen corresponding path program 1 times [2025-03-16 15:06:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:30,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096022959] [2025-03-16 15:06:30,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:30,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-16 15:06:30,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-16 15:06:30,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:30,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 15:06:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096022959] [2025-03-16 15:06:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096022959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:30,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172431568] [2025-03-16 15:06:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:30,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:30,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:30,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:30,709 INFO L87 Difference]: Start difference. First operand 4275 states and 4614 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 15:06:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:31,109 INFO L93 Difference]: Finished difference Result 9083 states and 9846 transitions. [2025-03-16 15:06:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 533 [2025-03-16 15:06:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:31,126 INFO L225 Difference]: With dead ends: 9083 [2025-03-16 15:06:31,126 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:06:31,132 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 15:06:31,132 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:31,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 56 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:06:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4631. [2025-03-16 15:06:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0788336933045357) internal successors, (4995), 4630 states have internal predecessors, (4995), 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 15:06:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4995 transitions. [2025-03-16 15:06:31,198 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4995 transitions. Word has length 533 [2025-03-16 15:06:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:31,198 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4995 transitions. [2025-03-16 15:06:31,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 15:06:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4995 transitions. [2025-03-16 15:06:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-16 15:06:31,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:31,207 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:31,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:06:31,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:31,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1530869357, now seen corresponding path program 2 times [2025-03-16 15:06:31,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:31,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739699321] [2025-03-16 15:06:31,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:06:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:31,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 544 statements into 2 equivalence classes. [2025-03-16 15:06:31,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 544 statements. [2025-03-16 15:06:31,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 15:06:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-16 15:06:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739699321] [2025-03-16 15:06:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739699321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284887121] [2025-03-16 15:06:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:31,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:31,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:31,264 INFO L87 Difference]: Start difference. First operand 4631 states and 4995 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:31,610 INFO L93 Difference]: Finished difference Result 5701 states and 6165 transitions. [2025-03-16 15:06:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 544 [2025-03-16 15:06:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:31,624 INFO L225 Difference]: With dead ends: 5701 [2025-03-16 15:06:31,624 INFO L226 Difference]: Without dead ends: 5699 [2025-03-16 15:06:31,625 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 15:06:31,626 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:31,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2025-03-16 15:06:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4809. [2025-03-16 15:06:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0809068219633944) internal successors, (5197), 4808 states have internal predecessors, (5197), 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 15:06:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5197 transitions. [2025-03-16 15:06:31,675 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5197 transitions. Word has length 544 [2025-03-16 15:06:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:31,676 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5197 transitions. [2025-03-16 15:06:31,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5197 transitions. [2025-03-16 15:06:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-16 15:06:31,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:31,682 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-03-16 15:06:31,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:06:31,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -538144509, now seen corresponding path program 1 times [2025-03-16 15:06:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:31,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380356696] [2025-03-16 15:06:31,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-16 15:06:31,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-16 15:06:31,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:31,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 940 proven. 11 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 15:06:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:32,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380356696] [2025-03-16 15:06:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380356696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:32,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041924144] [2025-03-16 15:06:32,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:32,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:32,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:32,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:32,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:06:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-16 15:06:32,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-16 15:06:32,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:32,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:32,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:32,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-03-16 15:06:32,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041924144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119237600] [2025-03-16 15:06:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:32,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:32,250 INFO L87 Difference]: Start difference. First operand 4809 states and 5197 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:32,633 INFO L93 Difference]: Finished difference Result 10685 states and 11563 transitions. [2025-03-16 15:06:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 626 [2025-03-16 15:06:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:32,642 INFO L225 Difference]: With dead ends: 10685 [2025-03-16 15:06:32,642 INFO L226 Difference]: Without dead ends: 5699 [2025-03-16 15:06:32,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:32,646 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:32,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 245 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2025-03-16 15:06:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4453. [2025-03-16 15:06:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0790655884995508) internal successors, (4804), 4452 states have internal predecessors, (4804), 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 15:06:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4804 transitions. [2025-03-16 15:06:32,706 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4804 transitions. Word has length 626 [2025-03-16 15:06:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:32,707 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4804 transitions. [2025-03-16 15:06:32,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4804 transitions. [2025-03-16 15:06:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-03-16 15:06:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:32,719 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, 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, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:32,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:32,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1727998583, now seen corresponding path program 1 times [2025-03-16 15:06:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624587187] [2025-03-16 15:06:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:32,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-03-16 15:06:32,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-03-16 15:06:32,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:32,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1364 proven. 11 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-03-16 15:06:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624587187] [2025-03-16 15:06:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624587187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452863025] [2025-03-16 15:06:33,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:33,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:33,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:06:33,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-03-16 15:06:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-03-16 15:06:33,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:33,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:33,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:33,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1283 proven. 0 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-03-16 15:06:33,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452863025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832021370] [2025-03-16 15:06:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:33,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:33,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:33,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:33,751 INFO L87 Difference]: Start difference. First operand 4453 states and 4804 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 15:06:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:34,080 INFO L93 Difference]: Finished difference Result 8549 states and 9249 transitions. [2025-03-16 15:06:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 825 [2025-03-16 15:06:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:34,088 INFO L225 Difference]: With dead ends: 8549 [2025-03-16 15:06:34,088 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:34,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:34,093 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:34,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4275. [2025-03-16 15:06:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0699578848853533) internal successors, (4573), 4274 states have internal predecessors, (4573), 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 15:06:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4573 transitions. [2025-03-16 15:06:34,128 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4573 transitions. Word has length 825 [2025-03-16 15:06:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:34,128 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4573 transitions. [2025-03-16 15:06:34,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 15:06:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4573 transitions. [2025-03-16 15:06:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-03-16 15:06:34,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:34,137 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, 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, 5, 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, 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] [2025-03-16 15:06:34,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:34,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:06:34,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:34,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 637154951, now seen corresponding path program 1 times [2025-03-16 15:06:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659683140] [2025-03-16 15:06:34,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:34,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-03-16 15:06:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-03-16 15:06:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1559 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 15:06:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659683140] [2025-03-16 15:06:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659683140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332494314] [2025-03-16 15:06:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:34,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:34,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:34,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:34,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:06:34,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-03-16 15:06:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-03-16 15:06:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:34,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:34,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-03-16 15:06:34,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332494314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:06:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586262070] [2025-03-16 15:06:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:34,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:34,987 INFO L87 Difference]: Start difference. First operand 4275 states and 4573 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 15:06:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:35,337 INFO L93 Difference]: Finished difference Result 5165 states and 5534 transitions. [2025-03-16 15:06:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 879 [2025-03-16 15:06:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:35,338 INFO L225 Difference]: With dead ends: 5165 [2025-03-16 15:06:35,338 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:06:35,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:35,341 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 146 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:35,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 7 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:06:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:06:35,341 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 15:06:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:06:35,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 879 [2025-03-16 15:06:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:06:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 15:06:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:06:35,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:06:35,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:06:35,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:06:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:06:35,550 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:35,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:06:35,884 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:06:35,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:06:35 BoogieIcfgContainer [2025-03-16 15:06:35,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:06:35,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:06:35,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:06:35,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:06:35,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20" (3/4) ... [2025-03-16 15:06:35,899 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:06:35,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:06:35,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:06:35,916 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:06:35,916 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:06:36,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:06:36,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:06:36,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:06:36,018 INFO L158 Benchmark]: Toolchain (without parser) took 17672.47ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 131.4MB in the beginning and 218.5MB in the end (delta: -87.1MB). Peak memory consumption was 317.5MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.63ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 99.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.79ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 90.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: Boogie Preprocessor took 101.93ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 79.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: IcfgBuilder took 1124.55ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 124.2MB in the end (delta: -44.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: TraceAbstraction took 15809.47ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 124.2MB in the beginning and 231.1MB in the end (delta: -106.8MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,018 INFO L158 Benchmark]: Witness Printer took 119.92ms. Allocated memory is still 570.4MB. Free memory was 231.1MB in the beginning and 218.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:36,019 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.63ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 99.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.79ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 90.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.93ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 79.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1124.55ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 124.2MB in the end (delta: -44.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15809.47ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 124.2MB in the beginning and 231.1MB in the end (delta: -106.8MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. * Witness Printer took 119.92ms. Allocated memory is still 570.4MB. Free memory was 231.1MB in the beginning and 218.5MB in the end (delta: 12.6MB). 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: 179]: 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, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1842 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1842 mSDsluCounter, 1914 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 964 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7598 IncrementalHoareTripleChecker+Invalid, 8562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 964 mSolverCounterUnsat, 1843 mSDtfsCounter, 7598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3413 GetRequests, 3376 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4809occurred in iteration=13, InterpolantAutomatonStates: 50, 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, 16 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 9728 NumberOfCodeBlocks, 9238 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9706 ConstructedInterpolants, 0 QuantifiedInterpolants, 28354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4234 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 16381/16948 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: 890]: Location Invariant Derived location invariant: ((((((((a24 == 1) && (a21 <= 8)) || (((a12 <= 11) && (a24 == 1)) && (10 <= a21))) || ((a24 == 1) && (81 <= a12))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || ((a24 == 1) && (a15 <= 5))) || (((a12 <= 11) && (a24 == 1)) && (a15 <= 8))) || (((a21 <= 7) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:06:36,035 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