./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.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-88.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 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:04:14,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:04:14,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:04:14,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:04:14,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:04:14,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:04:14,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:04:14,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:04:14,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:04:14,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:04:14,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:04:14,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:04:14,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:04:14,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:04:14,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:04:14,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:04:14,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:04:14,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:04:14,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:14,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:04:14,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:04:14,557 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 -> 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 [2025-03-03 23:04:14,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:04:14,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:04:14,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:04:14,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:04:14,790 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:04:14,791 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-88.i [2025-03-03 23:04:15,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049938529/879e4d12ebb84e15a08b62a14f9dfd27/FLAG249777b6a [2025-03-03 23:04:16,212 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:04:16,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-03-03 23:04:16,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049938529/879e4d12ebb84e15a08b62a14f9dfd27/FLAG249777b6a [2025-03-03 23:04:16,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049938529/879e4d12ebb84e15a08b62a14f9dfd27 [2025-03-03 23:04:16,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:04:16,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:04:16,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:16,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:04:16,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:04:16,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16, skipping insertion in model container [2025-03-03 23:04:16,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:04:16,370 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-88.i[916,929] [2025-03-03 23:04:16,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:16,464 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:04:16,474 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-88.i[916,929] [2025-03-03 23:04:16,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:16,536 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:04:16,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16 WrapperNode [2025-03-03 23:04:16,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:16,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:16,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:04:16,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:04:16,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,600 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278 [2025-03-03 23:04:16,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:16,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:04:16,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:04:16,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:04:16,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,638 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 23:04:16,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:04:16,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:04:16,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:04:16,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:04:16,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (1/1) ... [2025-03-03 23:04:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:16,695 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 23:04:16,700 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 23:04:16,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:04:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:04:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:04:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:04:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:04:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:04:16,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:04:16,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:04:17,176 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-03 23:04:17,213 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-03 23:04:17,214 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:04:17,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:04:17,233 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:04:17,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:17 BoogieIcfgContainer [2025-03-03 23:04:17,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:04:17,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:04:17,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:04:17,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:04:17,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:16" (1/3) ... [2025-03-03 23:04:17,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29141024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:17, skipping insertion in model container [2025-03-03 23:04:17,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:16" (2/3) ... [2025-03-03 23:04:17,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29141024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:17, skipping insertion in model container [2025-03-03 23:04:17,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:17" (3/3) ... [2025-03-03 23:04:17,241 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-88.i [2025-03-03 23:04:17,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:04:17,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:04:17,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:04:17,303 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;@21401c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:04:17,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:04:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:04:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:04:17,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:17,323 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:17,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:17,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash -310363031, now seen corresponding path program 1 times [2025-03-03 23:04:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:17,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-03-03 23:04:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:17,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:04:17,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:04:17,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:17,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 23:04:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69750571] [2025-03-03 23:04:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69750571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593243431] [2025-03-03 23:04:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:17,648 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 23:04:17,650 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 23:04:17,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:04:17,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:04:17,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:17,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:17,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:04:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 23:04:17,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:04:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593243431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:04:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:04:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221978012] [2025-03-03 23:04:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:17,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:04:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:17,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:04:17,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:04:17,873 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:04:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:17,910 INFO L93 Difference]: Finished difference Result 226 states and 377 transitions. [2025-03-03 23:04:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:04:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2025-03-03 23:04:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:17,916 INFO L225 Difference]: With dead ends: 226 [2025-03-03 23:04:17,917 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 23:04:17,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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 23:04:17,922 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:17,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:04:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 23:04:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 23:04:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:04:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-03-03 23:04:17,964 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191 [2025-03-03 23:04:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:17,965 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-03-03 23:04:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:04:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-03-03 23:04:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 23:04:17,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:17,969 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:17,976 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 23:04:18,170 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 23:04:18,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:18,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1606865627, now seen corresponding path program 1 times [2025-03-03 23:04:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411834995] [2025-03-03 23:04:18,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:18,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 23:04:18,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 23:04:18,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:18,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:18,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411834995] [2025-03-03 23:04:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411834995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:04:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776009858] [2025-03-03 23:04:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:18,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:04:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:18,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:04:18,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:04:18,707 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:18,925 INFO L93 Difference]: Finished difference Result 373 states and 567 transitions. [2025-03-03 23:04:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:04:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-03-03 23:04:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:18,929 INFO L225 Difference]: With dead ends: 373 [2025-03-03 23:04:18,929 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 23:04:18,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:04:18,930 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 250 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:18,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 466 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:04:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 23:04:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2025-03-03 23:04:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 23:04:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-03-03 23:04:18,967 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 191 [2025-03-03 23:04:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-03-03 23:04:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-03-03 23:04:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 23:04:18,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:18,974 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:04:18,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -316429924, now seen corresponding path program 1 times [2025-03-03 23:04:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657538436] [2025-03-03 23:04:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:18,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:04:19,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:04:19,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:19,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657538436] [2025-03-03 23:04:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657538436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:04:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810595049] [2025-03-03 23:04:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:04:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:19,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:04:19,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:04:19,880 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:20,791 INFO L93 Difference]: Finished difference Result 888 states and 1348 transitions. [2025-03-03 23:04:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:04:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-03 23:04:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:20,800 INFO L225 Difference]: With dead ends: 888 [2025-03-03 23:04:20,801 INFO L226 Difference]: Without dead ends: 674 [2025-03-03 23:04:20,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:04:20,805 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 432 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:20,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 788 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 23:04:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-03 23:04:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 341. [2025-03-03 23:04:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 253 states have (on average 1.391304347826087) internal successors, (352), 253 states have internal predecessors, (352), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:04:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 520 transitions. [2025-03-03 23:04:20,877 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 520 transitions. Word has length 192 [2025-03-03 23:04:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:20,877 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 520 transitions. [2025-03-03 23:04:20,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 520 transitions. [2025-03-03 23:04:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 23:04:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:20,879 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:04:20,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:20,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1191121885, now seen corresponding path program 1 times [2025-03-03 23:04:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880832281] [2025-03-03 23:04:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:20,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:04:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:04:20,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:20,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880832281] [2025-03-03 23:04:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880832281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:21,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:04:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550872112] [2025-03-03 23:04:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:04:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:21,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:04:21,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:04:21,212 INFO L87 Difference]: Start difference. First operand 341 states and 520 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:21,979 INFO L93 Difference]: Finished difference Result 1345 states and 2052 transitions. [2025-03-03 23:04:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:04:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-03 23:04:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:21,987 INFO L225 Difference]: With dead ends: 1345 [2025-03-03 23:04:21,987 INFO L226 Difference]: Without dead ends: 1007 [2025-03-03 23:04:21,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:04:21,989 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 500 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:21,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 760 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:04:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-03 23:04:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 581. [2025-03-03 23:04:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 435 states have (on average 1.4) internal successors, (609), 435 states have internal predecessors, (609), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 23:04:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 889 transitions. [2025-03-03 23:04:22,091 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 889 transitions. Word has length 192 [2025-03-03 23:04:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:22,092 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 889 transitions. [2025-03-03 23:04:22,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 889 transitions. [2025-03-03 23:04:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 23:04:22,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:22,094 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:04:22,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 979770972, now seen corresponding path program 1 times [2025-03-03 23:04:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127440898] [2025-03-03 23:04:22,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:22,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 23:04:22,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 23:04:22,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:22,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127440898] [2025-03-03 23:04:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127440898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:04:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105925596] [2025-03-03 23:04:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:04:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:22,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:04:22,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:04:22,373 INFO L87 Difference]: Start difference. First operand 581 states and 889 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:22,794 INFO L93 Difference]: Finished difference Result 1202 states and 1838 transitions. [2025-03-03 23:04:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:04:22,794 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-03 23:04:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:22,799 INFO L225 Difference]: With dead ends: 1202 [2025-03-03 23:04:22,799 INFO L226 Difference]: Without dead ends: 624 [2025-03-03 23:04:22,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:04:22,803 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 106 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:22,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 524 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:04:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-03 23:04:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 532. [2025-03-03 23:04:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 386 states have (on average 1.3860103626943006) internal successors, (535), 386 states have internal predecessors, (535), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 23:04:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2025-03-03 23:04:22,882 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 192 [2025-03-03 23:04:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:22,883 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2025-03-03 23:04:22,883 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2025-03-03 23:04:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 23:04:22,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:22,884 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:22,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:04:22,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:22,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash 154919042, now seen corresponding path program 1 times [2025-03-03 23:04:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548067088] [2025-03-03 23:04:22,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:22,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 23:04:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 23:04:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548067088] [2025-03-03 23:04:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548067088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:23,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:04:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261844183] [2025-03-03 23:04:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:04:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:23,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:04:23,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:04:23,069 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:23,407 INFO L93 Difference]: Finished difference Result 1442 states and 2211 transitions. [2025-03-03 23:04:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:04:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-03-03 23:04:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:23,413 INFO L225 Difference]: With dead ends: 1442 [2025-03-03 23:04:23,413 INFO L226 Difference]: Without dead ends: 978 [2025-03-03 23:04:23,415 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 23:04:23,416 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 166 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:23,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 445 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:04:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-03 23:04:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2025-03-03 23:04:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.376750700280112) internal successors, (983), 714 states have internal predecessors, (983), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 23:04:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1487 transitions. [2025-03-03 23:04:23,578 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1487 transitions. Word has length 193 [2025-03-03 23:04:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:23,579 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1487 transitions. [2025-03-03 23:04:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1487 transitions. [2025-03-03 23:04:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 23:04:23,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:23,581 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:04:23,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -745319271, now seen corresponding path program 1 times [2025-03-03 23:04:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374455559] [2025-03-03 23:04:23,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 23:04:23,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 23:04:23,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:23,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374455559] [2025-03-03 23:04:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374455559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:04:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422245822] [2025-03-03 23:04:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:04:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:23,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:04:23,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:04:23,675 INFO L87 Difference]: Start difference. First operand 976 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:23,816 INFO L93 Difference]: Finished difference Result 1962 states and 2994 transitions. [2025-03-03 23:04:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:04:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-03-03 23:04:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:23,822 INFO L225 Difference]: With dead ends: 1962 [2025-03-03 23:04:23,823 INFO L226 Difference]: Without dead ends: 1056 [2025-03-03 23:04:23,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:04:23,826 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:23,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:04:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-03 23:04:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 976. [2025-03-03 23:04:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.3711484593837535) internal successors, (979), 714 states have internal predecessors, (979), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 23:04:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1483 transitions. [2025-03-03 23:04:23,962 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1483 transitions. Word has length 194 [2025-03-03 23:04:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:23,962 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1483 transitions. [2025-03-03 23:04:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1483 transitions. [2025-03-03 23:04:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 23:04:23,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:23,965 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:23,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:04:23,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:23,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 495733117, now seen corresponding path program 1 times [2025-03-03 23:04:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97726850] [2025-03-03 23:04:23,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:23,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:04:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:04:24,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:24,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-03 23:04:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97726850] [2025-03-03 23:04:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97726850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78814055] [2025-03-03 23:04:24,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:24,552 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 23:04:24,556 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 23:04:24,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:04:24,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:04:24,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:24,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:24,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:04:24,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:24,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:04:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78814055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:04:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-03 23:04:24,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245561167] [2025-03-03 23:04:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:04:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:24,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:04:24,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:04:24,742 INFO L87 Difference]: Start difference. First operand 976 states and 1483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:25,198 INFO L93 Difference]: Finished difference Result 2604 states and 3962 transitions. [2025-03-03 23:04:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:04:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-03-03 23:04:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:25,208 INFO L225 Difference]: With dead ends: 2604 [2025-03-03 23:04:25,209 INFO L226 Difference]: Without dead ends: 1694 [2025-03-03 23:04:25,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:04:25,212 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 272 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:25,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 940 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:04:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-03-03 23:04:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1422. [2025-03-03 23:04:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1044 states have (on average 1.353448275862069) internal successors, (1413), 1044 states have internal predecessors, (1413), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-03 23:04:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2141 transitions. [2025-03-03 23:04:25,414 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2141 transitions. Word has length 195 [2025-03-03 23:04:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:25,414 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2141 transitions. [2025-03-03 23:04:25,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2141 transitions. [2025-03-03 23:04:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 23:04:25,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:25,418 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:25,425 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 23:04:25,619 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,SelfDestructingSolverStorable7 [2025-03-03 23:04:25,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1051160101, now seen corresponding path program 1 times [2025-03-03 23:04:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:25,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666439968] [2025-03-03 23:04:25,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:25,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 23:04:25,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 23:04:25,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:25,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666439968] [2025-03-03 23:04:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666439968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:26,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:04:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608513135] [2025-03-03 23:04:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:04:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:26,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:04:26,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:04:26,148 INFO L87 Difference]: Start difference. First operand 1422 states and 2141 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:27,747 INFO L93 Difference]: Finished difference Result 2875 states and 4323 transitions. [2025-03-03 23:04:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:04:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-03-03 23:04:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:27,758 INFO L225 Difference]: With dead ends: 2875 [2025-03-03 23:04:27,758 INFO L226 Difference]: Without dead ends: 1523 [2025-03-03 23:04:27,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:04:27,765 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 443 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:27,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 903 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 23:04:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-03 23:04:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1423. [2025-03-03 23:04:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1045 states have (on average 1.35311004784689) internal successors, (1414), 1045 states have internal predecessors, (1414), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-03 23:04:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2142 transitions. [2025-03-03 23:04:27,919 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2142 transitions. Word has length 195 [2025-03-03 23:04:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:27,920 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2142 transitions. [2025-03-03 23:04:27,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2142 transitions. [2025-03-03 23:04:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 23:04:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:27,923 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:27,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:04:27,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1788711873, now seen corresponding path program 1 times [2025-03-03 23:04:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069641714] [2025-03-03 23:04:27,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:27,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 23:04:28,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 23:04:28,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:28,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-03 23:04:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069641714] [2025-03-03 23:04:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069641714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683686439] [2025-03-03 23:04:28,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:28,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:28,397 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 23:04:28,400 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 23:04:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 23:04:28,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 23:04:28,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:28,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:04:28,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-03-03 23:04:28,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:04:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-03 23:04:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683686439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:04:28,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:04:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 23:04:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596221300] [2025-03-03 23:04:28,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:04:28,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:04:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:04:28,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:04:28,962 INFO L87 Difference]: Start difference. First operand 1423 states and 2142 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:04:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:29,463 INFO L93 Difference]: Finished difference Result 2227 states and 3281 transitions. [2025-03-03 23:04:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:04:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-03 23:04:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:29,469 INFO L225 Difference]: With dead ends: 2227 [2025-03-03 23:04:29,469 INFO L226 Difference]: Without dead ends: 874 [2025-03-03 23:04:29,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-03-03 23:04:29,473 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 409 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:29,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 497 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:04:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-03 23:04:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2025-03-03 23:04:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 602 states have (on average 1.313953488372093) internal successors, (791), 602 states have internal predecessors, (791), 196 states have call successors, (196), 21 states have call predecessors, (196), 21 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 23:04:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1183 transitions. [2025-03-03 23:04:29,600 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1183 transitions. Word has length 196 [2025-03-03 23:04:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1183 transitions. [2025-03-03 23:04:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:04:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1183 transitions. [2025-03-03 23:04:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 23:04:29,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:29,603 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:29,611 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 23:04:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:29,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash 952555931, now seen corresponding path program 1 times [2025-03-03 23:04:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052558836] [2025-03-03 23:04:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:29,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 23:04:29,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 23:04:29,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:29,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052558836] [2025-03-03 23:04:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052558836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:04:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347501176] [2025-03-03 23:04:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:04:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:04:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:04:30,009 INFO L87 Difference]: Start difference. First operand 820 states and 1183 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:30,722 INFO L93 Difference]: Finished difference Result 2333 states and 3370 transitions. [2025-03-03 23:04:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:04:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-03-03 23:04:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:30,731 INFO L225 Difference]: With dead ends: 2333 [2025-03-03 23:04:30,731 INFO L226 Difference]: Without dead ends: 1591 [2025-03-03 23:04:30,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 23:04:30,735 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 280 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:30,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 724 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:04:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-03 23:04:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1131. [2025-03-03 23:04:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 851 states have (on average 1.3184488836662749) internal successors, (1122), 851 states have internal predecessors, (1122), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 23:04:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1626 transitions. [2025-03-03 23:04:30,905 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1626 transitions. Word has length 196 [2025-03-03 23:04:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1626 transitions. [2025-03-03 23:04:30,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1626 transitions. [2025-03-03 23:04:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 23:04:30,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:30,908 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:30,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:04:30,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1954499850, now seen corresponding path program 1 times [2025-03-03 23:04:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781998132] [2025-03-03 23:04:30,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 23:04:30,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 23:04:30,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:30,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:04:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781998132] [2025-03-03 23:04:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781998132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348195839] [2025-03-03 23:04:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:31,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:31,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:31,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:04:31,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 23:04:31,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 23:04:31,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:31,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 23:04:31,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:33,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:04:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348195839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:04:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-03 23:04:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413367183] [2025-03-03 23:04:33,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:33,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:04:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:33,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:04:33,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:04:33,051 INFO L87 Difference]: Start difference. First operand 1131 states and 1626 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:33,599 INFO L93 Difference]: Finished difference Result 2377 states and 3406 transitions. [2025-03-03 23:04:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:04:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-03-03 23:04:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:33,606 INFO L225 Difference]: With dead ends: 2377 [2025-03-03 23:04:33,606 INFO L226 Difference]: Without dead ends: 1324 [2025-03-03 23:04:33,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:04:33,609 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 127 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:33,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 677 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:04:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-03-03 23:04:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1182. [2025-03-03 23:04:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 902 states have (on average 1.3203991130820398) internal successors, (1191), 902 states have internal predecessors, (1191), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 23:04:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1695 transitions. [2025-03-03 23:04:33,758 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1695 transitions. Word has length 196 [2025-03-03 23:04:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:33,759 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1695 transitions. [2025-03-03 23:04:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1695 transitions. [2025-03-03 23:04:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 23:04:33,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:33,761 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:33,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:04:33,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:33,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:33,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash 918529735, now seen corresponding path program 1 times [2025-03-03 23:04:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:33,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047812191] [2025-03-03 23:04:33,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:33,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 23:04:33,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 23:04:33,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:04:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047812191] [2025-03-03 23:04:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047812191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:34,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:34,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:04:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933515641] [2025-03-03 23:04:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:04:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:34,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:04:34,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:04:34,381 INFO L87 Difference]: Start difference. First operand 1182 states and 1695 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:35,023 INFO L93 Difference]: Finished difference Result 2460 states and 3521 transitions. [2025-03-03 23:04:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:04:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-03-03 23:04:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:35,031 INFO L225 Difference]: With dead ends: 2460 [2025-03-03 23:04:35,031 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 23:04:35,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:04:35,036 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 323 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:35,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 568 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:04:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 23:04:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1180. [2025-03-03 23:04:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 900 states have (on average 1.3155555555555556) internal successors, (1184), 900 states have internal predecessors, (1184), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 23:04:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1688 transitions. [2025-03-03 23:04:35,198 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1688 transitions. Word has length 197 [2025-03-03 23:04:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1688 transitions. [2025-03-03 23:04:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:04:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1688 transitions. [2025-03-03 23:04:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 23:04:35,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:35,201 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:04:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:04:35,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1649393997, now seen corresponding path program 1 times [2025-03-03 23:04:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162154596] [2025-03-03 23:04:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:35,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 23:04:35,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 23:04:35,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:35,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:04:35,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970297082] [2025-03-03 23:04:35,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:35,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:35,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:35,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:04:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 23:04:35,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 23:04:35,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:35,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 23:04:35,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 947 proven. 180 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-03 23:04:37,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:05:25,246 WARN L286 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)