./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label00.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 1133d4e628bca1624f90bda56a6327f24f5efa9815c748be39cd9f3813ed8b8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:46:09,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:46:09,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:46:09,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:46:09,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:46:09,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:46:09,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:46:09,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:46:09,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:46:09,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:46:09,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:46:09,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:46:09,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:46:09,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:46:09,711 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:46:09,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:46:09,712 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:46:09,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:09,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:46:09,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:46:09,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:46:09,714 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 -> 1133d4e628bca1624f90bda56a6327f24f5efa9815c748be39cd9f3813ed8b8e [2025-03-03 10:46:09,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:46:09,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:46:09,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:46:09,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:46:09,958 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:46:09,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label00.c [2025-03-03 10:46:11,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232fc2a71/77dc6069bb574689a4c5e13ded924576/FLAGbd196777d [2025-03-03 10:46:11,299 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:46:11,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label00.c [2025-03-03 10:46:11,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232fc2a71/77dc6069bb574689a4c5e13ded924576/FLAGbd196777d [2025-03-03 10:46:11,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232fc2a71/77dc6069bb574689a4c5e13ded924576 [2025-03-03 10:46:11,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:46:11,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:46:11,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:11,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:46:11,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:46:11,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:11,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48602844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11, skipping insertion in model container [2025-03-03 10:46:11,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:11,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:46:11,770 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_label00.c[5469,5482] [2025-03-03 10:46:11,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:11,881 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:46:11,897 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_label00.c[5469,5482] [2025-03-03 10:46:11,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:11,968 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:46:11,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11 WrapperNode [2025-03-03 10:46:11,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:11,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:11,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:46:11,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:46:11,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:11,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,038 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:46:12,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:12,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:46:12,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:46:12,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:46:12,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:46:12,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:46:12,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:46:12,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:46:12,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:46:12,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (1/1) ... [2025-03-03 10:46:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:12,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:46:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:46:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:46:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:46:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:46:12,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:46:12,202 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:46:12,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:46:13,169 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:46:13,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:46:13,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:46:13,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:46:13,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:13 BoogieIcfgContainer [2025-03-03 10:46:13,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:46:13,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:46:13,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:46:13,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:46:13,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:46:11" (1/3) ... [2025-03-03 10:46:13,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46657635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:13, skipping insertion in model container [2025-03-03 10:46:13,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:11" (2/3) ... [2025-03-03 10:46:13,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46657635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:13, skipping insertion in model container [2025-03-03 10:46:13,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:13" (3/3) ... [2025-03-03 10:46:13,192 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label00.c [2025-03-03 10:46:13,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:46:13,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label00.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:46:13,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:46:13,266 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;@70f5408c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:46:13,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:46:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 10:46:13,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:13,278 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] [2025-03-03 10:46:13,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:13,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1697984915, now seen corresponding path program 1 times [2025-03-03 10:46:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:13,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672915402] [2025-03-03 10:46:13,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:13,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 10:46:13,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 10:46:13,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:13,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672915402] [2025-03-03 10:46:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672915402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:46:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950797468] [2025-03-03 10:46:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:13,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:13,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:13,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:13,613 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:14,291 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-03-03 10:46:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 10:46:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:14,301 INFO L225 Difference]: With dead ends: 669 [2025-03-03 10:46:14,301 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 10:46:14,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:14,307 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:14,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:46:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 10:46:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 10:46:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2025-03-03 10:46:14,353 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 53 [2025-03-03 10:46:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:14,354 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2025-03-03 10:46:14,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2025-03-03 10:46:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:46:14,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:14,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:14,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:46:14,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:14,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:14,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1622006905, now seen corresponding path program 1 times [2025-03-03 10:46:14,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:14,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709218424] [2025-03-03 10:46:14,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:14,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:14,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:46:14,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:46:14,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:14,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:14,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709218424] [2025-03-03 10:46:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709218424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:14,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:14,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:46:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369830579] [2025-03-03 10:46:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:14,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:14,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:14,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:14,557 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:15,090 INFO L93 Difference]: Finished difference Result 1076 states and 1760 transitions. [2025-03-03 10:46:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 10:46:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:15,094 INFO L225 Difference]: With dead ends: 1076 [2025-03-03 10:46:15,094 INFO L226 Difference]: Without dead ends: 718 [2025-03-03 10:46:15,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:15,095 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:15,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-03 10:46:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2025-03-03 10:46:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4223776223776223) internal successors, (1017), 715 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2025-03-03 10:46:15,124 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 118 [2025-03-03 10:46:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2025-03-03 10:46:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2025-03-03 10:46:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 10:46:15,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:15,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:46:15,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:15,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -608976206, now seen corresponding path program 1 times [2025-03-03 10:46:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452816230] [2025-03-03 10:46:15,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:15,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 10:46:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 10:46:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452816230] [2025-03-03 10:46:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452816230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:46:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279865163] [2025-03-03 10:46:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:15,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:15,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:15,304 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:15,810 INFO L93 Difference]: Finished difference Result 1608 states and 2324 transitions. [2025-03-03 10:46:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:15,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-03 10:46:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:15,813 INFO L225 Difference]: With dead ends: 1608 [2025-03-03 10:46:15,813 INFO L226 Difference]: Without dead ends: 894 [2025-03-03 10:46:15,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:15,814 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:15,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-03 10:46:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-03-03 10:46:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3314669652855544) internal successors, (1189), 893 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1189 transitions. [2025-03-03 10:46:15,829 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1189 transitions. Word has length 119 [2025-03-03 10:46:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:15,829 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1189 transitions. [2025-03-03 10:46:15,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1189 transitions. [2025-03-03 10:46:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 10:46:15,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:15,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:15,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:46:15,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash 167019779, now seen corresponding path program 1 times [2025-03-03 10:46:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701282301] [2025-03-03 10:46:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 10:46:15,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 10:46:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:16,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:16,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701282301] [2025-03-03 10:46:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701282301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:16,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92029659] [2025-03-03 10:46:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:16,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:16,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:16,048 INFO L87 Difference]: Start difference. First operand 894 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:16,757 INFO L93 Difference]: Finished difference Result 2144 states and 2782 transitions. [2025-03-03 10:46:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-03 10:46:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:16,761 INFO L225 Difference]: With dead ends: 2144 [2025-03-03 10:46:16,761 INFO L226 Difference]: Without dead ends: 1252 [2025-03-03 10:46:16,762 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-03 10:46:16,765 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:16,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:46:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-03 10:46:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2025-03-03 10:46:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.257005604483587) internal successors, (1570), 1249 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1570 transitions. [2025-03-03 10:46:16,787 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1570 transitions. Word has length 122 [2025-03-03 10:46:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:16,787 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1570 transitions. [2025-03-03 10:46:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1570 transitions. [2025-03-03 10:46:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 10:46:16,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:16,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:16,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:46:16,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:16,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 791569205, now seen corresponding path program 1 times [2025-03-03 10:46:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051883478] [2025-03-03 10:46:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:16,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 10:46:16,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 10:46:16,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:16,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051883478] [2025-03-03 10:46:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051883478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:16,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:16,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:16,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704232082] [2025-03-03 10:46:16,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:16,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:16,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:16,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:16,929 INFO L87 Difference]: Start difference. First operand 1250 states and 1570 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-03 10:46:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:17,468 INFO L93 Difference]: Finished difference Result 2885 states and 3573 transitions. [2025-03-03 10:46:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:17,469 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-03 10:46:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:17,473 INFO L225 Difference]: With dead ends: 2885 [2025-03-03 10:46:17,473 INFO L226 Difference]: Without dead ends: 1608 [2025-03-03 10:46:17,474 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-03 10:46:17,475 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:17,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 123 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-03-03 10:46:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2025-03-03 10:46:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1314641744548286) internal successors, (1816), 1605 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1816 transitions. [2025-03-03 10:46:17,500 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1816 transitions. Word has length 133 [2025-03-03 10:46:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:17,500 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1816 transitions. [2025-03-03 10:46:17,500 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-03 10:46:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1816 transitions. [2025-03-03 10:46:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 10:46:17,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:17,502 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:17,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:46:17,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -125855853, now seen corresponding path program 1 times [2025-03-03 10:46:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171290151] [2025-03-03 10:46:17,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 10:46:17,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 10:46:17,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:17,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171290151] [2025-03-03 10:46:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171290151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:17,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84795554] [2025-03-03 10:46:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:17,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:17,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:17,727 INFO L87 Difference]: Start difference. First operand 1606 states and 1816 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:18,140 INFO L93 Difference]: Finished difference Result 3922 states and 4494 transitions. [2025-03-03 10:46:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2025-03-03 10:46:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:18,147 INFO L225 Difference]: With dead ends: 3922 [2025-03-03 10:46:18,147 INFO L226 Difference]: Without dead ends: 2318 [2025-03-03 10:46:18,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:18,149 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:18,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-03 10:46:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2025-03-03 10:46:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1130772550712127) internal successors, (2579), 2317 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2579 transitions. [2025-03-03 10:46:18,182 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2579 transitions. Word has length 227 [2025-03-03 10:46:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:18,182 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2579 transitions. [2025-03-03 10:46:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2579 transitions. [2025-03-03 10:46:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 10:46:18,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:18,185 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:46:18,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1285800348, now seen corresponding path program 1 times [2025-03-03 10:46:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184016503] [2025-03-03 10:46:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:18,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 10:46:18,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 10:46:18,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:18,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-03 10:46:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184016503] [2025-03-03 10:46:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184016503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658813406] [2025-03-03 10:46:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:18,453 INFO L87 Difference]: Start difference. First operand 2318 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:18,941 INFO L93 Difference]: Finished difference Result 4692 states and 5238 transitions. [2025-03-03 10:46:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 10:46:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:18,949 INFO L225 Difference]: With dead ends: 4692 [2025-03-03 10:46:18,949 INFO L226 Difference]: Without dead ends: 2496 [2025-03-03 10:46:18,951 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-03 10:46:18,952 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:18,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-03-03 10:46:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-03-03 10:46:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0738023305999136) internal successors, (2488), 2317 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2488 transitions. [2025-03-03 10:46:18,985 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2488 transitions. Word has length 344 [2025-03-03 10:46:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2488 transitions. [2025-03-03 10:46:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2488 transitions. [2025-03-03 10:46:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-03 10:46:18,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:18,992 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:18,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:46:18,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash -523750861, now seen corresponding path program 1 times [2025-03-03 10:46:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946677665] [2025-03-03 10:46:18,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:19,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-03 10:46:19,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-03 10:46:19,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:19,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:19,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946677665] [2025-03-03 10:46:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946677665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309102637] [2025-03-03 10:46:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:19,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:19,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:19,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:19,367 INFO L87 Difference]: Start difference. First operand 2318 states and 2488 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:19,759 INFO L93 Difference]: Finished difference Result 4812 states and 5232 transitions. [2025-03-03 10:46:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 439 [2025-03-03 10:46:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:19,767 INFO L225 Difference]: With dead ends: 4812 [2025-03-03 10:46:19,767 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:46:19,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:19,769 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:19,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:46:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2140. [2025-03-03 10:46:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0733987844787283) internal successors, (2296), 2139 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2296 transitions. [2025-03-03 10:46:19,799 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2296 transitions. Word has length 439 [2025-03-03 10:46:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:19,799 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2296 transitions. [2025-03-03 10:46:19,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2296 transitions. [2025-03-03 10:46:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-03 10:46:19,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:19,804 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:19,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:46:19,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1430201382, now seen corresponding path program 1 times [2025-03-03 10:46:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:19,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546681585] [2025-03-03 10:46:19,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:19,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 10:46:19,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 10:46:19,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:20,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546681585] [2025-03-03 10:46:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546681585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65056044] [2025-03-03 10:46:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:20,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:20,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:20,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:20,098 INFO L87 Difference]: Start difference. First operand 2140 states and 2296 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:20,499 INFO L93 Difference]: Finished difference Result 4634 states and 5051 transitions. [2025-03-03 10:46:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 446 [2025-03-03 10:46:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:20,506 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 10:46:20,506 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:46:20,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:20,509 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:20,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:46:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2025-03-03 10:46:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0824341821320673) internal successors, (2508), 2317 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2508 transitions. [2025-03-03 10:46:20,541 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2508 transitions. Word has length 446 [2025-03-03 10:46:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:20,542 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2508 transitions. [2025-03-03 10:46:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2508 transitions. [2025-03-03 10:46:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-03 10:46:20,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:20,547 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:46:20,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:20,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1530056419, now seen corresponding path program 1 times [2025-03-03 10:46:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661787223] [2025-03-03 10:46:20,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-03 10:46:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-03 10:46:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:20,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661787223] [2025-03-03 10:46:20,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661787223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:20,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:20,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874407692] [2025-03-03 10:46:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:20,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:20,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:20,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:20,760 INFO L87 Difference]: Start difference. First operand 2318 states and 2508 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:21,160 INFO L93 Difference]: Finished difference Result 5168 states and 5662 transitions. [2025-03-03 10:46:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 487 [2025-03-03 10:46:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:21,167 INFO L225 Difference]: With dead ends: 5168 [2025-03-03 10:46:21,167 INFO L226 Difference]: Without dead ends: 3030 [2025-03-03 10:46:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:21,170 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:21,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-03-03 10:46:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030. [2025-03-03 10:46:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0825354902608122) internal successors, (3279), 3029 states have internal predecessors, (3279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3279 transitions. [2025-03-03 10:46:21,205 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3279 transitions. Word has length 487 [2025-03-03 10:46:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3279 transitions. [2025-03-03 10:46:21,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3279 transitions. [2025-03-03 10:46:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-03 10:46:21,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:21,211 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, 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, 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] [2025-03-03 10:46:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:46:21,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:21,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1047945558, now seen corresponding path program 1 times [2025-03-03 10:46:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655224805] [2025-03-03 10:46:21,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:21,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 10:46:21,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 10:46:21,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655224805] [2025-03-03 10:46:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655224805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:46:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550167886] [2025-03-03 10:46:21,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:21,545 INFO L87 Difference]: Start difference. First operand 3030 states and 3279 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:22,151 INFO L93 Difference]: Finished difference Result 6414 states and 6954 transitions. [2025-03-03 10:46:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:22,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 523 [2025-03-03 10:46:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:22,159 INFO L225 Difference]: With dead ends: 6414 [2025-03-03 10:46:22,160 INFO L226 Difference]: Without dead ends: 3564 [2025-03-03 10:46:22,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:22,162 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 215 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:22,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 68 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:46:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-03-03 10:46:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3208. [2025-03-03 10:46:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0763953850951045) internal successors, (3452), 3207 states have internal predecessors, (3452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3452 transitions. [2025-03-03 10:46:22,201 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3452 transitions. Word has length 523 [2025-03-03 10:46:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3452 transitions. [2025-03-03 10:46:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3452 transitions. [2025-03-03 10:46:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 10:46:22,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:22,208 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:22,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:46:22,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:22,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 915610611, now seen corresponding path program 1 times [2025-03-03 10:46:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46259650] [2025-03-03 10:46:22,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:22,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:22,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:46:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:46:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 10:46:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46259650] [2025-03-03 10:46:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46259650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269153665] [2025-03-03 10:46:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:22,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:22,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:22,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:22,572 INFO L87 Difference]: Start difference. First operand 3208 states and 3452 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:22,954 INFO L93 Difference]: Finished difference Result 6770 states and 7363 transitions. [2025-03-03 10:46:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 601 [2025-03-03 10:46:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:22,963 INFO L225 Difference]: With dead ends: 6770 [2025-03-03 10:46:22,964 INFO L226 Difference]: Without dead ends: 3742 [2025-03-03 10:46:22,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:22,967 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 227 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-03-03 10:46:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2025-03-03 10:46:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0712882402469828) internal successors, (3817), 3563 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3817 transitions. [2025-03-03 10:46:23,007 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3817 transitions. Word has length 601 [2025-03-03 10:46:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:23,007 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3817 transitions. [2025-03-03 10:46:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3817 transitions. [2025-03-03 10:46:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 10:46:23,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:23,011 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, 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, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:23,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:46:23,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1356422160, now seen corresponding path program 1 times [2025-03-03 10:46:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:23,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851787898] [2025-03-03 10:46:23,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:23,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 10:46:23,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 10:46:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 897 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851787898] [2025-03-03 10:46:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851787898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137381477] [2025-03-03 10:46:23,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:23,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:23,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:46:23,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 10:46:23,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 10:46:23,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:23,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:23,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:23,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-03-03 10:46:23,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137381477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:46:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473298280] [2025-03-03 10:46:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:23,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:23,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:23,563 INFO L87 Difference]: Start difference. First operand 3564 states and 3817 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-03 10:46:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:23,999 INFO L93 Difference]: Finished difference Result 7482 states and 8093 transitions. [2025-03-03 10:46:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:23,999 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 642 [2025-03-03 10:46:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:24,008 INFO L225 Difference]: With dead ends: 7482 [2025-03-03 10:46:24,008 INFO L226 Difference]: Without dead ends: 4098 [2025-03-03 10:46:24,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 642 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-03 10:46:24,012 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 128 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:24,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 236 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-03 10:46:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2025-03-03 10:46:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.0719571319214085) internal successors, (4201), 3919 states have internal predecessors, (4201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4201 transitions. [2025-03-03 10:46:24,058 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4201 transitions. Word has length 642 [2025-03-03 10:46:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4201 transitions. [2025-03-03 10:46:24,059 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-03 10:46:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4201 transitions. [2025-03-03 10:46:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 10:46:24,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:24,065 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:24,073 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-03 10:46:24,266 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,SelfDestructingSolverStorable12 [2025-03-03 10:46:24,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 682512361, now seen corresponding path program 1 times [2025-03-03 10:46:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235646472] [2025-03-03 10:46:24,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:24,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 10:46:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 10:46:24,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1829 backedges. 1309 proven. 155 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 10:46:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235646472] [2025-03-03 10:46:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235646472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655107113] [2025-03-03 10:46:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:24,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:24,625 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-03 10:46:24,627 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-03 10:46:24,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 10:46:24,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 10:46:24,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:24,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:24,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:24,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1829 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-03 10:46:24,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655107113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:46:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934378431] [2025-03-03 10:46:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:24,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:24,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:24,860 INFO L87 Difference]: Start difference. First operand 3920 states and 4201 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:25,199 INFO L93 Difference]: Finished difference Result 5524 states and 5882 transitions. [2025-03-03 10:46:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 789 [2025-03-03 10:46:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:25,215 INFO L225 Difference]: With dead ends: 5524 [2025-03-03 10:46:25,218 INFO L226 Difference]: Without dead ends: 5522 [2025-03-03 10:46:25,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 789 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-03 10:46:25,221 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 148 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:25,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 22 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:46:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-03-03 10:46:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4098. [2025-03-03 10:46:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0698071759824261) internal successors, (4383), 4097 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4383 transitions. [2025-03-03 10:46:25,270 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4383 transitions. Word has length 789 [2025-03-03 10:46:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4383 transitions. [2025-03-03 10:46:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4383 transitions. [2025-03-03 10:46:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-03-03 10:46:25,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:25,277 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:25,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:25,478 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,SelfDestructingSolverStorable13 [2025-03-03 10:46:25,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 988620790, now seen corresponding path program 1 times [2025-03-03 10:46:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096895138] [2025-03-03 10:46:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:25,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-03 10:46:25,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-03 10:46:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 1399 proven. 155 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 10:46:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096895138] [2025-03-03 10:46:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096895138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210993007] [2025-03-03 10:46:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:25,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:25,786 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-03 10:46:25,788 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-03 10:46:25,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-03 10:46:25,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-03 10:46:25,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:25,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:25,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:25,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-03-03 10:46:26,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210993007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:46:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992274645] [2025-03-03 10:46:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:26,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:26,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:26,061 INFO L87 Difference]: Start difference. First operand 4098 states and 4383 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:26,423 INFO L93 Difference]: Finished difference Result 8726 states and 9363 transitions. [2025-03-03 10:46:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:26,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 807 [2025-03-03 10:46:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:26,424 INFO L225 Difference]: With dead ends: 8726 [2025-03-03 10:46:26,425 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:46:26,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 807 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-03 10:46:26,430 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:26,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 225 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:46:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:46:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:46:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:46:26,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 807 [2025-03-03 10:46:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:46:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:46:26,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:46:26,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:46:26,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:46:26,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:26,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:26,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:46:26,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:46:26,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:46:26 BoogieIcfgContainer [2025-03-03 10:46:26,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:46:26,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:46:26,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:46:26,929 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:46:26,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:13" (3/4) ... [2025-03-03 10:46:26,930 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:46:26,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:46:26,944 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:46:26,945 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:46:26,945 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:46:27,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:46:27,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:46:27,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:46:27,054 INFO L158 Benchmark]: Toolchain (without parser) took 15441.91ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 108.6MB in the beginning and 196.5MB in the end (delta: -87.9MB). Peak memory consumption was 270.8MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,055 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:46:27,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.19ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 76.7MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.03ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 67.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,055 INFO L158 Benchmark]: Boogie Preprocessor took 78.61ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 56.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,055 INFO L158 Benchmark]: IcfgBuilder took 1066.28ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 69.7MB in the end (delta: -13.4MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,056 INFO L158 Benchmark]: TraceAbstraction took 13741.21ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 68.8MB in the beginning and 208.9MB in the end (delta: -140.1MB). Peak memory consumption was 220.7MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,056 INFO L158 Benchmark]: Witness Printer took 125.50ms. Allocated memory is still 503.3MB. Free memory was 208.9MB in the beginning and 196.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:27,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.19ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 76.7MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.03ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 67.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.61ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 56.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1066.28ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 69.7MB in the end (delta: -13.4MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13741.21ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 68.8MB in the beginning and 208.9MB in the end (delta: -140.1MB). Peak memory consumption was 220.7MB. Max. memory is 16.1GB. * Witness Printer took 125.50ms. Allocated memory is still 503.3MB. Free memory was 208.9MB in the beginning and 196.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 173]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2239 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2239 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 979 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8114 IncrementalHoareTripleChecker+Invalid, 9093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 979 mSolverCounterUnsat, 1767 mSDtfsCounter, 8114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2282 GetRequests, 2256 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4098occurred in iteration=14, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 3210 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 8088 NumberOfCodeBlocks, 8088 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 8070 ConstructedInterpolants, 0 QuantifiedInterpolants, 15205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2760 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 15024/15444 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) && (10 <= a21)) || ((a21 == 8) && (a24 == 1))) || ((a24 == 1) && (12 <= a12))) || (((a24 == 1) && (a15 <= 8)) && (a21 <= 6))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) || (((a24 == 1) && (a15 <= 8)) && (a21 == 9))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:46:27,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE