./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-8fc3dc6-m [2025-03-17 03:22:49,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:22:49,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:22:49,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:22:49,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:22:49,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:22:49,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:22:49,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:22:49,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:22:49,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:22:49,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:22:49,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:22:49,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:22:49,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:22:49,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:22:49,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:22:49,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:22:49,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:22:49,315 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-17 03:22:49,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:22:49,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:22:49,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:22:49,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:22:49,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:22:49,561 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-17 03:22:50,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52cd47fc/0510eefd0a2f4a9dba25cad0c3f3fabb/FLAG93c94ec9c [2025-03-17 03:22:50,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:22:50,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-03-17 03:22:50,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52cd47fc/0510eefd0a2f4a9dba25cad0c3f3fabb/FLAG93c94ec9c [2025-03-17 03:22:51,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52cd47fc/0510eefd0a2f4a9dba25cad0c3f3fabb [2025-03-17 03:22:51,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:22:51,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:22:51,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:22:51,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:22:51,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:22:51,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1958424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51, skipping insertion in model container [2025-03-17 03:22:51,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:22:51,141 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-17 03:22:51,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:22:51,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:22:51,206 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-17 03:22:51,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:22:51,244 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:22:51,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51 WrapperNode [2025-03-17 03:22:51,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:22:51,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:22:51,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:22:51,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:22:51,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,286 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278 [2025-03-17 03:22:51,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:22:51,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:22:51,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:22:51,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:22:51,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,320 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:22:51,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:22:51,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:22:51,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:22:51,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:22:51,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (1/1) ... [2025-03-17 03:22:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:22:51,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:22:51,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:22:51,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:22:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:22:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:22:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:22:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:22:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:22:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:22:51,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:22:51,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:22:51,877 INFO L1322 $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-17 03:22:51,923 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-17 03:22:51,923 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:22:51,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:22:51,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:22:51,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:22:51 BoogieIcfgContainer [2025-03-17 03:22:51,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:22:51,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:22:51,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:22:51,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:22:51,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:22:51" (1/3) ... [2025-03-17 03:22:51,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c66d0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:22:51, skipping insertion in model container [2025-03-17 03:22:51,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:22:51" (2/3) ... [2025-03-17 03:22:51,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c66d0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:22:51, skipping insertion in model container [2025-03-17 03:22:51,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:22:51" (3/3) ... [2025-03-17 03:22:51,953 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-88.i [2025-03-17 03:22:51,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:22:51,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-88.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:22:52,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:22:52,021 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;@4f2337f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:22:52,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:22:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 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-17 03:22:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 03:22:52,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:52,036 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] [2025-03-17 03:22:52,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:52,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 716620287, now seen corresponding path program 1 times [2025-03-17 03:22:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090915641] [2025-03-17 03:22:52,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:52,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:22:52,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:22:52,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:52,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:52,310 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-17 03:22:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090915641] [2025-03-17 03:22:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090915641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:22:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136034615] [2025-03-17 03:22:52,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:22:52,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:22:52,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:22:52,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:22:52,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:22:52,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:22:52,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:52,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:52,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:22:52,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:22:52,532 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-17 03:22:52,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:22:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136034615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:22:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:22:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814297452] [2025-03-17 03:22:52,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:52,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:22:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:52,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:22:52,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:22:52,554 INFO L87 Difference]: Start difference. First operand has 112 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 03:22:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:52,584 INFO L93 Difference]: Finished difference Result 221 states and 372 transitions. [2025-03-17 03:22:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:22:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 188 [2025-03-17 03:22:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:52,590 INFO L225 Difference]: With dead ends: 221 [2025-03-17 03:22:52,591 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 03:22:52,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:22:52,596 INFO L435 NwaCegarLoop]: 163 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, 163 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-17 03:22:52,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:22:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 03:22:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 03:22:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 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-17 03:22:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2025-03-17 03:22:52,629 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 188 [2025-03-17 03:22:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:52,629 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2025-03-17 03:22:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 03:22:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2025-03-17 03:22:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 03:22:52,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:52,632 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] [2025-03-17 03:22:52,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:22:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:22:52,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -579882309, now seen corresponding path program 1 times [2025-03-17 03:22:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288988402] [2025-03-17 03:22:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:52,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:22:52,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:22:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:53,349 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-17 03:22:53,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:53,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288988402] [2025-03-17 03:22:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288988402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:53,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:53,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:22:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012986564] [2025-03-17 03:22:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:53,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:22:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:22:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:22:53,354 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 03:22:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:53,565 INFO L93 Difference]: Finished difference Result 368 states and 562 transitions. [2025-03-17 03:22:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:22:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 188 [2025-03-17 03:22:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:53,569 INFO L225 Difference]: With dead ends: 368 [2025-03-17 03:22:53,569 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 03:22:53,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:22:53,571 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 247 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 461 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-17 03:22:53,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 461 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:22:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 03:22:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2025-03-17 03:22:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 154 states have internal predecessors, (213), 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-17 03:22:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 325 transitions. [2025-03-17 03:22:53,605 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 325 transitions. Word has length 188 [2025-03-17 03:22:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 325 transitions. [2025-03-17 03:22:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 03:22:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 325 transitions. [2025-03-17 03:22:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:22:53,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:53,612 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] [2025-03-17 03:22:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:22:53,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 517645891, now seen corresponding path program 1 times [2025-03-17 03:22:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845673544] [2025-03-17 03:22:53,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:53,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:22:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:22:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:54,019 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-17 03:22:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845673544] [2025-03-17 03:22:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845673544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:22:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831222288] [2025-03-17 03:22:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:22:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:54,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:22:54,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:22:54,025 INFO L87 Difference]: Start difference. First operand 213 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-17 03:22:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:54,377 INFO L93 Difference]: Finished difference Result 573 states and 871 transitions. [2025-03-17 03:22:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:22:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 189 [2025-03-17 03:22:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:54,380 INFO L225 Difference]: With dead ends: 573 [2025-03-17 03:22:54,380 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 03:22:54,381 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-17 03:22:54,385 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 104 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 516 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-17 03:22:54,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 516 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:22:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 03:22:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 277. [2025-03-17 03:22:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 189 states have internal predecessors, (255), 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-17 03:22:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 423 transitions. [2025-03-17 03:22:54,422 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 423 transitions. Word has length 189 [2025-03-17 03:22:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:54,423 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 423 transitions. [2025-03-17 03:22:54,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-17 03:22:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 423 transitions. [2025-03-17 03:22:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:22:54,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:54,424 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] [2025-03-17 03:22:54,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:22:54,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:54,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 728996804, now seen corresponding path program 1 times [2025-03-17 03:22:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434442572] [2025-03-17 03:22:54,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:22:54,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:22:54,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:54,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:55,133 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-17 03:22:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434442572] [2025-03-17 03:22:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434442572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:22:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436844109] [2025-03-17 03:22:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:55,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:22:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:55,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:22:55,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:22:55,135 INFO L87 Difference]: Start difference. First operand 277 states and 423 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 03:22:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:56,013 INFO L93 Difference]: Finished difference Result 941 states and 1435 transitions. [2025-03-17 03:22:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:22:56,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 189 [2025-03-17 03:22:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:56,020 INFO L225 Difference]: With dead ends: 941 [2025-03-17 03:22:56,020 INFO L226 Difference]: Without dead ends: 729 [2025-03-17 03:22:56,021 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-17 03:22:56,022 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 477 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:22:56,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 720 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:22:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-17 03:22:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 400. [2025-03-17 03:22:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 283 states have (on average 1.3745583038869258) internal successors, (389), 283 states have internal predecessors, (389), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 03:22:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 613 transitions. [2025-03-17 03:22:56,093 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 613 transitions. Word has length 189 [2025-03-17 03:22:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:56,093 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 613 transitions. [2025-03-17 03:22:56,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 03:22:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 613 transitions. [2025-03-17 03:22:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:22:56,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:56,095 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] [2025-03-17 03:22:56,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:22:56,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2058418683, now seen corresponding path program 1 times [2025-03-17 03:22:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:56,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363478706] [2025-03-17 03:22:56,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:56,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:22:56,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:22:56,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:56,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:56,349 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-17 03:22:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363478706] [2025-03-17 03:22:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363478706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:22:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484080054] [2025-03-17 03:22:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:56,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:22:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:56,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:22:56,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:22:56,350 INFO L87 Difference]: Start difference. First operand 400 states and 613 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 03:22:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:57,128 INFO L93 Difference]: Finished difference Result 1284 states and 1966 transitions. [2025-03-17 03:22:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:22:57,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 189 [2025-03-17 03:22:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:57,133 INFO L225 Difference]: With dead ends: 1284 [2025-03-17 03:22:57,133 INFO L226 Difference]: Without dead ends: 949 [2025-03-17 03:22:57,134 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-17 03:22:57,135 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 597 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:22:57,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 700 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:22:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-17 03:22:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 525. [2025-03-17 03:22:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 379 states have (on average 1.3931398416886545) internal successors, (528), 379 states have internal predecessors, (528), 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-17 03:22:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 808 transitions. [2025-03-17 03:22:57,225 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 808 transitions. Word has length 189 [2025-03-17 03:22:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:57,226 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 808 transitions. [2025-03-17 03:22:57,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 03:22:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 808 transitions. [2025-03-17 03:22:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 03:22:57,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:57,228 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] [2025-03-17 03:22:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:22:57,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:57,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1796590761, now seen corresponding path program 1 times [2025-03-17 03:22:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991222410] [2025-03-17 03:22:57,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:57,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 03:22:57,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 03:22:57,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:57,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:57,528 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-17 03:22:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991222410] [2025-03-17 03:22:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991222410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:22:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237362869] [2025-03-17 03:22:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:57,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:22:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:57,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:22:57,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:22:57,530 INFO L87 Difference]: Start difference. First operand 525 states and 808 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-17 03:22:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:58,068 INFO L93 Difference]: Finished difference Result 1667 states and 2566 transitions. [2025-03-17 03:22:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:22:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 190 [2025-03-17 03:22:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:58,075 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 03:22:58,075 INFO L226 Difference]: Without dead ends: 1207 [2025-03-17 03:22:58,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:22:58,077 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 289 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:22:58,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 616 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:22:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-03-17 03:22:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1203. [2025-03-17 03:22:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 883 states have (on average 1.391845979614949) internal successors, (1229), 883 states have internal predecessors, (1229), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:22:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1845 transitions. [2025-03-17 03:22:58,226 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1845 transitions. Word has length 190 [2025-03-17 03:22:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1845 transitions. [2025-03-17 03:22:58,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-17 03:22:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1845 transitions. [2025-03-17 03:22:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 03:22:58,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:58,228 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] [2025-03-17 03:22:58,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:22:58,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:58,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1729584008, now seen corresponding path program 1 times [2025-03-17 03:22:58,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403408459] [2025-03-17 03:22:58,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:58,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 03:22:58,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 03:22:58,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:58,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:58,383 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-17 03:22:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403408459] [2025-03-17 03:22:58,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403408459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:58,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:58,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:22:58,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982892146] [2025-03-17 03:22:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:58,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:22:58,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:58,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:22:58,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:22:58,385 INFO L87 Difference]: Start difference. First operand 1203 states and 1845 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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-17 03:22:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:58,825 INFO L93 Difference]: Finished difference Result 2103 states and 3231 transitions. [2025-03-17 03:22:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:22:58,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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 190 [2025-03-17 03:22:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:58,836 INFO L225 Difference]: With dead ends: 2103 [2025-03-17 03:22:58,836 INFO L226 Difference]: Without dead ends: 1643 [2025-03-17 03:22:58,837 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-17 03:22:58,838 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 163 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:22:58,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 399 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:22:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-17 03:22:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 965. [2025-03-17 03:22:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 703 states have (on average 1.3826458036984353) internal successors, (972), 703 states have internal predecessors, (972), 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-17 03:22:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1476 transitions. [2025-03-17 03:22:58,978 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1476 transitions. Word has length 190 [2025-03-17 03:22:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:58,979 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1476 transitions. [2025-03-17 03:22:58,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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-17 03:22:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1476 transitions. [2025-03-17 03:22:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 03:22:58,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:58,980 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-17 03:22:58,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:22:58,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 964628320, now seen corresponding path program 1 times [2025-03-17 03:22:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897625354] [2025-03-17 03:22:58,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:58,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 03:22:59,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 03:22:59,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:59,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:59,080 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-17 03:22:59,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897625354] [2025-03-17 03:22:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897625354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:22:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799055682] [2025-03-17 03:22:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:59,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:22:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:59,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:22:59,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:22:59,082 INFO L87 Difference]: Start difference. First operand 965 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-17 03:22:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:22:59,233 INFO L93 Difference]: Finished difference Result 1943 states and 2975 transitions. [2025-03-17 03:22:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:22:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-17 03:22:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:22:59,240 INFO L225 Difference]: With dead ends: 1943 [2025-03-17 03:22:59,241 INFO L226 Difference]: Without dead ends: 1045 [2025-03-17 03:22:59,243 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-17 03:22:59,244 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:22:59,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:22:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-17 03:22:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 965. [2025-03-17 03:22:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 703 states have (on average 1.3769559032716927) internal successors, (968), 703 states have internal predecessors, (968), 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-17 03:22:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1472 transitions. [2025-03-17 03:22:59,370 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1472 transitions. Word has length 191 [2025-03-17 03:22:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:22:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1472 transitions. [2025-03-17 03:22:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-17 03:22:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1472 transitions. [2025-03-17 03:22:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:22:59,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:22:59,375 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-17 03:22:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:22:59,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:22:59,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:22:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1744019622, now seen corresponding path program 1 times [2025-03-17 03:22:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:22:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983685969] [2025-03-17 03:22:59,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:22:59,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:22:59,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:22:59,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:22:59,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:22:59,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:22:59,948 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-17 03:22:59,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:22:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983685969] [2025-03-17 03:22:59,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983685969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:22:59,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:22:59,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:22:59,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598141079] [2025-03-17 03:22:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:22:59,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:22:59,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:22:59,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:22:59,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:22:59,949 INFO L87 Difference]: Start difference. First operand 965 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-17 03:23:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:01,193 INFO L93 Difference]: Finished difference Result 2179 states and 3316 transitions. [2025-03-17 03:23:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:23:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-17 03:23:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:01,202 INFO L225 Difference]: With dead ends: 2179 [2025-03-17 03:23:01,202 INFO L226 Difference]: Without dead ends: 1281 [2025-03-17 03:23:01,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:23:01,206 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 389 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:01,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 902 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:23:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-03-17 03:23:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1188. [2025-03-17 03:23:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 868 states have (on average 1.3755760368663594) internal successors, (1194), 868 states have internal predecessors, (1194), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:23:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1810 transitions. [2025-03-17 03:23:01,327 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1810 transitions. Word has length 192 [2025-03-17 03:23:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1810 transitions. [2025-03-17 03:23:01,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-17 03:23:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1810 transitions. [2025-03-17 03:23:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:23:01,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:01,331 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-17 03:23:01,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:23:01,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1964500883, now seen corresponding path program 1 times [2025-03-17 03:23:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783776622] [2025-03-17 03:23:01,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:01,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:23:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:23:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:01,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:01,840 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-17 03:23:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783776622] [2025-03-17 03:23:01,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783776622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:23:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216977058] [2025-03-17 03:23:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:23:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:23:01,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:23:01,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:23:01,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:23:01,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:23:01,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:01,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:01,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:23:01,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:23:02,037 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-17 03:23:02,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:23:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216977058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:23:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-17 03:23:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655524407] [2025-03-17 03:23:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:23:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:02,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:23:02,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:23:02,039 INFO L87 Difference]: Start difference. First operand 1188 states and 1810 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-17 03:23:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:02,556 INFO L93 Difference]: Finished difference Result 2800 states and 4273 transitions. [2025-03-17 03:23:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:23:02,557 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-17 03:23:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:02,566 INFO L225 Difference]: With dead ends: 2800 [2025-03-17 03:23:02,566 INFO L226 Difference]: Without dead ends: 1898 [2025-03-17 03:23:02,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 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-17 03:23:02,569 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 214 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:02,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1120 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:23:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-17 03:23:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1630. [2025-03-17 03:23:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1194 states have (on average 1.3601340033500837) internal successors, (1624), 1194 states have internal predecessors, (1624), 420 states have call successors, (420), 15 states have call predecessors, (420), 15 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:23:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2464 transitions. [2025-03-17 03:23:02,738 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2464 transitions. Word has length 192 [2025-03-17 03:23:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:02,739 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2464 transitions. [2025-03-17 03:23:02,739 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-17 03:23:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2464 transitions. [2025-03-17 03:23:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:23:02,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:02,741 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-17 03:23:02,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:23:02,941 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,SelfDestructingSolverStorable9 [2025-03-17 03:23:02,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:02,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1775039429, now seen corresponding path program 1 times [2025-03-17 03:23:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99094013] [2025-03-17 03:23:02,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:02,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:23:02,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:23:02,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:02,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:03,539 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-17 03:23:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99094013] [2025-03-17 03:23:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99094013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:23:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:23:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458059106] [2025-03-17 03:23:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:23:03,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:03,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:23:03,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:23:03,541 INFO L87 Difference]: Start difference. First operand 1630 states and 2464 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-17 03:23:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:04,847 INFO L93 Difference]: Finished difference Result 3157 states and 4764 transitions. [2025-03-17 03:23:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:23:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-17 03:23:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:04,858 INFO L225 Difference]: With dead ends: 3157 [2025-03-17 03:23:04,858 INFO L226 Difference]: Without dead ends: 1817 [2025-03-17 03:23:04,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:23:04,862 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 396 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:04,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 827 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:23:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-17 03:23:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1408. [2025-03-17 03:23:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1030 states have (on average 1.358252427184466) internal successors, (1399), 1030 states have internal predecessors, (1399), 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-17 03:23:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2127 transitions. [2025-03-17 03:23:05,007 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2127 transitions. Word has length 192 [2025-03-17 03:23:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:05,008 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2127 transitions. [2025-03-17 03:23:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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-17 03:23:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2127 transitions. [2025-03-17 03:23:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:23:05,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:05,010 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-17 03:23:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:23:05,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash -26357696, now seen corresponding path program 1 times [2025-03-17 03:23:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553333076] [2025-03-17 03:23:05,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:05,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:05,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:05,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:05,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:05,154 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-17 03:23:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553333076] [2025-03-17 03:23:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553333076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:23:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:23:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377806434] [2025-03-17 03:23:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:23:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:23:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:23:05,156 INFO L87 Difference]: Start difference. First operand 1408 states and 2127 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-17 03:23:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:05,601 INFO L93 Difference]: Finished difference Result 4281 states and 6485 transitions. [2025-03-17 03:23:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:23:05,601 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-17 03:23:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:05,615 INFO L225 Difference]: With dead ends: 4281 [2025-03-17 03:23:05,615 INFO L226 Difference]: Without dead ends: 2940 [2025-03-17 03:23:05,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:23:05,620 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 214 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:05,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 543 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:23:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-03-17 03:23:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2408. [2025-03-17 03:23:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1798 states have (on average 1.367074527252503) internal successors, (2458), 1798 states have internal predecessors, (2458), 588 states have call successors, (588), 21 states have call predecessors, (588), 21 states have return successors, (588), 588 states have call predecessors, (588), 588 states have call successors, (588) [2025-03-17 03:23:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3634 transitions. [2025-03-17 03:23:05,858 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3634 transitions. Word has length 193 [2025-03-17 03:23:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:05,859 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3634 transitions. [2025-03-17 03:23:05,859 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-17 03:23:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3634 transitions. [2025-03-17 03:23:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:23:05,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:05,861 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-17 03:23:05,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:23:05,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:05,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1190706103, now seen corresponding path program 1 times [2025-03-17 03:23:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:05,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881256542] [2025-03-17 03:23:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:05,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:05,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:05,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:05,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:06,361 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-17 03:23:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881256542] [2025-03-17 03:23:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881256542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:23:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182125674] [2025-03-17 03:23:06,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:23:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:23:06,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:23:06,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:23:06,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:06,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:23:06,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:23:06,608 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-17 03:23:06,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:23:06,881 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-17 03:23:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182125674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:23:06,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:23:06,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-17 03:23:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207706021] [2025-03-17 03:23:06,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:23:06,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:23:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:06,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:23:06,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:23:06,883 INFO L87 Difference]: Start difference. First operand 2408 states and 3634 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-17 03:23:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:07,424 INFO L93 Difference]: Finished difference Result 3784 states and 5595 transitions. [2025-03-17 03:23:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:23:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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 193 [2025-03-17 03:23:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:07,433 INFO L225 Difference]: With dead ends: 3784 [2025-03-17 03:23:07,433 INFO L226 Difference]: Without dead ends: 1443 [2025-03-17 03:23:07,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 381 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-17 03:23:07,439 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 303 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:07,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 399 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:23:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-17 03:23:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1357. [2025-03-17 03:23:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1015 states have (on average 1.3300492610837438) internal successors, (1350), 1015 states have internal predecessors, (1350), 308 states have call successors, (308), 33 states have call predecessors, (308), 33 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:23:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1966 transitions. [2025-03-17 03:23:07,639 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1966 transitions. Word has length 193 [2025-03-17 03:23:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1966 transitions. [2025-03-17 03:23:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-17 03:23:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1966 transitions. [2025-03-17 03:23:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:23:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:07,642 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-17 03:23:07,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:23:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:23:07,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash -987971713, now seen corresponding path program 1 times [2025-03-17 03:23:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352179212] [2025-03-17 03:23:07,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:07,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:07,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:07,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:07,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:08,026 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-17 03:23:08,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:08,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352179212] [2025-03-17 03:23:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352179212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:08,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:23:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:23:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661056671] [2025-03-17 03:23:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:23:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:08,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:23:08,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:23:08,029 INFO L87 Difference]: Start difference. First operand 1357 states and 1966 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-17 03:23:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:08,896 INFO L93 Difference]: Finished difference Result 4013 states and 5814 transitions. [2025-03-17 03:23:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:23:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-17 03:23:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:08,908 INFO L225 Difference]: With dead ends: 4013 [2025-03-17 03:23:08,908 INFO L226 Difference]: Without dead ends: 2731 [2025-03-17 03:23:08,911 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-17 03:23:08,911 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 278 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 706 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-17 03:23:08,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 706 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:23:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-03-17 03:23:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 1954. [2025-03-17 03:23:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1488 states have (on average 1.3333333333333333) internal successors, (1984), 1488 states have internal predecessors, (1984), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:23:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2824 transitions. [2025-03-17 03:23:09,266 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2824 transitions. Word has length 193 [2025-03-17 03:23:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:09,266 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2824 transitions. [2025-03-17 03:23:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-17 03:23:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2824 transitions. [2025-03-17 03:23:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:23:09,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:09,268 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-17 03:23:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:23:09,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:09,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1078530242, now seen corresponding path program 1 times [2025-03-17 03:23:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760654213] [2025-03-17 03:23:09,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:09,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:09,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:09,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:10,044 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-17 03:23:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:10,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760654213] [2025-03-17 03:23:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760654213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:23:10,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785072450] [2025-03-17 03:23:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:23:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:23:10,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:23:10,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:23:10,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:23:10,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:23:10,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:10,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 03:23:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:23:10,891 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-17 03:23:10,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:23:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785072450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:23:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2025-03-17 03:23:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010296683] [2025-03-17 03:23:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:23:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:10,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:23:10,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:23:10,892 INFO L87 Difference]: Start difference. First operand 1954 states and 2824 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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-17 03:23:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:11,648 INFO L93 Difference]: Finished difference Result 4334 states and 6222 transitions. [2025-03-17 03:23:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:23:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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-17 03:23:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:11,660 INFO L225 Difference]: With dead ends: 4334 [2025-03-17 03:23:11,661 INFO L226 Difference]: Without dead ends: 2732 [2025-03-17 03:23:11,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:23:11,666 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 289 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:11,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 659 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:23:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-17 03:23:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2074. [2025-03-17 03:23:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1608 states have (on average 1.3383084577114428) internal successors, (2152), 1608 states have internal predecessors, (2152), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:23:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2992 transitions. [2025-03-17 03:23:11,971 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2992 transitions. Word has length 193 [2025-03-17 03:23:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:11,972 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 2992 transitions. [2025-03-17 03:23:11,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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-17 03:23:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2992 transitions. [2025-03-17 03:23:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 03:23:11,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:11,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, 1, 1] [2025-03-17 03:23:11,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 03:23:12,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 03:23:12,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1517187388, now seen corresponding path program 1 times [2025-03-17 03:23:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947840029] [2025-03-17 03:23:12,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:12,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 03:23:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 03:23:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:12,376 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-17 03:23:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947840029] [2025-03-17 03:23:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947840029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:23:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:23:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645519922] [2025-03-17 03:23:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:23:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:12,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:23:12,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:23:12,378 INFO L87 Difference]: Start difference. First operand 2074 states and 2992 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-17 03:23:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:12,898 INFO L93 Difference]: Finished difference Result 3783 states and 5457 transitions. [2025-03-17 03:23:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:23:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-17 03:23:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:12,907 INFO L225 Difference]: With dead ends: 3783 [2025-03-17 03:23:12,907 INFO L226 Difference]: Without dead ends: 1920 [2025-03-17 03:23:12,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:23:12,911 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:12,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 450 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:23:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-03-17 03:23:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1918. [2025-03-17 03:23:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1483 states have (on average 1.337154416722859) internal successors, (1983), 1483 states have internal predecessors, (1983), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-17 03:23:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2767 transitions. [2025-03-17 03:23:13,199 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2767 transitions. Word has length 194 [2025-03-17 03:23:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2767 transitions. [2025-03-17 03:23:13,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-17 03:23:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2767 transitions. [2025-03-17 03:23:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 03:23:13,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:13,202 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-17 03:23:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:23:13,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1771923933, now seen corresponding path program 1 times [2025-03-17 03:23:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991283664] [2025-03-17 03:23:13,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:13,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 03:23:13,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 03:23:13,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:13,659 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-17 03:23:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:23:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991283664] [2025-03-17 03:23:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991283664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:23:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:23:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:23:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716629742] [2025-03-17 03:23:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:23:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:23:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:23:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:23:13,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:23:13,661 INFO L87 Difference]: Start difference. First operand 1918 states and 2767 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 03:23:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:23:14,383 INFO L93 Difference]: Finished difference Result 3953 states and 5684 transitions. [2025-03-17 03:23:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:23:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 03:23:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:23:14,398 INFO L225 Difference]: With dead ends: 3953 [2025-03-17 03:23:14,398 INFO L226 Difference]: Without dead ends: 2256 [2025-03-17 03:23:14,402 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-17 03:23:14,405 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 278 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:23:14,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 580 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:23:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-17 03:23:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1925. [2025-03-17 03:23:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1490 states have (on average 1.3335570469798659) internal successors, (1987), 1490 states have internal predecessors, (1987), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-17 03:23:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2771 transitions. [2025-03-17 03:23:14,650 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2771 transitions. Word has length 194 [2025-03-17 03:23:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:23:14,650 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2771 transitions. [2025-03-17 03:23:14,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-17 03:23:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2771 transitions. [2025-03-17 03:23:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 03:23:14,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:23:14,652 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-17 03:23:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:23:14,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:23:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:23:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1814313783, now seen corresponding path program 1 times [2025-03-17 03:23:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:23:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837183870] [2025-03-17 03:23:14,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:23:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 03:23:14,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 03:23:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:23:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058768921] [2025-03-17 03:23:14,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:23:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:23:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:23:14,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:23:14,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 03:23:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 03:23:15,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 03:23:15,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:23:15,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:23:15,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 03:23:15,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:23:26,007 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:24:06,728 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:24:18,754 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)