./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i -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 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:37:17,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:37:17,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:37:17,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:37:17,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:37:17,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:37:17,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:37:17,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:37:17,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:37:17,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:37:17,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:37:17,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:37:17,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:37:17,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:37:17,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:37:17,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:37:17,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:37:17,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:37:17,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:37:17,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:37:17,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:37:17,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:37:17,620 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 -> 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 [2025-03-17 04:37:17,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:37:17,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:37:17,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:37:17,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:37:17,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:37:17,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2025-03-17 04:37:19,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54f10e8/bcba307fed384771851b4d6127ba461a/FLAG51c68f4fb [2025-03-17 04:37:19,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:37:19,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2025-03-17 04:37:19,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54f10e8/bcba307fed384771851b4d6127ba461a/FLAG51c68f4fb [2025-03-17 04:37:19,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54f10e8/bcba307fed384771851b4d6127ba461a [2025-03-17 04:37:19,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:37:19,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:37:19,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:37:19,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:37:19,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:37:19,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19, skipping insertion in model container [2025-03-17 04:37:19,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:37:19,773 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/hardness-nfm22/hardness_operatoramount_amount25_file-22.i[915,928] [2025-03-17 04:37:19,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:37:19,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:37:19,844 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/hardness-nfm22/hardness_operatoramount_amount25_file-22.i[915,928] [2025-03-17 04:37:19,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:37:19,878 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:37:19,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19 WrapperNode [2025-03-17 04:37:19,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:37:19,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:37:19,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:37:19,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:37:19,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,913 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 04:37:19,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:37:19,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:37:19,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:37:19,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:37:19,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,933 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-17 04:37:19,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:37:19,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:37:19,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:37:19,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:37:19,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (1/1) ... [2025-03-17 04:37:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:37:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:19,975 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-17 04:37:19,977 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-17 04:37:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:37:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:37:19,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:37:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:37:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:37:19,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:37:20,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:37:20,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:37:20,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2025-03-17 04:37:20,254 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 04:37:20,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:37:20,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:37:20,266 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:37:20,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:37:20 BoogieIcfgContainer [2025-03-17 04:37:20,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:37:20,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:37:20,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:37:20,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:37:20,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:37:19" (1/3) ... [2025-03-17 04:37:20,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef9b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:37:20, skipping insertion in model container [2025-03-17 04:37:20,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:37:19" (2/3) ... [2025-03-17 04:37:20,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef9b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:37:20, skipping insertion in model container [2025-03-17 04:37:20,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:37:20" (3/3) ... [2025-03-17 04:37:20,273 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-22.i [2025-03-17 04:37:20,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:37:20,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-22.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:37:20,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:37:20,334 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;@7d5bf583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:37:20,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:37:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 04:37:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 04:37:20,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:20,344 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:20,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:20,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash 37104629, now seen corresponding path program 1 times [2025-03-17 04:37:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650704670] [2025-03-17 04:37:20,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:20,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 04:37:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 04:37:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:20,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 04:37:20,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:20,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650704670] [2025-03-17 04:37:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650704670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927460254] [2025-03-17 04:37:20,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:20,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:20,540 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-17 04:37:20,543 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-17 04:37:20,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 04:37:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 04:37:20,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:20,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:20,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:37:20,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 04:37:20,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927460254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:20,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:20,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:37:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998150466] [2025-03-17 04:37:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:20,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:37:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:20,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:37:20,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:37:20,695 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 04:37:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:20,714 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2025-03-17 04:37:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:37:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2025-03-17 04:37:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:20,721 INFO L225 Difference]: With dead ends: 81 [2025-03-17 04:37:20,721 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 04:37:20,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:37:20,727 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:20,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:37:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 04:37:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 04:37:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 04:37:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-17 04:37:20,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 55 [2025-03-17 04:37:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-17 04:37:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 04:37:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-17 04:37:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 04:37:20,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:20,766 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:20,774 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-17 04:37:20,966 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,SelfDestructingSolverStorable0 [2025-03-17 04:37:20,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:20,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1237246215, now seen corresponding path program 1 times [2025-03-17 04:37:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:20,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43261557] [2025-03-17 04:37:20,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:20,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 04:37:21,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 04:37:21,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:21,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43261557] [2025-03-17 04:37:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43261557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:37:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794914801] [2025-03-17 04:37:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:21,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:37:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:21,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:37:21,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:37:21,525 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:21,714 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2025-03-17 04:37:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:37:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2025-03-17 04:37:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:21,716 INFO L225 Difference]: With dead ends: 136 [2025-03-17 04:37:21,716 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 04:37:21,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:37:21,717 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 100 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:21,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 153 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 04:37:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2025-03-17 04:37:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:37:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2025-03-17 04:37:21,732 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 55 [2025-03-17 04:37:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:21,733 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2025-03-17 04:37:21,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2025-03-17 04:37:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 04:37:21,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:21,734 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:37:21,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1744959247, now seen corresponding path program 1 times [2025-03-17 04:37:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-03-17 04:37:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:21,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 04:37:21,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 04:37:21,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:21,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-03-17 04:37:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619234048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:21,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:37:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289922096] [2025-03-17 04:37:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:21,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:37:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:37:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:37:21,954 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:22,084 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2025-03-17 04:37:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:37:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2025-03-17 04:37:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:22,086 INFO L225 Difference]: With dead ends: 131 [2025-03-17 04:37:22,086 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 04:37:22,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 04:37:22,087 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:22,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 04:37:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2025-03-17 04:37:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:37:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2025-03-17 04:37:22,105 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 56 [2025-03-17 04:37:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:22,105 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2025-03-17 04:37:22,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2025-03-17 04:37:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 04:37:22,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:22,106 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:22,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:37:22,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -28202167, now seen corresponding path program 1 times [2025-03-17 04:37:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460464182] [2025-03-17 04:37:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:22,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 04:37:22,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 04:37:22,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:22,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460464182] [2025-03-17 04:37:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460464182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:22,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:37:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794404737] [2025-03-17 04:37:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:22,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:37:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:22,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:37:22,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:37:22,435 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:22,593 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-03-17 04:37:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:37:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2025-03-17 04:37:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:22,595 INFO L225 Difference]: With dead ends: 187 [2025-03-17 04:37:22,595 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 04:37:22,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:37:22,597 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:22,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 203 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 04:37:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2025-03-17 04:37:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 04:37:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2025-03-17 04:37:22,624 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 56 [2025-03-17 04:37:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2025-03-17 04:37:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2025-03-17 04:37:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 04:37:22,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:22,625 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:37:22,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -321605174, now seen corresponding path program 1 times [2025-03-17 04:37:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577104962] [2025-03-17 04:37:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 04:37:22,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 04:37:22,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577104962] [2025-03-17 04:37:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577104962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:37:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876976885] [2025-03-17 04:37:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:37:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:37:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:37:22,678 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:22,704 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2025-03-17 04:37:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:37:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2025-03-17 04:37:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:22,707 INFO L225 Difference]: With dead ends: 179 [2025-03-17 04:37:22,707 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 04:37:22,707 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-17 04:37:22,708 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:22,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:37:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 04:37:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2025-03-17 04:37:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 04:37:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-17 04:37:22,722 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 56 [2025-03-17 04:37:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:22,722 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-17 04:37:22,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-17 04:37:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 04:37:22,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:22,727 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:22,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:37:22,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:22,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 570619071, now seen corresponding path program 1 times [2025-03-17 04:37:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367459572] [2025-03-17 04:37:22,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:22,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 04:37:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 04:37:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367459572] [2025-03-17 04:37:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367459572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:23,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:37:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443954106] [2025-03-17 04:37:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:37:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:23,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:37:23,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:37:23,519 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:23,816 INFO L93 Difference]: Finished difference Result 331 states and 442 transitions. [2025-03-17 04:37:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:37:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2025-03-17 04:37:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:23,819 INFO L225 Difference]: With dead ends: 331 [2025-03-17 04:37:23,820 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 04:37:23,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:37:23,822 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 207 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:23,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 376 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:37:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 04:37:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 107. [2025-03-17 04:37:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 04:37:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2025-03-17 04:37:23,847 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 57 [2025-03-17 04:37:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:23,847 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2025-03-17 04:37:23,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2025-03-17 04:37:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 04:37:23,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:23,849 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:23,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:37:23,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:23,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1530653157, now seen corresponding path program 1 times [2025-03-17 04:37:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:23,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048259054] [2025-03-17 04:37:23,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:23,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 04:37:23,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 04:37:23,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:23,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048259054] [2025-03-17 04:37:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048259054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:37:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143969907] [2025-03-17 04:37:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:23,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:37:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:23,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:37:23,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:37:23,890 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:23,941 INFO L93 Difference]: Finished difference Result 269 states and 362 transitions. [2025-03-17 04:37:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:37:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2025-03-17 04:37:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:23,943 INFO L225 Difference]: With dead ends: 269 [2025-03-17 04:37:23,943 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 04:37:23,943 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-17 04:37:23,944 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:23,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:37:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 04:37:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-03-17 04:37:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 138 states have internal predecessors, (169), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 04:37:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 239 transitions. [2025-03-17 04:37:23,966 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 239 transitions. Word has length 57 [2025-03-17 04:37:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:23,968 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 239 transitions. [2025-03-17 04:37:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 239 transitions. [2025-03-17 04:37:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 04:37:23,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:23,969 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:23,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:37:23,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:23,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1239278637, now seen corresponding path program 1 times [2025-03-17 04:37:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:23,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-03-17 04:37:23,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:23,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 04:37:23,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 04:37:23,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:23,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:24,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-03-17 04:37:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610274409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:24,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:37:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497155485] [2025-03-17 04:37:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:37:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:24,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:37:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:37:24,582 INFO L87 Difference]: Start difference. First operand 179 states and 239 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:24,777 INFO L93 Difference]: Finished difference Result 331 states and 435 transitions. [2025-03-17 04:37:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:37:24,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2025-03-17 04:37:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:24,779 INFO L225 Difference]: With dead ends: 331 [2025-03-17 04:37:24,779 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 04:37:24,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:37:24,780 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:24,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 04:37:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2025-03-17 04:37:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.232258064516129) internal successors, (191), 155 states have internal predecessors, (191), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 04:37:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2025-03-17 04:37:24,818 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 58 [2025-03-17 04:37:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:24,819 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2025-03-17 04:37:24,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2025-03-17 04:37:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 04:37:24,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:24,819 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:24,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:37:24,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:24,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1368361356, now seen corresponding path program 1 times [2025-03-17 04:37:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836451049] [2025-03-17 04:37:24,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:24,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 04:37:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 04:37:24,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836451049] [2025-03-17 04:37:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836451049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:37:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267939166] [2025-03-17 04:37:24,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:24,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:37:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:24,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:37:24,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:37:24,862 INFO L87 Difference]: Start difference. First operand 196 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:24,903 INFO L93 Difference]: Finished difference Result 332 states and 442 transitions. [2025-03-17 04:37:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:37:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2025-03-17 04:37:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:24,906 INFO L225 Difference]: With dead ends: 332 [2025-03-17 04:37:24,907 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 04:37:24,907 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-17 04:37:24,908 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:24,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:37:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 04:37:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2025-03-17 04:37:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 108 states have internal predecessors, (128), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 04:37:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2025-03-17 04:37:24,923 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 58 [2025-03-17 04:37:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:24,924 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2025-03-17 04:37:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2025-03-17 04:37:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 04:37:24,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:24,926 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:24,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:37:24,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:24,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 184435400, now seen corresponding path program 1 times [2025-03-17 04:37:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-03-17 04:37:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:24,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 04:37:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 04:37:24,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:24,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-03-17 04:37:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711337571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:37:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533981619] [2025-03-17 04:37:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:25,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:37:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:25,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:37:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:37:25,401 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:25,963 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2025-03-17 04:37:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:37:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-03-17 04:37:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:25,966 INFO L225 Difference]: With dead ends: 262 [2025-03-17 04:37:25,966 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 04:37:25,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:37:25,966 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 161 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:25,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 402 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:37:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 04:37:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 203. [2025-03-17 04:37:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 162 states have internal predecessors, (195), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 04:37:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2025-03-17 04:37:25,991 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 60 [2025-03-17 04:37:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2025-03-17 04:37:25,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2025-03-17 04:37:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 04:37:25,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:25,996 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:37:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:37:25,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 163247258, now seen corresponding path program 1 times [2025-03-17 04:37:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783806005] [2025-03-17 04:37:25,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:26,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 04:37:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 04:37:26,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 04:37:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783806005] [2025-03-17 04:37:26,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783806005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:37:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598772849] [2025-03-17 04:37:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:26,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:37:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:26,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:37:26,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:37:26,449 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:26,661 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2025-03-17 04:37:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:37:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-03-17 04:37:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:26,663 INFO L225 Difference]: With dead ends: 212 [2025-03-17 04:37:26,663 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 04:37:26,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:37:26,664 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:26,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 387 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 04:37:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2025-03-17 04:37:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 04:37:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2025-03-17 04:37:26,682 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 61 [2025-03-17 04:37:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:26,683 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2025-03-17 04:37:26,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2025-03-17 04:37:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 04:37:26,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:26,684 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 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] [2025-03-17 04:37:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:37:26,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -42063158, now seen corresponding path program 1 times [2025-03-17 04:37:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:26,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-03-17 04:37:26,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 04:37:26,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 04:37:26,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:26,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:27,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-03-17 04:37:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254482493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617301224] [2025-03-17 04:37:27,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:27,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:27,352 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-17 04:37:27,354 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-17 04:37:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 04:37:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 04:37:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:27,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 04:37:27,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 7 proven. 214 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-17 04:37:27,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:37:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617301224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:37:31,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:37:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-03-17 04:37:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657800177] [2025-03-17 04:37:31,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:37:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 04:37:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:31,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 04:37:31,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:37:31,078 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 04:37:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:35,379 INFO L93 Difference]: Finished difference Result 1373 states and 1707 transitions. [2025-03-17 04:37:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-17 04:37:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 114 [2025-03-17 04:37:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:35,387 INFO L225 Difference]: With dead ends: 1373 [2025-03-17 04:37:35,387 INFO L226 Difference]: Without dead ends: 1226 [2025-03-17 04:37:35,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1324, Invalid=5986, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 04:37:35,391 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1187 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:35,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1314 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:37:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-17 04:37:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 577. [2025-03-17 04:37:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 456 states have (on average 1.1754385964912282) internal successors, (536), 456 states have internal predecessors, (536), 105 states have call successors, (105), 15 states have call predecessors, (105), 15 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 04:37:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 746 transitions. [2025-03-17 04:37:35,479 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 746 transitions. Word has length 114 [2025-03-17 04:37:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:35,479 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 746 transitions. [2025-03-17 04:37:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 04:37:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 746 transitions. [2025-03-17 04:37:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 04:37:35,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:35,480 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 04:37:35,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:37:35,681 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,SelfDestructingSolverStorable11 [2025-03-17 04:37:35,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash 140928350, now seen corresponding path program 1 times [2025-03-17 04:37:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407858861] [2025-03-17 04:37:35,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 04:37:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 04:37:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:36,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407858861] [2025-03-17 04:37:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407858861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760360190] [2025-03-17 04:37:36,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:36,750 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-17 04:37:36,752 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-17 04:37:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 04:37:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 04:37:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:36,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:36,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 04:37:36,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 04:37:37,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760360190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2025-03-17 04:37:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817719] [2025-03-17 04:37:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:37:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:37,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:37:37,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:37:37,273 INFO L87 Difference]: Start difference. First operand 577 states and 746 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:37,408 INFO L93 Difference]: Finished difference Result 1110 states and 1432 transitions. [2025-03-17 04:37:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:37:37,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 115 [2025-03-17 04:37:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:37,412 INFO L225 Difference]: With dead ends: 1110 [2025-03-17 04:37:37,413 INFO L226 Difference]: Without dead ends: 679 [2025-03-17 04:37:37,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:37:37,414 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:37,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-17 04:37:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 568. [2025-03-17 04:37:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 447 states have (on average 1.174496644295302) internal successors, (525), 447 states have internal predecessors, (525), 105 states have call successors, (105), 15 states have call predecessors, (105), 15 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 04:37:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 735 transitions. [2025-03-17 04:37:37,459 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 735 transitions. Word has length 115 [2025-03-17 04:37:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:37,459 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 735 transitions. [2025-03-17 04:37:37,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 735 transitions. [2025-03-17 04:37:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 04:37:37,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:37,461 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 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] [2025-03-17 04:37:37,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:37:37,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:37,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:37,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1247167366, now seen corresponding path program 1 times [2025-03-17 04:37:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930275884] [2025-03-17 04:37:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 04:37:37,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 04:37:37,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:37,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930275884] [2025-03-17 04:37:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930275884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177956520] [2025-03-17 04:37:38,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:38,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:38,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:37:38,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:37:38,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 04:37:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 04:37:38,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:38,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:38,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 04:37:38,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 55 proven. 233 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 04:37:39,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:37:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 04:37:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177956520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:37:41,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:37:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 10] total 27 [2025-03-17 04:37:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070063703] [2025-03-17 04:37:41,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:37:41,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 04:37:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:41,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 04:37:41,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-17 04:37:41,152 INFO L87 Difference]: Start difference. First operand 568 states and 735 transitions. Second operand has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-17 04:37:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:43,284 INFO L93 Difference]: Finished difference Result 1717 states and 2151 transitions. [2025-03-17 04:37:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-17 04:37:43,284 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) Word has length 116 [2025-03-17 04:37:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:43,294 INFO L225 Difference]: With dead ends: 1717 [2025-03-17 04:37:43,294 INFO L226 Difference]: Without dead ends: 1394 [2025-03-17 04:37:43,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1631, Invalid=4531, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 04:37:43,298 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1114 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:43,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1164 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:37:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-17 04:37:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2025-03-17 04:37:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 611 states have (on average 1.160392798690671) internal successors, (709), 611 states have internal predecessors, (709), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 04:37:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1003 transitions. [2025-03-17 04:37:43,406 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1003 transitions. Word has length 116 [2025-03-17 04:37:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1003 transitions. [2025-03-17 04:37:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 26 states have internal predecessors, (134), 8 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-17 04:37:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1003 transitions. [2025-03-17 04:37:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 04:37:43,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:43,409 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 04:37:43,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 04:37:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:43,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1452368930, now seen corresponding path program 1 times [2025-03-17 04:37:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36723909] [2025-03-17 04:37:43,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:43,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:37:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:37:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36723909] [2025-03-17 04:37:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36723909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38979580] [2025-03-17 04:37:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:47,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:37:47,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 04:37:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:37:47,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:37:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:47,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:37:47,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 04:37:47,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38979580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:47,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-03-17 04:37:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038927769] [2025-03-17 04:37:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:37:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:47,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:37:47,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:37:47,332 INFO L87 Difference]: Start difference. First operand 792 states and 1003 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:47,495 INFO L93 Difference]: Finished difference Result 1303 states and 1649 transitions. [2025-03-17 04:37:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:37:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 117 [2025-03-17 04:37:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:47,503 INFO L225 Difference]: With dead ends: 1303 [2025-03-17 04:37:47,503 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 04:37:47,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:37:47,505 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:47,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 159 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 04:37:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 729. [2025-03-17 04:37:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 548 states have (on average 1.1277372262773722) internal successors, (618), 548 states have internal predecessors, (618), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 04:37:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 912 transitions. [2025-03-17 04:37:47,568 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 912 transitions. Word has length 117 [2025-03-17 04:37:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 912 transitions. [2025-03-17 04:37:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 912 transitions. [2025-03-17 04:37:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 04:37:47,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:47,572 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-17 04:37:47,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 04:37:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 04:37:47,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:47,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1729291831, now seen corresponding path program 1 times [2025-03-17 04:37:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:47,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136553998] [2025-03-17 04:37:47,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:37:47,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:37:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136553998] [2025-03-17 04:37:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136553998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339293361] [2025-03-17 04:37:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:49,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:37:49,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 04:37:49,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:37:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:37:49,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:49,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 04:37:49,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 04:37:50,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:50,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339293361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:50,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:50,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2025-03-17 04:37:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413665506] [2025-03-17 04:37:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:50,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:37:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:50,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:37:50,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-03-17 04:37:50,258 INFO L87 Difference]: Start difference. First operand 729 states and 912 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:50,696 INFO L93 Difference]: Finished difference Result 881 states and 1094 transitions. [2025-03-17 04:37:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:37:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2025-03-17 04:37:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:50,701 INFO L225 Difference]: With dead ends: 881 [2025-03-17 04:37:50,701 INFO L226 Difference]: Without dead ends: 879 [2025-03-17 04:37:50,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-17 04:37:50,703 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:50,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 488 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:37:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-17 04:37:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 746. [2025-03-17 04:37:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 565 states have (on average 1.1238938053097345) internal successors, (635), 565 states have internal predecessors, (635), 147 states have call successors, (147), 33 states have call predecessors, (147), 33 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 04:37:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 929 transitions. [2025-03-17 04:37:50,776 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 929 transitions. Word has length 118 [2025-03-17 04:37:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:50,777 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 929 transitions. [2025-03-17 04:37:50,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 929 transitions. [2025-03-17 04:37:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 04:37:50,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:50,778 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 04:37:50,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 04:37:50,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 04:37:50,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash 768724106, now seen corresponding path program 1 times [2025-03-17 04:37:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257665545] [2025-03-17 04:37:50,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:50,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:37:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:37:51,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:51,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 04:37:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257665545] [2025-03-17 04:37:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257665545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:37:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:37:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788265387] [2025-03-17 04:37:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:37:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:51,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:37:51,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:37:51,214 INFO L87 Difference]: Start difference. First operand 746 states and 929 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:51,423 INFO L93 Difference]: Finished difference Result 1333 states and 1661 transitions. [2025-03-17 04:37:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:37:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2025-03-17 04:37:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:51,428 INFO L225 Difference]: With dead ends: 1333 [2025-03-17 04:37:51,428 INFO L226 Difference]: Without dead ends: 749 [2025-03-17 04:37:51,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:37:51,430 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:51,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-17 04:37:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 687. [2025-03-17 04:37:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 524 states have (on average 1.118320610687023) internal successors, (586), 524 states have internal predecessors, (586), 133 states have call successors, (133), 29 states have call predecessors, (133), 29 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-17 04:37:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 852 transitions. [2025-03-17 04:37:51,522 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 852 transitions. Word has length 118 [2025-03-17 04:37:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:51,522 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 852 transitions. [2025-03-17 04:37:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 852 transitions. [2025-03-17 04:37:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 04:37:51,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:51,524 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:37:51,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:37:51,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:51,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1964317594, now seen corresponding path program 1 times [2025-03-17 04:37:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053247577] [2025-03-17 04:37:51,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:51,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 04:37:51,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 04:37:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:51,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:52,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053247577] [2025-03-17 04:37:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053247577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591590543] [2025-03-17 04:37:52,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:52,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:52,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:52,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:37:52,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 04:37:52,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 04:37:52,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 04:37:52,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:52,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:52,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 04:37:52,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 04:37:54,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591590543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 26 [2025-03-17 04:37:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226929115] [2025-03-17 04:37:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:37:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:54,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:37:54,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:37:54,595 INFO L87 Difference]: Start difference. First operand 687 states and 852 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:55,075 INFO L93 Difference]: Finished difference Result 841 states and 1041 transitions. [2025-03-17 04:37:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:37:55,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2025-03-17 04:37:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:55,079 INFO L225 Difference]: With dead ends: 841 [2025-03-17 04:37:55,079 INFO L226 Difference]: Without dead ends: 839 [2025-03-17 04:37:55,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 04:37:55,082 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:55,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 554 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:37:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-17 04:37:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 674. [2025-03-17 04:37:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 511 states have (on average 1.1135029354207437) internal successors, (569), 511 states have internal predecessors, (569), 133 states have call successors, (133), 29 states have call predecessors, (133), 29 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-17 04:37:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 835 transitions. [2025-03-17 04:37:55,146 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 835 transitions. Word has length 119 [2025-03-17 04:37:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:55,146 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 835 transitions. [2025-03-17 04:37:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 835 transitions. [2025-03-17 04:37:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 04:37:55,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:37:55,148 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 04:37:55,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 04:37:55,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:55,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:37:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:37:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 167366235, now seen corresponding path program 1 times [2025-03-17 04:37:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:37:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026115042] [2025-03-17 04:37:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:37:55,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 04:37:55,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 04:37:55,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:55,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:37:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:37:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026115042] [2025-03-17 04:37:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026115042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:37:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914082136] [2025-03-17 04:37:56,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:37:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:37:56,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:37:56,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 04:37:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 04:37:56,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 04:37:56,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:37:56,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:37:56,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 04:37:56,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:37:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 04:37:56,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:37:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914082136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:37:56,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:37:56,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-17 04:37:56,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578924543] [2025-03-17 04:37:56,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:37:56,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:37:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:37:56,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:37:56,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 04:37:56,356 INFO L87 Difference]: Start difference. First operand 674 states and 835 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:37:56,584 INFO L93 Difference]: Finished difference Result 1189 states and 1480 transitions. [2025-03-17 04:37:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:37:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2025-03-17 04:37:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:37:56,586 INFO L225 Difference]: With dead ends: 1189 [2025-03-17 04:37:56,586 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:37:56,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:37:56,589 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:37:56,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 314 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:37:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:37:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:37:56,590 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-17 04:37:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:37:56,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2025-03-17 04:37:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:37:56,591 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:37:56,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 04:37:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:37:56,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:37:56,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:37:56,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 04:37:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:37:56,797 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:37:56,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:38:06,165 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 417 DAG size of output: 469 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 04:38:13,731 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:38:13,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:38:13 BoogieIcfgContainer [2025-03-17 04:38:13,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:38:13,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:38:13,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:38:13,744 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:38:13,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:37:20" (3/4) ... [2025-03-17 04:38:13,767 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:38:13,774 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:38:13,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 04:38:13,782 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 04:38:13,783 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:38:13,783 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:38:13,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:38:13,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:38:13,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:38:13,901 INFO L158 Benchmark]: Toolchain (without parser) took 54262.35ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 111.4MB in the beginning and 120.8MB in the end (delta: -9.4MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2025-03-17 04:38:13,901 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:38:13,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.03ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:38:13,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:38:13,903 INFO L158 Benchmark]: Boogie Preprocessor took 34.03ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:38:13,904 INFO L158 Benchmark]: IcfgBuilder took 318.10ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:38:13,904 INFO L158 Benchmark]: TraceAbstraction took 53475.18ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 1.1GB in the end (delta: -990.9MB). Peak memory consumption was 732.5MB. Max. memory is 16.1GB. [2025-03-17 04:38:13,905 INFO L158 Benchmark]: Witness Printer took 156.67ms. Allocated memory was 1.3GB in the beginning and 167.8MB in the end (delta: -1.1GB). Free memory was 1.1GB in the beginning and 120.8MB in the end (delta: 947.5MB). Peak memory consumption was 2.1kB. Max. memory is 16.1GB. [2025-03-17 04:38:13,906 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.79ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.03ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.03ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.10ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53475.18ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 1.1GB in the end (delta: -990.9MB). Peak memory consumption was 732.5MB. Max. memory is 16.1GB. * Witness Printer took 156.67ms. Allocated memory was 1.3GB in the beginning and 167.8MB in the end (delta: -1.1GB). Free memory was 1.1GB in the beginning and 120.8MB in the end (delta: 947.5MB). Peak memory consumption was 2.1kB. 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: 19]: 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 2 procedures, 43 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.5s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3431 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3428 mSDsluCounter, 6503 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5252 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5295 IncrementalHoareTripleChecker+Invalid, 6104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 1251 mSDtfsCounter, 5295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1459 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=14, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 2163 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 17825 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1984 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 6984/7658 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: 86]: Location Invariant Derived location invariant: ((((((((((((7 < var_1_6) || (last_1_var_1_5 != 0)) && (var_1_4 != 0)) && (last_1_var_1_11 != last_1_var_1_5)) && (var_1_1 == var_1_5)) && (var_1_5 == var_1_11)) && ((var_1_6 < (last_1_var_1_5 + 8)) || (((65528 + var_1_6) % 65536) != 0))) && (last_1_var_1_5 == var_1_5)) && (last_1_var_1_5 <= 32767)) || (((((0 != var_1_5) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1)))) && (var_1_1 == var_1_11)) && (((var_1_6 == (var_1_5 + 8)) && ((last_1_var_1_5 + 8) <= var_1_6)) || ((var_1_6 <= (7 + last_1_var_1_5)) && (last_1_var_1_5 == var_1_5)))) && (var_1_4 <= 0))) || (((((var_1_1 != 0) && ((7 < var_1_6) || (last_1_var_1_5 != 0))) && (0 != var_1_5)) && ((var_1_6 < (last_1_var_1_5 + 8)) || (((65528 + var_1_6) % 65536) != 0))) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1))))) || (((((((((((long long) 65520 + last_1_var_1_11) % 65536) <= 32767) && (var_1_1 <= (((long long) 65520 + last_1_var_1_11) % 65536))) && (var_1_4 != 0)) && (last_1_var_1_5 != 0)) && (var_1_1 == var_1_11)) && (0 <= (var_1_1 + 32768))) && (((var_1_1 >= 0) ? (var_1_1 % 65536) : ((var_1_1 % 65536) + 65536)) == var_1_5)) && ((((long long) 65520 + last_1_var_1_11) % 65536) == var_1_5))) RESULT: Ultimate proved your program to be correct! [2025-03-17 04:38:13,959 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