./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.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_loopvsstraightlinecode_100-while_file-20.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 e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:55:18,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:55:18,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:55:18,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:55:18,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:55:18,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:55:18,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:55:18,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:55:18,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:55:18,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:55:18,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:55:18,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:55:18,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:55:18,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:55:18,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:55:18,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:55:18,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:55:18,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:55:18,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:55:18,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:55:18,177 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 -> e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 [2025-03-03 22:55:18,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:55:18,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:55:18,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:55:18,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:55:18,418 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:55:18,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-03 22:55:19,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996f666a/299b42cee73f43e4afef4fb8801812a2/FLAGcf14e92af [2025-03-03 22:55:19,875 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:55:19,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-03 22:55:19,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996f666a/299b42cee73f43e4afef4fb8801812a2/FLAGcf14e92af [2025-03-03 22:55:19,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996f666a/299b42cee73f43e4afef4fb8801812a2 [2025-03-03 22:55:19,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:55:19,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:55:19,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:55:19,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:55:19,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:55:19,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:19" (1/1) ... [2025-03-03 22:55:19,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:19, skipping insertion in model container [2025-03-03 22:55:19,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:19" (1/1) ... [2025-03-03 22:55:19,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:55:20,047 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_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-03-03 22:55:20,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:55:20,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:55:20,147 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_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-03-03 22:55:20,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:55:20,198 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:55:20,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20 WrapperNode [2025-03-03 22:55:20,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:55:20,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:55:20,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:55:20,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:55:20,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 10:55:20" (1/1) ... [2025-03-03 22:55:20,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,266 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-03-03 22:55:20,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:55:20,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:55:20,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:55:20,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:55:20,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,305 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 22:55:20,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:55:20,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:55:20,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:55:20,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:55:20,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 22:55:20,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:55:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:55:20,347 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 22:55:20,352 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 22:55:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:55:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:55:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:55:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:55:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:55:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:55:20,440 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:55:20,441 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:55:20,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-03 22:55:20,912 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 22:55:20,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:55:20,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:55:20,930 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 22:55:20,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:20 BoogieIcfgContainer [2025-03-03 22:55:20,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:55:20,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:55:20,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:55:20,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:55:20,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:19" (1/3) ... [2025-03-03 22:55:20,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaed3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:20, skipping insertion in model container [2025-03-03 22:55:20,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (2/3) ... [2025-03-03 22:55:20,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaed3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:20, skipping insertion in model container [2025-03-03 22:55:20,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:20" (3/3) ... [2025-03-03 22:55:20,938 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-03 22:55:20,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:55:20,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:55:21,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:55:21,023 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;@7fa22a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:55:21,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:55:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 22:55:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 22:55:21,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:21,040 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:21,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1272848649, now seen corresponding path program 1 times [2025-03-03 22:55:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657938617] [2025-03-03 22:55:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:21,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:55:21,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:55:21,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 22:55:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657938617] [2025-03-03 22:55:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657938617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:55:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715060201] [2025-03-03 22:55:21,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:21,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:55:21,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:55:21,373 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 22:55:21,374 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 22:55:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:55:21,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:55:21,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:21,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:21,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:55:21,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 22:55:21,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:55:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715060201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:55:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:55:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114686050] [2025-03-03 22:55:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:55:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:21,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:55:21,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:55:21,571 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 22:55:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:21,599 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2025-03-03 22:55:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:55:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-03-03 22:55:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:21,609 INFO L225 Difference]: With dead ends: 224 [2025-03-03 22:55:21,610 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 22:55:21,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 22:55:21,614 INFO L435 NwaCegarLoop]: 169 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, 169 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 22:55:21,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:55:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 22:55:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 22:55:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 22:55:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-03 22:55:21,651 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-03-03 22:55:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-03 22:55:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 22:55:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-03 22:55:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 22:55:21,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:21,657 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:21,665 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 22:55:21,859 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 22:55:21,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1694400884, now seen corresponding path program 1 times [2025-03-03 22:55:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631504402] [2025-03-03 22:55:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:55:21,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:55:21,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631504402] [2025-03-03 22:55:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631504402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:55:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347614793] [2025-03-03 22:55:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:55:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:22,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:55:22,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:55:22,369 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:22,648 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-03-03 22:55:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:55:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-03 22:55:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:22,651 INFO L225 Difference]: With dead ends: 364 [2025-03-03 22:55:22,651 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 22:55:22,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:55:22,655 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 168 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:22,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 514 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:55:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 22:55:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-03-03 22:55:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 22:55:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-03-03 22:55:22,694 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-03-03 22:55:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:22,694 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-03-03 22:55:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-03-03 22:55:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 22:55:22,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:22,697 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:55:22,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:22,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1361276800, now seen corresponding path program 1 times [2025-03-03 22:55:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10736593] [2025-03-03 22:55:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:55:22,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:55:22,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10736593] [2025-03-03 22:55:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10736593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:24,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:55:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150093278] [2025-03-03 22:55:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:24,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:55:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:24,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:55:24,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:55:24,183 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:25,202 INFO L93 Difference]: Finished difference Result 1020 states and 1525 transitions. [2025-03-03 22:55:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-03 22:55:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:25,207 INFO L225 Difference]: With dead ends: 1020 [2025-03-03 22:55:25,207 INFO L226 Difference]: Without dead ends: 779 [2025-03-03 22:55:25,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:55:25,209 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 537 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:25,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 862 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:55:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-03 22:55:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 359. [2025-03-03 22:55:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 286 states have internal predecessors, (407), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 22:55:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 547 transitions. [2025-03-03 22:55:25,256 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 547 transitions. Word has length 205 [2025-03-03 22:55:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:25,257 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 547 transitions. [2025-03-03 22:55:25,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 547 transitions. [2025-03-03 22:55:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 22:55:25,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:25,259 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:55:25,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 855718175, now seen corresponding path program 1 times [2025-03-03 22:55:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024699105] [2025-03-03 22:55:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:25,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:55:25,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:55:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:25,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024699105] [2025-03-03 22:55:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024699105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:55:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826249829] [2025-03-03 22:55:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:55:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:25,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:55:25,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:55:25,478 INFO L87 Difference]: Start difference. First operand 359 states and 547 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:25,712 INFO L93 Difference]: Finished difference Result 967 states and 1471 transitions. [2025-03-03 22:55:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:55:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-03 22:55:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:25,719 INFO L225 Difference]: With dead ends: 967 [2025-03-03 22:55:25,719 INFO L226 Difference]: Without dead ends: 618 [2025-03-03 22:55:25,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:55:25,722 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:25,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 640 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:55:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-03 22:55:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 483. [2025-03-03 22:55:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 378 states have internal predecessors, (535), 101 states have call successors, (101), 6 states have call predecessors, (101), 6 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-03 22:55:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 737 transitions. [2025-03-03 22:55:25,779 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 737 transitions. Word has length 205 [2025-03-03 22:55:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:25,780 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 737 transitions. [2025-03-03 22:55:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 737 transitions. [2025-03-03 22:55:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:25,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:25,782 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:55:25,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1217102130, now seen corresponding path program 1 times [2025-03-03 22:55:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708861039] [2025-03-03 22:55:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:25,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:25,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:25,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708861039] [2025-03-03 22:55:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708861039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:55:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198098360] [2025-03-03 22:55:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:55:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:26,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:55:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:55:26,107 INFO L87 Difference]: Start difference. First operand 483 states and 737 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:26,586 INFO L93 Difference]: Finished difference Result 1271 states and 1920 transitions. [2025-03-03 22:55:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:55:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:26,591 INFO L225 Difference]: With dead ends: 1271 [2025-03-03 22:55:26,591 INFO L226 Difference]: Without dead ends: 798 [2025-03-03 22:55:26,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:55:26,592 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 253 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:26,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 665 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:55:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-03 22:55:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 683. [2025-03-03 22:55:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 555 states have (on average 1.4198198198198198) internal successors, (788), 561 states have internal predecessors, (788), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1022 transitions. [2025-03-03 22:55:26,651 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1022 transitions. Word has length 206 [2025-03-03 22:55:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:26,651 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1022 transitions. [2025-03-03 22:55:26,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1022 transitions. [2025-03-03 22:55:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:26,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:26,655 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:55:26,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash 27662351, now seen corresponding path program 1 times [2025-03-03 22:55:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912496714] [2025-03-03 22:55:26,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:26,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912496714] [2025-03-03 22:55:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912496714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 22:55:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861491257] [2025-03-03 22:55:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:55:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:31,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:55:31,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:55:31,807 INFO L87 Difference]: Start difference. First operand 683 states and 1022 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:34,382 INFO L93 Difference]: Finished difference Result 1951 states and 2897 transitions. [2025-03-03 22:55:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:55:34,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:34,389 INFO L225 Difference]: With dead ends: 1951 [2025-03-03 22:55:34,389 INFO L226 Difference]: Without dead ends: 1278 [2025-03-03 22:55:34,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:55:34,393 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 760 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:34,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1038 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 22:55:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-03 22:55:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 859. [2025-03-03 22:55:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 731 states have (on average 1.4172366621067032) internal successors, (1036), 737 states have internal predecessors, (1036), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1270 transitions. [2025-03-03 22:55:34,454 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1270 transitions. Word has length 206 [2025-03-03 22:55:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:34,457 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1270 transitions. [2025-03-03 22:55:34,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1270 transitions. [2025-03-03 22:55:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:34,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:34,459 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:34,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:55:34,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash -477896274, now seen corresponding path program 1 times [2025-03-03 22:55:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080008619] [2025-03-03 22:55:34,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:34,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:34,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:34,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:35,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080008619] [2025-03-03 22:55:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080008619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:35,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:35,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:55:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167400120] [2025-03-03 22:55:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:55:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:35,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:55:35,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:55:35,513 INFO L87 Difference]: Start difference. First operand 859 states and 1270 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:36,257 INFO L93 Difference]: Finished difference Result 1865 states and 2764 transitions. [2025-03-03 22:55:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:36,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:36,264 INFO L225 Difference]: With dead ends: 1865 [2025-03-03 22:55:36,264 INFO L226 Difference]: Without dead ends: 1380 [2025-03-03 22:55:36,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:55:36,266 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 515 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:36,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 745 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:55:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-03 22:55:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1054. [2025-03-03 22:55:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 926 states have (on average 1.4038876889848813) internal successors, (1300), 932 states have internal predecessors, (1300), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1534 transitions. [2025-03-03 22:55:36,333 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1534 transitions. Word has length 206 [2025-03-03 22:55:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:36,333 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1534 transitions. [2025-03-03 22:55:36,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1534 transitions. [2025-03-03 22:55:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:36,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:36,335 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:36,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:55:36,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:36,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash -881738948, now seen corresponding path program 1 times [2025-03-03 22:55:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963385958] [2025-03-03 22:55:36,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:36,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:36,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:36,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:36,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963385958] [2025-03-03 22:55:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963385958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:55:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304130561] [2025-03-03 22:55:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:38,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:55:38,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:38,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:55:38,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:55:38,673 INFO L87 Difference]: Start difference. First operand 1054 states and 1534 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:40,721 INFO L93 Difference]: Finished difference Result 2452 states and 3543 transitions. [2025-03-03 22:55:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:55:40,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:40,729 INFO L225 Difference]: With dead ends: 2452 [2025-03-03 22:55:40,729 INFO L226 Difference]: Without dead ends: 1408 [2025-03-03 22:55:40,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:55:40,731 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 527 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:40,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 829 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:55:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-03 22:55:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1109. [2025-03-03 22:55:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 981 states have (on average 1.4097859327217126) internal successors, (1383), 987 states have internal predecessors, (1383), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1617 transitions. [2025-03-03 22:55:40,780 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1617 transitions. Word has length 206 [2025-03-03 22:55:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1617 transitions. [2025-03-03 22:55:40,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1617 transitions. [2025-03-03 22:55:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:40,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:40,783 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:40,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:55:40,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:40,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash 625812861, now seen corresponding path program 1 times [2025-03-03 22:55:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549710649] [2025-03-03 22:55:40,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:40,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549710649] [2025-03-03 22:55:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549710649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:55:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794387290] [2025-03-03 22:55:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:55:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:41,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:55:41,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:55:41,598 INFO L87 Difference]: Start difference. First operand 1109 states and 1617 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:42,043 INFO L93 Difference]: Finished difference Result 2832 states and 4137 transitions. [2025-03-03 22:55:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:42,049 INFO L225 Difference]: With dead ends: 2832 [2025-03-03 22:55:42,049 INFO L226 Difference]: Without dead ends: 1733 [2025-03-03 22:55:42,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:55:42,051 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 367 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:42,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 428 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:55:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-03-03 22:55:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1250. [2025-03-03 22:55:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1122 states have (on average 1.4376114081996434) internal successors, (1613), 1128 states have internal predecessors, (1613), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1847 transitions. [2025-03-03 22:55:42,095 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1847 transitions. Word has length 206 [2025-03-03 22:55:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:42,095 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1847 transitions. [2025-03-03 22:55:42,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1847 transitions. [2025-03-03 22:55:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:42,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:42,098 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:55:42,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1726210819, now seen corresponding path program 1 times [2025-03-03 22:55:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583793686] [2025-03-03 22:55:42,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:42,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:42,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:43,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583793686] [2025-03-03 22:55:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583793686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:55:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876967466] [2025-03-03 22:55:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:43,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:55:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:43,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:55:43,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:55:43,260 INFO L87 Difference]: Start difference. First operand 1250 states and 1847 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:44,214 INFO L93 Difference]: Finished difference Result 2836 states and 4172 transitions. [2025-03-03 22:55:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:44,219 INFO L225 Difference]: With dead ends: 2836 [2025-03-03 22:55:44,219 INFO L226 Difference]: Without dead ends: 1596 [2025-03-03 22:55:44,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:55:44,221 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 282 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:44,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 664 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:55:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-03 22:55:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1265. [2025-03-03 22:55:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1137 states have (on average 1.4388742304309587) internal successors, (1636), 1143 states have internal predecessors, (1636), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1870 transitions. [2025-03-03 22:55:44,288 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1870 transitions. Word has length 206 [2025-03-03 22:55:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:44,289 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1870 transitions. [2025-03-03 22:55:44,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1870 transitions. [2025-03-03 22:55:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 22:55:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:44,291 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:55:44,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -218659010, now seen corresponding path program 1 times [2025-03-03 22:55:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863756624] [2025-03-03 22:55:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:44,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 22:55:44,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 22:55:44,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:44,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863756624] [2025-03-03 22:55:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863756624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:55:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075138996] [2025-03-03 22:55:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:55:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:44,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:55:44,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:55:44,999 INFO L87 Difference]: Start difference. First operand 1265 states and 1870 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:46,279 INFO L93 Difference]: Finished difference Result 3019 states and 4451 transitions. [2025-03-03 22:55:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:46,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 22:55:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:46,287 INFO L225 Difference]: With dead ends: 3019 [2025-03-03 22:55:46,287 INFO L226 Difference]: Without dead ends: 1764 [2025-03-03 22:55:46,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:55:46,290 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 332 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:46,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 804 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 22:55:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-03-03 22:55:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1233. [2025-03-03 22:55:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1105 states have (on average 1.4343891402714932) internal successors, (1585), 1111 states have internal predecessors, (1585), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 22:55:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1819 transitions. [2025-03-03 22:55:46,336 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1819 transitions. Word has length 206 [2025-03-03 22:55:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:46,336 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1819 transitions. [2025-03-03 22:55:46,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1819 transitions. [2025-03-03 22:55:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 22:55:46,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:46,338 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:46,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:55:46,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1616175650, now seen corresponding path program 1 times [2025-03-03 22:55:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712316734] [2025-03-03 22:55:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 22:55:46,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 22:55:46,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:46,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712316734] [2025-03-03 22:55:46,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712316734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:46,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:46,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:55:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918187416] [2025-03-03 22:55:46,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:46,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:55:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:46,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:55:46,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:55:46,524 INFO L87 Difference]: Start difference. First operand 1233 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:46,757 INFO L93 Difference]: Finished difference Result 2575 states and 3784 transitions. [2025-03-03 22:55:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:55:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-03 22:55:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:46,762 INFO L225 Difference]: With dead ends: 2575 [2025-03-03 22:55:46,762 INFO L226 Difference]: Without dead ends: 1352 [2025-03-03 22:55:46,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:55:46,765 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 169 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:46,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 466 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:55:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-03 22:55:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1151. [2025-03-03 22:55:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1060 states have (on average 1.4433962264150944) internal successors, (1530), 1064 states have internal predecessors, (1530), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 22:55:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1694 transitions. [2025-03-03 22:55:46,802 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1694 transitions. Word has length 207 [2025-03-03 22:55:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1694 transitions. [2025-03-03 22:55:46,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1694 transitions. [2025-03-03 22:55:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:46,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:46,804 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:55:46,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1143825369, now seen corresponding path program 1 times [2025-03-03 22:55:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043699031] [2025-03-03 22:55:46,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043699031] [2025-03-03 22:55:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043699031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:55:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668817343] [2025-03-03 22:55:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:55:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:55:47,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:55:47,803 INFO L87 Difference]: Start difference. First operand 1151 states and 1694 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:49,134 INFO L93 Difference]: Finished difference Result 2357 states and 3481 transitions. [2025-03-03 22:55:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:55:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 22:55:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:49,139 INFO L225 Difference]: With dead ends: 2357 [2025-03-03 22:55:49,139 INFO L226 Difference]: Without dead ends: 1631 [2025-03-03 22:55:49,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:55:49,141 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 907 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:49,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1259 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:55:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-03 22:55:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1167. [2025-03-03 22:55:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1076 states have (on average 1.4433085501858736) internal successors, (1553), 1080 states have internal predecessors, (1553), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 22:55:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1717 transitions. [2025-03-03 22:55:49,195 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1717 transitions. Word has length 208 [2025-03-03 22:55:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:49,197 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1717 transitions. [2025-03-03 22:55:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1717 transitions. [2025-03-03 22:55:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:49,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:49,199 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:49,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 22:55:49,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:49,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:49,200 INFO L85 PathProgramCache]: Analyzing trace with hash 638266744, now seen corresponding path program 1 times [2025-03-03 22:55:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:49,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142710593] [2025-03-03 22:55:49,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:49,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:49,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:49,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:49,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142710593] [2025-03-03 22:55:50,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142710593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:50,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:50,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:55:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581892551] [2025-03-03 22:55:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:50,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:55:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:50,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:55:50,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:55:50,134 INFO L87 Difference]: Start difference. First operand 1167 states and 1717 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:50,717 INFO L93 Difference]: Finished difference Result 2935 states and 4330 transitions. [2025-03-03 22:55:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:55:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 22:55:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:50,722 INFO L225 Difference]: With dead ends: 2935 [2025-03-03 22:55:50,723 INFO L226 Difference]: Without dead ends: 1771 [2025-03-03 22:55:50,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:55:50,725 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 239 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:50,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 602 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:55:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-03 22:55:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1287. [2025-03-03 22:55:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1196 states have (on average 1.4473244147157192) internal successors, (1731), 1200 states have internal predecessors, (1731), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 22:55:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1895 transitions. [2025-03-03 22:55:50,766 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1895 transitions. Word has length 208 [2025-03-03 22:55:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:50,766 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1895 transitions. [2025-03-03 22:55:50,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1895 transitions. [2025-03-03 22:55:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:50,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:50,768 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:50,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:55:50,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1693606673, now seen corresponding path program 1 times [2025-03-03 22:55:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:50,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115843987] [2025-03-03 22:55:50,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:50,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:50,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115843987] [2025-03-03 22:55:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115843987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:55:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883163020] [2025-03-03 22:55:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:52,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:55:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:52,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:55:52,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:55:52,749 INFO L87 Difference]: Start difference. First operand 1287 states and 1895 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:53,365 INFO L93 Difference]: Finished difference Result 2931 states and 4255 transitions. [2025-03-03 22:55:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:55:53,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 22:55:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:53,371 INFO L225 Difference]: With dead ends: 2931 [2025-03-03 22:55:53,371 INFO L226 Difference]: Without dead ends: 1647 [2025-03-03 22:55:53,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:55:53,373 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 416 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:53,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1030 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:55:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-03 22:55:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1298. [2025-03-03 22:55:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1207 states have (on average 1.4382767191383596) internal successors, (1736), 1211 states have internal predecessors, (1736), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 22:55:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1900 transitions. [2025-03-03 22:55:53,416 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1900 transitions. Word has length 208 [2025-03-03 22:55:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:53,417 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1900 transitions. [2025-03-03 22:55:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1900 transitions. [2025-03-03 22:55:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:53,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:53,418 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:53,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 22:55:53,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:53,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1188048048, now seen corresponding path program 1 times [2025-03-03 22:55:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969773606] [2025-03-03 22:55:53,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:53,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:53,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:53,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:53,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969773606] [2025-03-03 22:55:54,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969773606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:54,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:54,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:55:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96900152] [2025-03-03 22:55:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:54,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:55:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:54,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:55:54,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:55:54,899 INFO L87 Difference]: Start difference. First operand 1298 states and 1900 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:56,328 INFO L93 Difference]: Finished difference Result 3620 states and 5211 transitions. [2025-03-03 22:55:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:55:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 22:55:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:56,338 INFO L225 Difference]: With dead ends: 3620 [2025-03-03 22:55:56,338 INFO L226 Difference]: Without dead ends: 2325 [2025-03-03 22:55:56,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:55:56,341 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 478 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:56,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1048 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:55:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2025-03-03 22:55:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1356. [2025-03-03 22:55:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1265 states have (on average 1.4426877470355732) internal successors, (1825), 1269 states have internal predecessors, (1825), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 22:55:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1989 transitions. [2025-03-03 22:55:56,390 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1989 transitions. Word has length 208 [2025-03-03 22:55:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:56,390 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1989 transitions. [2025-03-03 22:55:56,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1989 transitions. [2025-03-03 22:55:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:56,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:56,392 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 22:55:56,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:56,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 677513871, now seen corresponding path program 1 times [2025-03-03 22:55:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191190190] [2025-03-03 22:55:56,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:56,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:56,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:56,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:56,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:55:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191190190] [2025-03-03 22:55:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191190190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:55:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:55:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721322177] [2025-03-03 22:55:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:56,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:55:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:55:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:55:56,676 INFO L87 Difference]: Start difference. First operand 1356 states and 1989 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:57,822 INFO L93 Difference]: Finished difference Result 4109 states and 5984 transitions. [2025-03-03 22:55:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:55:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-03 22:55:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:57,831 INFO L225 Difference]: With dead ends: 4109 [2025-03-03 22:55:57,831 INFO L226 Difference]: Without dead ends: 2756 [2025-03-03 22:55:57,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:55:57,833 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 400 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:57,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1013 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:55:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2025-03-03 22:55:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2464. [2025-03-03 22:55:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2283 states have (on average 1.4480946123521683) internal successors, (3306), 2291 states have internal predecessors, (3306), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-03 22:55:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3634 transitions. [2025-03-03 22:55:57,951 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3634 transitions. Word has length 208 [2025-03-03 22:55:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:57,952 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 3634 transitions. [2025-03-03 22:55:57,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:55:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3634 transitions. [2025-03-03 22:55:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 22:55:57,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:57,954 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:57,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 22:55:57,955 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1946279994, now seen corresponding path program 1 times [2025-03-03 22:55:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:55:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374781006] [2025-03-03 22:55:57,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:55:57,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:58,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:58,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 22:55:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:55:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374781006] [2025-03-03 22:55:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374781006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:55:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517345383] [2025-03-03 22:55:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:55:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:55:58,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:55:58,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:55:58,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 22:55:58,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 22:55:58,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:58,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:58,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:55:58,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-03 22:55:58,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:55:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 22:55:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517345383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:55:59,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:55:59,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 7] total 21 [2025-03-03 22:55:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080690957] [2025-03-03 22:55:59,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:55:59,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 22:55:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:55:59,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 22:55:59,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-03 22:55:59,304 INFO L87 Difference]: Start difference. First operand 2464 states and 3634 transitions. Second operand has 21 states, 21 states have (on average 6.857142857142857) internal successors, (144), 20 states have internal predecessors, (144), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) [2025-03-03 22:56:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:00,953 INFO L93 Difference]: Finished difference Result 5252 states and 7550 transitions. [2025-03-03 22:56:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 22:56:00,954 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.857142857142857) internal successors, (144), 20 states have internal predecessors, (144), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) Word has length 208 [2025-03-03 22:56:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:00,964 INFO L225 Difference]: With dead ends: 5252 [2025-03-03 22:56:00,964 INFO L226 Difference]: Without dead ends: 2791 [2025-03-03 22:56:00,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=2326, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 22:56:00,968 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 508 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1624 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:56:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2025-03-03 22:56:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2123. [2025-03-03 22:56:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1867 states have (on average 1.329405463310123) internal successors, (2482), 1878 states have internal predecessors, (2482), 221 states have call successors, (221), 34 states have call predecessors, (221), 34 states have return successors, (221), 210 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-03 22:56:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2924 transitions. [2025-03-03 22:56:01,133 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2924 transitions. Word has length 208 [2025-03-03 22:56:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:01,133 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 2924 transitions. [2025-03-03 22:56:01,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.857142857142857) internal successors, (144), 20 states have internal predecessors, (144), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) [2025-03-03 22:56:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2924 transitions. [2025-03-03 22:56:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 22:56:01,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:01,134 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:01,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:56:01,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 22:56:01,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -78979673, now seen corresponding path program 1 times [2025-03-03 22:56:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262564937] [2025-03-03 22:56:01,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:01,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:01,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 22:56:01,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 22:56:01,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:01,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262564937] [2025-03-03 22:56:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262564937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:04,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:04,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 22:56:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125827550] [2025-03-03 22:56:04,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:04,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 22:56:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:04,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 22:56:04,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:56:04,557 INFO L87 Difference]: Start difference. First operand 2123 states and 2924 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:07,583 INFO L93 Difference]: Finished difference Result 3392 states and 4614 transitions. [2025-03-03 22:56:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:56:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-03 22:56:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:07,590 INFO L225 Difference]: With dead ends: 3392 [2025-03-03 22:56:07,590 INFO L226 Difference]: Without dead ends: 2377 [2025-03-03 22:56:07,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-03 22:56:07,592 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 432 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:07,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1856 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 22:56:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-03 22:56:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2123. [2025-03-03 22:56:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1867 states have (on average 1.329405463310123) internal successors, (2482), 1878 states have internal predecessors, (2482), 221 states have call successors, (221), 34 states have call predecessors, (221), 34 states have return successors, (221), 210 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-03 22:56:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2924 transitions. [2025-03-03 22:56:07,744 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2924 transitions. Word has length 209 [2025-03-03 22:56:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:07,745 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 2924 transitions. [2025-03-03 22:56:07,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2924 transitions. [2025-03-03 22:56:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 22:56:07,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:07,746 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 22:56:07,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1428572136, now seen corresponding path program 1 times [2025-03-03 22:56:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996548296] [2025-03-03 22:56:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:07,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 22:56:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 22:56:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996548296] [2025-03-03 22:56:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996548296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:56:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392676663] [2025-03-03 22:56:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:09,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:56:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:09,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:56:09,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:56:09,145 INFO L87 Difference]: Start difference. First operand 2123 states and 2924 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:10,823 INFO L93 Difference]: Finished difference Result 4868 states and 6536 transitions. [2025-03-03 22:56:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:56:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-03 22:56:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:10,833 INFO L225 Difference]: With dead ends: 4868 [2025-03-03 22:56:10,833 INFO L226 Difference]: Without dead ends: 3355 [2025-03-03 22:56:10,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:56:10,835 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 452 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:10,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1288 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:56:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2025-03-03 22:56:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2063. [2025-03-03 22:56:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1807 states have (on average 1.316546762589928) internal successors, (2379), 1818 states have internal predecessors, (2379), 221 states have call successors, (221), 34 states have call predecessors, (221), 34 states have return successors, (221), 210 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-03 22:56:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2821 transitions. [2025-03-03 22:56:10,980 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2821 transitions. Word has length 209 [2025-03-03 22:56:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:10,981 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2821 transitions. [2025-03-03 22:56:10,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2821 transitions. [2025-03-03 22:56:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 22:56:10,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:10,982 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:10,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 22:56:10,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:10,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1513085463, now seen corresponding path program 1 times [2025-03-03 22:56:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:10,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711261963] [2025-03-03 22:56:10,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:10,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 22:56:11,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 22:56:11,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:11,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711261963] [2025-03-03 22:56:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711261963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:11,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:11,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:56:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526666229] [2025-03-03 22:56:11,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:11,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:56:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:11,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:56:11,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:56:11,364 INFO L87 Difference]: Start difference. First operand 2063 states and 2821 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 22:56:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:12,083 INFO L93 Difference]: Finished difference Result 4717 states and 6413 transitions. [2025-03-03 22:56:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:56:12,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 209 [2025-03-03 22:56:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:12,089 INFO L225 Difference]: With dead ends: 4717 [2025-03-03 22:56:12,089 INFO L226 Difference]: Without dead ends: 2909 [2025-03-03 22:56:12,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:56:12,092 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 408 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:12,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1107 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:56:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-03-03 22:56:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2379. [2025-03-03 22:56:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2100 states have (on average 1.3104761904761906) internal successors, (2752), 2114 states have internal predecessors, (2752), 239 states have call successors, (239), 39 states have call predecessors, (239), 39 states have return successors, (239), 225 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 22:56:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3230 transitions. [2025-03-03 22:56:12,257 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3230 transitions. Word has length 209 [2025-03-03 22:56:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:12,257 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3230 transitions. [2025-03-03 22:56:12,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 22:56:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3230 transitions. [2025-03-03 22:56:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 22:56:12,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:12,258 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:12,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 22:56:12,258 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:12,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -122863031, now seen corresponding path program 1 times [2025-03-03 22:56:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:12,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000377993] [2025-03-03 22:56:12,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 22:56:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 22:56:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 22:56:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000377993] [2025-03-03 22:56:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000377993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892589704] [2025-03-03 22:56:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:12,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:56:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:56:12,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 22:56:12,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 22:56:12,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:12,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:56:12,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 482 proven. 150 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-03-03 22:56:12,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 22:56:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892589704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:56:13,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:56:13,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-03 22:56:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909736335] [2025-03-03 22:56:13,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:56:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:13,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:56:13,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:56:13,113 INFO L87 Difference]: Start difference. First operand 2379 states and 3230 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-03 22:56:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:14,027 INFO L93 Difference]: Finished difference Result 4618 states and 6228 transitions. [2025-03-03 22:56:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 22:56:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) Word has length 209 [2025-03-03 22:56:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:14,035 INFO L225 Difference]: With dead ends: 4618 [2025-03-03 22:56:14,035 INFO L226 Difference]: Without dead ends: 2418 [2025-03-03 22:56:14,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=429, Invalid=1053, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 22:56:14,039 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 430 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:14,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 682 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:56:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-03 22:56:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1343. [2025-03-03 22:56:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1121 states have (on average 1.312221231043711) internal successors, (1471), 1126 states have internal predecessors, (1471), 183 states have call successors, (183), 38 states have call predecessors, (183), 38 states have return successors, (183), 178 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-03 22:56:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1837 transitions. [2025-03-03 22:56:14,156 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1837 transitions. Word has length 209 [2025-03-03 22:56:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:14,156 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1837 transitions. [2025-03-03 22:56:14,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-03 22:56:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1837 transitions. [2025-03-03 22:56:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 22:56:14,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:14,157 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:14,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:56:14,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:14,358 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:14,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 993267196, now seen corresponding path program 1 times [2025-03-03 22:56:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344633517] [2025-03-03 22:56:14,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:14,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 22:56:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 22:56:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344633517] [2025-03-03 22:56:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344633517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:56:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698626724] [2025-03-03 22:56:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:15,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:56:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:56:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:56:15,852 INFO L87 Difference]: Start difference. First operand 1343 states and 1837 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:16,938 INFO L93 Difference]: Finished difference Result 3089 states and 4219 transitions. [2025-03-03 22:56:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:56:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-03 22:56:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:16,944 INFO L225 Difference]: With dead ends: 3089 [2025-03-03 22:56:16,944 INFO L226 Difference]: Without dead ends: 1990 [2025-03-03 22:56:16,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:56:16,945 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 337 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:16,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1420 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:56:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-03-03 22:56:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1441. [2025-03-03 22:56:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1219 states have (on average 1.3215750615258408) internal successors, (1611), 1224 states have internal predecessors, (1611), 183 states have call successors, (183), 38 states have call predecessors, (183), 38 states have return successors, (183), 178 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-03 22:56:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1977 transitions. [2025-03-03 22:56:17,056 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1977 transitions. Word has length 210 [2025-03-03 22:56:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 1977 transitions. [2025-03-03 22:56:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1977 transitions. [2025-03-03 22:56:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 22:56:17,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:17,057 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:17,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 22:56:17,058 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:17,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 487708571, now seen corresponding path program 1 times [2025-03-03 22:56:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492604263] [2025-03-03 22:56:17,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:17,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 22:56:17,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 22:56:17,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:18,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492604263] [2025-03-03 22:56:18,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492604263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:18,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:18,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:56:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252614910] [2025-03-03 22:56:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:18,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:56:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:18,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:56:18,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:56:18,824 INFO L87 Difference]: Start difference. First operand 1441 states and 1977 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:21,746 INFO L93 Difference]: Finished difference Result 2815 states and 3816 transitions. [2025-03-03 22:56:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:56:21,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-03 22:56:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:21,754 INFO L225 Difference]: With dead ends: 2815 [2025-03-03 22:56:21,754 INFO L226 Difference]: Without dead ends: 2162 [2025-03-03 22:56:21,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:56:21,756 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 463 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:21,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1138 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 22:56:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2025-03-03 22:56:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1447. [2025-03-03 22:56:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1225 states have (on average 1.323265306122449) internal successors, (1621), 1230 states have internal predecessors, (1621), 183 states have call successors, (183), 38 states have call predecessors, (183), 38 states have return successors, (183), 178 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-03 22:56:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1987 transitions. [2025-03-03 22:56:21,876 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1987 transitions. Word has length 210 [2025-03-03 22:56:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:21,876 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1987 transitions. [2025-03-03 22:56:21,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 22:56:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1987 transitions. [2025-03-03 22:56:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 22:56:21,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:21,878 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 22:56:21,878 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:21,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -22825606, now seen corresponding path program 1 times [2025-03-03 22:56:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561598232] [2025-03-03 22:56:21,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:21,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 22:56:21,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 22:56:21,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561598232] [2025-03-03 22:56:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561598232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:56:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047609348] [2025-03-03 22:56:22,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:56:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:56:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:56:22,119 INFO L87 Difference]: Start difference. First operand 1447 states and 1987 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 22:56:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:22,582 INFO L93 Difference]: Finished difference Result 2962 states and 4074 transitions. [2025-03-03 22:56:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:56:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 210 [2025-03-03 22:56:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:22,588 INFO L225 Difference]: With dead ends: 2962 [2025-03-03 22:56:22,588 INFO L226 Difference]: Without dead ends: 1591 [2025-03-03 22:56:22,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:56:22,590 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 244 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:22,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 856 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:56:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-03 22:56:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1391. [2025-03-03 22:56:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1169 states have (on average 1.3233532934131738) internal successors, (1547), 1174 states have internal predecessors, (1547), 183 states have call successors, (183), 38 states have call predecessors, (183), 38 states have return successors, (183), 178 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-03 22:56:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1913 transitions. [2025-03-03 22:56:22,711 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1913 transitions. Word has length 210 [2025-03-03 22:56:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:22,711 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1913 transitions. [2025-03-03 22:56:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 22:56:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1913 transitions. [2025-03-03 22:56:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 22:56:22,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:22,712 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 22:56:22,712 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 148795325, now seen corresponding path program 1 times [2025-03-03 22:56:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678005817] [2025-03-03 22:56:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:22,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 22:56:22,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 22:56:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 22:56:28,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678005817] [2025-03-03 22:56:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678005817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 22:56:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810160707] [2025-03-03 22:56:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 22:56:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:28,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 22:56:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:56:28,466 INFO L87 Difference]: Start difference. First operand 1391 states and 1913 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)