./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.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 544492f8740cf75ba131482d8a9d3b25cda3fc17f885878b4449b23aaac08107 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:09:35,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:09:35,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:09:35,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:09:35,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:09:35,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:09:35,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:09:35,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:09:35,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:09:35,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:09:35,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:09:35,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:09:35,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:09:35,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:09:35,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:09:35,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:09:35,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:09:35,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:09:35,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:09:35,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:09:35,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:09:35,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:09:35,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:09:35,304 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 -> 544492f8740cf75ba131482d8a9d3b25cda3fc17f885878b4449b23aaac08107 [2025-03-03 21:09:35,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:09:35,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:09:35,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:09:35,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:09:35,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:09:35,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.i [2025-03-03 21:09:36,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d5a9bb1/a19327e722034adb9ccf521c06b051ea/FLAG5253b5baf [2025-03-03 21:09:36,921 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:09:36,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.i [2025-03-03 21:09:36,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d5a9bb1/a19327e722034adb9ccf521c06b051ea/FLAG5253b5baf [2025-03-03 21:09:36,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d5a9bb1/a19327e722034adb9ccf521c06b051ea [2025-03-03 21:09:36,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:09:36,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:09:36,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:09:36,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:09:36,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:09:36,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:09:36" (1/1) ... [2025-03-03 21:09:36,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdb7764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:36, skipping insertion in model container [2025-03-03 21:09:36,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:09:36" (1/1) ... [2025-03-03 21:09:36,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:09:37,082 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_fillercode_fillercodestructure_filler-pr-ci_file-86.i[919,932] [2025-03-03 21:09:37,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:09:37,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:09:37,166 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_fillercode_fillercodestructure_filler-pr-ci_file-86.i[919,932] [2025-03-03 21:09:37,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:09:37,197 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:09:37,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37 WrapperNode [2025-03-03 21:09:37,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:09:37,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:09:37,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:09:37,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:09:37,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,240 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-03 21:09:37,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:09:37,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:09:37,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:09:37,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:09:37,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:09:37,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:09:37,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:09:37,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:09:37,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:09:37,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (1/1) ... [2025-03-03 21:09:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:09:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:09:37,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:09:37,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:09:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:09:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:09:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:09:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:09:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:09:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:09:37,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:09:37,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:09:37,767 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 21:09:37,768 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:09:37,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:09:37,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:09:37,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:37 BoogieIcfgContainer [2025-03-03 21:09:37,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:09:37,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:09:37,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:09:37,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:09:37,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:09:36" (1/3) ... [2025-03-03 21:09:37,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450010ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:37, skipping insertion in model container [2025-03-03 21:09:37,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:37" (2/3) ... [2025-03-03 21:09:37,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450010ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:37, skipping insertion in model container [2025-03-03 21:09:37,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:37" (3/3) ... [2025-03-03 21:09:37,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.i [2025-03-03 21:09:37,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:09:37,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-86.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:09:37,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:09:37,859 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;@43c6fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:09:37,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:09:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:09:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:37,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:37,877 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:37,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:37,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 428778083, now seen corresponding path program 1 times [2025-03-03 21:09:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474603746] [2025-03-03 21:09:37,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:37,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:37,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:37,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:09:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474603746] [2025-03-03 21:09:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474603746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:09:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611667792] [2025-03-03 21:09:38,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:38,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:09:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:09:38,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:09:38,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:09:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:38,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:38,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:09:38,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:09:38,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611667792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:09:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:09:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701751356] [2025-03-03 21:09:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:38,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:09:38,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:38,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:09:38,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:09:38,318 INFO L87 Difference]: Start difference. First operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:09:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:38,347 INFO L93 Difference]: Finished difference Result 186 states and 326 transitions. [2025-03-03 21:09:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:09:38,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-03-03 21:09:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:38,353 INFO L225 Difference]: With dead ends: 186 [2025-03-03 21:09:38,353 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 21:09:38,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-03 21:09:38,360 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:38,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 21:09:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 21:09:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:09:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2025-03-03 21:09:38,389 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 174 [2025-03-03 21:09:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:38,390 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2025-03-03 21:09:38,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:09:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2025-03-03 21:09:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:38,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:38,392 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:38,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:09:38,594 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-03 21:09:38,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 746078114, now seen corresponding path program 1 times [2025-03-03 21:09:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204177309] [2025-03-03 21:09:38,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:38,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:38,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204177309] [2025-03-03 21:09:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204177309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:09:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657155230] [2025-03-03 21:09:38,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:38,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:38,910 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:38,946 INFO L93 Difference]: Finished difference Result 184 states and 291 transitions. [2025-03-03 21:09:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:09:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:38,948 INFO L225 Difference]: With dead ends: 184 [2025-03-03 21:09:38,948 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 21:09:38,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:38,949 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:38,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 21:09:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 21:09:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:09:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-03-03 21:09:38,956 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 174 [2025-03-03 21:09:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-03-03 21:09:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-03-03 21:09:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:38,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:38,959 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:38,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:09:38,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:38,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2041337373, now seen corresponding path program 1 times [2025-03-03 21:09:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248895592] [2025-03-03 21:09:38,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:38,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:39,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:39,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248895592] [2025-03-03 21:09:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248895592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:39,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:09:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481278027] [2025-03-03 21:09:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:09:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:39,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:09:39,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:09:39,228 INFO L87 Difference]: Start difference. First operand 94 states and 147 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:39,428 INFO L93 Difference]: Finished difference Result 277 states and 436 transitions. [2025-03-03 21:09:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:09:39,428 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:09:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:39,430 INFO L225 Difference]: With dead ends: 277 [2025-03-03 21:09:39,430 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 21:09:39,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:09:39,432 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 151 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:39,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 484 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:09:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 21:09:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2025-03-03 21:09:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:09:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2025-03-03 21:09:39,448 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 174 [2025-03-03 21:09:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2025-03-03 21:09:39,449 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2025-03-03 21:09:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:39,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:39,450 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:09:39,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1829986460, now seen corresponding path program 1 times [2025-03-03 21:09:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459078824] [2025-03-03 21:09:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:39,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:39,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:39,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:39,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459078824] [2025-03-03 21:09:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459078824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:39,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:39,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:09:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176894419] [2025-03-03 21:09:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:39,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:39,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:39,686 INFO L87 Difference]: Start difference. First operand 141 states and 220 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:39,757 INFO L93 Difference]: Finished difference Result 323 states and 508 transitions. [2025-03-03 21:09:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:09:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:39,760 INFO L225 Difference]: With dead ends: 323 [2025-03-03 21:09:39,762 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 21:09:39,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:39,764 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 94 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:39,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 21:09:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-03 21:09:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 145 states have internal predecessors, (197), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 359 transitions. [2025-03-03 21:09:39,801 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 359 transitions. Word has length 174 [2025-03-03 21:09:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 359 transitions. [2025-03-03 21:09:39,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 359 transitions. [2025-03-03 21:09:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:39,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:39,803 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:09:39,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:39,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2056156611, now seen corresponding path program 1 times [2025-03-03 21:09:39,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:39,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651778427] [2025-03-03 21:09:39,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:39,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:39,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:39,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:39,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651778427] [2025-03-03 21:09:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651778427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:09:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450711971] [2025-03-03 21:09:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:45,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:09:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:45,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:09:45,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:09:45,005 INFO L87 Difference]: Start difference. First operand 230 states and 359 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:47,154 INFO L93 Difference]: Finished difference Result 450 states and 696 transitions. [2025-03-03 21:09:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:09:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:09:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:47,157 INFO L225 Difference]: With dead ends: 450 [2025-03-03 21:09:47,157 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 21:09:47,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:09:47,158 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 543 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:47,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1005 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:09:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 21:09:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 272. [2025-03-03 21:09:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 187 states have (on average 1.3957219251336899) internal successors, (261), 187 states have internal predecessors, (261), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 423 transitions. [2025-03-03 21:09:47,195 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 423 transitions. Word has length 174 [2025-03-03 21:09:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:47,196 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 423 transitions. [2025-03-03 21:09:47,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 423 transitions. [2025-03-03 21:09:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:09:47,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:47,197 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:47,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:09:47,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1550597986, now seen corresponding path program 1 times [2025-03-03 21:09:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491709073] [2025-03-03 21:09:47,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:47,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:09:47,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:09:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:47,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:47,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491709073] [2025-03-03 21:09:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491709073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:47,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:47,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:09:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961966284] [2025-03-03 21:09:47,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:47,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:47,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:47,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:47,260 INFO L87 Difference]: Start difference. First operand 272 states and 423 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:47,320 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2025-03-03 21:09:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 21:09:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:47,322 INFO L225 Difference]: With dead ends: 453 [2025-03-03 21:09:47,324 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 21:09:47,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:47,325 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 137 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:47,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 314 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 21:09:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 271. [2025-03-03 21:09:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 421 transitions. [2025-03-03 21:09:47,348 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 421 transitions. Word has length 174 [2025-03-03 21:09:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:47,348 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 421 transitions. [2025-03-03 21:09:47,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 421 transitions. [2025-03-03 21:09:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:09:47,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:47,349 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:47,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:09:47,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2039870471, now seen corresponding path program 1 times [2025-03-03 21:09:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271552906] [2025-03-03 21:09:47,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:47,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:09:47,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:09:47,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:47,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271552906] [2025-03-03 21:09:50,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271552906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:09:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313141442] [2025-03-03 21:09:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:50,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:09:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:50,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:09:50,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:09:50,118 INFO L87 Difference]: Start difference. First operand 271 states and 421 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:50,845 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2025-03-03 21:09:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:09:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 21:09:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:50,848 INFO L225 Difference]: With dead ends: 358 [2025-03-03 21:09:50,848 INFO L226 Difference]: Without dead ends: 356 [2025-03-03 21:09:50,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:09:50,849 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 564 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:50,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1043 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:09:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-03 21:09:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 272. [2025-03-03 21:09:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 187 states have internal predecessors, (260), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 422 transitions. [2025-03-03 21:09:50,869 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 422 transitions. Word has length 175 [2025-03-03 21:09:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:50,870 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 422 transitions. [2025-03-03 21:09:50,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 422 transitions. [2025-03-03 21:09:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:09:50,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:50,871 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:09:50,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash 962002282, now seen corresponding path program 1 times [2025-03-03 21:09:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001962638] [2025-03-03 21:09:50,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:09:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:09:50,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001962638] [2025-03-03 21:09:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001962638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:09:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140827483] [2025-03-03 21:09:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:51,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:09:51,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:51,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:09:51,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:09:51,014 INFO L87 Difference]: Start difference. First operand 272 states and 422 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:51,067 INFO L93 Difference]: Finished difference Result 474 states and 732 transitions. [2025-03-03 21:09:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:09:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 21:09:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:51,071 INFO L225 Difference]: With dead ends: 474 [2025-03-03 21:09:51,071 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 21:09:51,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:09:51,072 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 66 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:51,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 290 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 21:09:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 280. [2025-03-03 21:09:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 193 states have internal predecessors, (263), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 425 transitions. [2025-03-03 21:09:51,090 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 425 transitions. Word has length 175 [2025-03-03 21:09:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:51,091 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 425 transitions. [2025-03-03 21:09:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 425 transitions. [2025-03-03 21:09:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:09:51,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:51,094 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:09:51,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1590154679, now seen corresponding path program 1 times [2025-03-03 21:09:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465484289] [2025-03-03 21:09:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:51,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:09:51,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:09:51,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:51,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:09:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465484289] [2025-03-03 21:09:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465484289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:09:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484177330] [2025-03-03 21:09:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:53,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:09:53,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:53,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:09:53,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:09:53,558 INFO L87 Difference]: Start difference. First operand 280 states and 425 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:54,601 INFO L93 Difference]: Finished difference Result 373 states and 553 transitions. [2025-03-03 21:09:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:09:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 21:09:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:54,604 INFO L225 Difference]: With dead ends: 373 [2025-03-03 21:09:54,604 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 21:09:54,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=875, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 21:09:54,605 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 491 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:54,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1065 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:09:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 21:09:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 280. [2025-03-03 21:09:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 193 states have internal predecessors, (263), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:09:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 425 transitions. [2025-03-03 21:09:54,627 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 425 transitions. Word has length 175 [2025-03-03 21:09:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 425 transitions. [2025-03-03 21:09:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:09:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 425 transitions. [2025-03-03 21:09:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:09:54,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:54,629 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:09:54,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -943318314, now seen corresponding path program 1 times [2025-03-03 21:09:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834909371] [2025-03-03 21:09:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:54,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:09:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:09:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:10:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:04,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834909371] [2025-03-03 21:10:04,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834909371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:04,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:04,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:10:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639407450] [2025-03-03 21:10:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:04,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:10:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:04,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:10:04,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:10:04,366 INFO L87 Difference]: Start difference. First operand 280 states and 425 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:14,626 INFO L93 Difference]: Finished difference Result 398 states and 588 transitions. [2025-03-03 21:10:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:10:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 21:10:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:14,629 INFO L225 Difference]: With dead ends: 398 [2025-03-03 21:10:14,629 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 21:10:14,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=335, Invalid=997, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 21:10:14,630 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 593 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:14,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1020 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 21:10:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 21:10:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 299. [2025-03-03 21:10:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 212 states have (on average 1.3773584905660377) internal successors, (292), 212 states have internal predecessors, (292), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:10:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 454 transitions. [2025-03-03 21:10:14,651 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 454 transitions. Word has length 175 [2025-03-03 21:10:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:14,651 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 454 transitions. [2025-03-03 21:10:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 454 transitions. [2025-03-03 21:10:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:10:14,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:14,655 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:14,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:10:14,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:14,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -814235595, now seen corresponding path program 1 times [2025-03-03 21:10:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634858858] [2025-03-03 21:10:14,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:14,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:10:14,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:10:14,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:14,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:10:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634858858] [2025-03-03 21:10:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634858858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:10:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815926082] [2025-03-03 21:10:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:21,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:10:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:10:21,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:10:21,259 INFO L87 Difference]: Start difference. First operand 299 states and 454 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:29,567 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2025-03-03 21:10:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:10:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 21:10:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:29,570 INFO L225 Difference]: With dead ends: 392 [2025-03-03 21:10:29,570 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 21:10:29,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 21:10:29,571 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 472 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:29,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1054 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 21:10:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 21:10:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 299. [2025-03-03 21:10:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 212 states have (on average 1.3773584905660377) internal successors, (292), 212 states have internal predecessors, (292), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:10:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 454 transitions. [2025-03-03 21:10:29,590 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 454 transitions. Word has length 175 [2025-03-03 21:10:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:29,591 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 454 transitions. [2025-03-03 21:10:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 454 transitions. [2025-03-03 21:10:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:10:29,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:29,593 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:29,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:10:29,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 673370177, now seen corresponding path program 1 times [2025-03-03 21:10:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046781666] [2025-03-03 21:10:29,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:10:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:10:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:10:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046781666] [2025-03-03 21:10:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046781666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:10:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386258317] [2025-03-03 21:10:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:34,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:10:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:34,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:10:34,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:10:34,956 INFO L87 Difference]: Start difference. First operand 299 states and 454 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:39,016 INFO L93 Difference]: Finished difference Result 378 states and 561 transitions. [2025-03-03 21:10:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 21:10:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 21:10:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:39,018 INFO L225 Difference]: With dead ends: 378 [2025-03-03 21:10:39,019 INFO L226 Difference]: Without dead ends: 376 [2025-03-03 21:10:39,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 21:10:39,020 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 459 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:39,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1170 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 21:10:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-03 21:10:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 296. [2025-03-03 21:10:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 209 states have internal predecessors, (288), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:10:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 450 transitions. [2025-03-03 21:10:39,036 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 450 transitions. Word has length 176 [2025-03-03 21:10:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 450 transitions. [2025-03-03 21:10:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 450 transitions. [2025-03-03 21:10:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:10:39,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:39,038 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:10:39,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -720909837, now seen corresponding path program 1 times [2025-03-03 21:10:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364589375] [2025-03-03 21:10:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:39,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:10:39,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:10:39,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:39,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:10:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364589375] [2025-03-03 21:10:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364589375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:10:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879502887] [2025-03-03 21:10:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:43,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:10:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:43,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:10:43,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:10:43,973 INFO L87 Difference]: Start difference. First operand 296 states and 450 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:46,248 INFO L93 Difference]: Finished difference Result 393 states and 583 transitions. [2025-03-03 21:10:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:10:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 21:10:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:46,251 INFO L225 Difference]: With dead ends: 393 [2025-03-03 21:10:46,251 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 21:10:46,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:10:46,252 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 553 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:46,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 917 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 21:10:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 21:10:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 308. [2025-03-03 21:10:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 221 states have (on average 1.3891402714932126) internal successors, (307), 221 states have internal predecessors, (307), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:10:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 469 transitions. [2025-03-03 21:10:46,272 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 469 transitions. Word has length 176 [2025-03-03 21:10:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:46,272 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 469 transitions. [2025-03-03 21:10:46,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:10:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 469 transitions. [2025-03-03 21:10:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:10:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:46,274 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:10:46,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash -84596842, now seen corresponding path program 1 times [2025-03-03 21:10:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52236258] [2025-03-03 21:10:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:10:46,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:10:46,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:46,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:10:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52236258] [2025-03-03 21:10:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52236258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:50,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:10:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912919500] [2025-03-03 21:10:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:50,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:10:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:10:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:10:50,489 INFO L87 Difference]: Start difference. First operand 308 states and 469 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:10:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:53,584 INFO L93 Difference]: Finished difference Result 400 states and 592 transitions. [2025-03-03 21:10:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 21:10:53,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2025-03-03 21:10:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:53,587 INFO L225 Difference]: With dead ends: 400 [2025-03-03 21:10:53,587 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 21:10:53,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=446, Invalid=1194, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 21:10:53,588 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 830 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:53,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1044 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 21:10:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 21:10:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 309. [2025-03-03 21:10:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 222 states have (on average 1.3873873873873874) internal successors, (308), 222 states have internal predecessors, (308), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:10:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 470 transitions. [2025-03-03 21:10:53,604 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 470 transitions. Word has length 176 [2025-03-03 21:10:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:53,604 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 470 transitions. [2025-03-03 21:10:53,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:10:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 470 transitions. [2025-03-03 21:10:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:10:53,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:53,605 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:10:53,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:53,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1014312844, now seen corresponding path program 1 times [2025-03-03 21:10:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910069930] [2025-03-03 21:10:53,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:53,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:10:53,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:10:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat