./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.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-68.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 a50f9ed11f10306280cf680a91856fa84d69e79835a7539c0719fe95b31ba9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:20:16,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:20:16,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:20:16,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:20:16,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:20:16,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:20:16,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:20:16,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:20:16,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:20:16,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:20:16,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:20:16,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:20:16,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:20:16,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:20:16,528 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:20:16,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:20:16,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:20:16,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:20:16,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:20:16,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:20:16,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:20:16,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:20:16,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:20:16,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:20:16,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:20:16,532 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 -> a50f9ed11f10306280cf680a91856fa84d69e79835a7539c0719fe95b31ba9a8 [2025-03-17 03:20:16,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:20:16,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:20:16,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:20:16,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:20:16,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:20:16,813 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-68.i [2025-03-17 03:20:18,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64782f94/ee418fcdba9c4bd8b745a02dee852fad/FLAG13a53b618 [2025-03-17 03:20:18,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:20:18,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-17 03:20:18,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64782f94/ee418fcdba9c4bd8b745a02dee852fad/FLAG13a53b618 [2025-03-17 03:20:18,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64782f94/ee418fcdba9c4bd8b745a02dee852fad [2025-03-17 03:20:18,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:20:18,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:20:18,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:20:18,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:20:18,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:20:18,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4ad49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18, skipping insertion in model container [2025-03-17 03:20:18,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:20:18,432 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-68.i[916,929] [2025-03-17 03:20:18,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:20:18,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:20:18,550 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-68.i[916,929] [2025-03-17 03:20:18,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:20:18,613 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:20:18,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18 WrapperNode [2025-03-17 03:20:18,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:20:18,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:20:18,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:20:18,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:20:18,622 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:20:18" (1/1) ... [2025-03-17 03:20:18,646 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:20:18" (1/1) ... [2025-03-17 03:20:18,690 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2025-03-17 03:20:18,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:20:18,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:20:18,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:20:18,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:20:18,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,749 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:20:18,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:20:18,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:20:18,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:20:18,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:20:18,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (1/1) ... [2025-03-17 03:20:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:20:18,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:18,819 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:20:18,825 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:20:18,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:20:18,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:20:18,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:20:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:20:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:20:18,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:20:18,926 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:20:18,927 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:20:19,433 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-17 03:20:19,499 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-17 03:20:19,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:20:19,522 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:20:19,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:20:19,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:20:19 BoogieIcfgContainer [2025-03-17 03:20:19,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:20:19,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:20:19,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:20:19,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:20:19,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:20:18" (1/3) ... [2025-03-17 03:20:19,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3ae997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:20:19, skipping insertion in model container [2025-03-17 03:20:19,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:20:18" (2/3) ... [2025-03-17 03:20:19,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3ae997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:20:19, skipping insertion in model container [2025-03-17 03:20:19,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:20:19" (3/3) ... [2025-03-17 03:20:19,531 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-17 03:20:19,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:20:19,547 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-68.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:20:19,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:20:19,626 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;@5bf079b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:20:19,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:20:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 116 states have internal predecessors, (169), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:20:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:19,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:19,651 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1975441966, now seen corresponding path program 1 times [2025-03-17 03:20:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126594243] [2025-03-17 03:20:19,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:19,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:19,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:19,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:19,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 03:20:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126594243] [2025-03-17 03:20:20,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126594243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:20:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785749060] [2025-03-17 03:20:20,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:20,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:20,028 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:20:20,030 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:20:20,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:20,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:20,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:20,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:20,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:20:20,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:20:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 03:20:20,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:20:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785749060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:20,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:20:20,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:20:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376335317] [2025-03-17 03:20:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:20,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:20:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:20,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:20:20,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:20:20,324 INFO L87 Difference]: Start difference. First operand has 158 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 116 states have internal predecessors, (169), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:20:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:20,376 INFO L93 Difference]: Finished difference Result 313 states and 536 transitions. [2025-03-17 03:20:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:20:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 266 [2025-03-17 03:20:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:20,385 INFO L225 Difference]: With dead ends: 313 [2025-03-17 03:20:20,386 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 03:20:20,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 267 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:20:20,393 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:20,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:20:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 03:20:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-17 03:20:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:20:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 245 transitions. [2025-03-17 03:20:20,448 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 245 transitions. Word has length 266 [2025-03-17 03:20:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:20,449 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 245 transitions. [2025-03-17 03:20:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:20:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2025-03-17 03:20:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:20,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:20,452 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:20:20,657 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:20:20,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1942490572, now seen corresponding path program 1 times [2025-03-17 03:20:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815096839] [2025-03-17 03:20:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:20,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:20,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815096839] [2025-03-17 03:20:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815096839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:21,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:20:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914766013] [2025-03-17 03:20:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:21,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:20:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:21,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:20:21,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:20:21,043 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:21,094 INFO L93 Difference]: Finished difference Result 311 states and 489 transitions. [2025-03-17 03:20:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:20:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:20:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:21,097 INFO L225 Difference]: With dead ends: 311 [2025-03-17 03:20:21,097 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 03:20:21,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:20:21,098 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:21,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:20:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 03:20:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-17 03:20:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 114 states have internal predecessors, (164), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:20:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2025-03-17 03:20:21,111 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 266 [2025-03-17 03:20:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:21,113 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2025-03-17 03:20:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2025-03-17 03:20:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:21,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:21,117 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:20:21,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash -402176469, now seen corresponding path program 1 times [2025-03-17 03:20:21,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:21,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808088701] [2025-03-17 03:20:21,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:21,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:21,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:21,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808088701] [2025-03-17 03:20:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808088701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:21,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:20:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198609209] [2025-03-17 03:20:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:20:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:21,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:20:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:20:21,436 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:21,581 INFO L93 Difference]: Finished difference Result 466 states and 730 transitions. [2025-03-17 03:20:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:20:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:20:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:21,585 INFO L225 Difference]: With dead ends: 466 [2025-03-17 03:20:21,585 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 03:20:21,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:20:21,589 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 228 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:21,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 611 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:20:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 03:20:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 204. [2025-03-17 03:20:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 162 states have internal predecessors, (240), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:20:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 320 transitions. [2025-03-17 03:20:21,610 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 320 transitions. Word has length 266 [2025-03-17 03:20:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:21,611 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 320 transitions. [2025-03-17 03:20:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 320 transitions. [2025-03-17 03:20:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:21,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:21,613 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:20:21,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2034980468, now seen corresponding path program 1 times [2025-03-17 03:20:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160944573] [2025-03-17 03:20:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:21,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:21,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:21,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160944573] [2025-03-17 03:20:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160944573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:20:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829179281] [2025-03-17 03:20:23,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:20:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:20:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:20:23,423 INFO L87 Difference]: Start difference. First operand 204 states and 320 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:20:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:24,295 INFO L93 Difference]: Finished difference Result 644 states and 1003 transitions. [2025-03-17 03:20:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:20:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 266 [2025-03-17 03:20:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:24,301 INFO L225 Difference]: With dead ends: 644 [2025-03-17 03:20:24,302 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 03:20:24,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:20:24,303 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 538 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 534 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:20:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 03:20:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 417. [2025-03-17 03:20:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.5121293800539084) internal successors, (561), 372 states have internal predecessors, (561), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:20:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 647 transitions. [2025-03-17 03:20:24,341 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 647 transitions. Word has length 266 [2025-03-17 03:20:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:24,342 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 647 transitions. [2025-03-17 03:20:24,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:20:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 647 transitions. [2025-03-17 03:20:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:24,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:24,345 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:20:24,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -681670771, now seen corresponding path program 1 times [2025-03-17 03:20:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461178204] [2025-03-17 03:20:24,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:24,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461178204] [2025-03-17 03:20:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461178204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:24,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:20:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375351235] [2025-03-17 03:20:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:20:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:24,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:20:24,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:20:24,687 INFO L87 Difference]: Start difference. First operand 417 states and 647 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:24,874 INFO L93 Difference]: Finished difference Result 839 states and 1305 transitions. [2025-03-17 03:20:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:20:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:20:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:24,880 INFO L225 Difference]: With dead ends: 839 [2025-03-17 03:20:24,880 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 03:20:24,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:20:24,882 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 301 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:24,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 350 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:20:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 03:20:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-17 03:20:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 377 states have (on average 1.5039787798408488) internal successors, (567), 378 states have internal predecessors, (567), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:20:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 653 transitions. [2025-03-17 03:20:24,909 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 653 transitions. Word has length 266 [2025-03-17 03:20:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:24,910 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 653 transitions. [2025-03-17 03:20:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 653 transitions. [2025-03-17 03:20:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:20:24,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:24,914 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:20:24,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -426934226, now seen corresponding path program 1 times [2025-03-17 03:20:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737267186] [2025-03-17 03:20:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:24,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:25,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:25,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:20:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737267186] [2025-03-17 03:20:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737267186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:20:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018096403] [2025-03-17 03:20:25,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:25,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:25,251 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:20:25,254 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:20:25,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:20:25,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:20:25,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:25,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:25,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:20:25,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:20:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-17 03:20:26,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:20:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-17 03:20:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018096403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:20:26,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:20:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-17 03:20:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292368630] [2025-03-17 03:20:26,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:20:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:20:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:20:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:20:26,699 INFO L87 Difference]: Start difference. First operand 423 states and 653 transitions. Second operand has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-17 03:20:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:27,293 INFO L93 Difference]: Finished difference Result 775 states and 1191 transitions. [2025-03-17 03:20:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:20:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) Word has length 266 [2025-03-17 03:20:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:27,296 INFO L225 Difference]: With dead ends: 775 [2025-03-17 03:20:27,296 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 03:20:27,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:20:27,302 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 920 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:27,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 453 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:20:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 03:20:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-17 03:20:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 302 states have (on average 1.3973509933774835) internal successors, (422), 303 states have internal predecessors, (422), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:20:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 508 transitions. [2025-03-17 03:20:27,319 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 508 transitions. Word has length 266 [2025-03-17 03:20:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:27,319 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 508 transitions. [2025-03-17 03:20:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-17 03:20:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 508 transitions. [2025-03-17 03:20:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:20:27,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:27,322 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,330 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:20:27,522 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,SelfDestructingSolverStorable5 [2025-03-17 03:20:27,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:27,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1722309890, now seen corresponding path program 1 times [2025-03-17 03:20:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:27,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091952477] [2025-03-17 03:20:27,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:27,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:20:27,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:20:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091952477] [2025-03-17 03:20:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091952477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:20:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127760932] [2025-03-17 03:20:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:20:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:28,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:20:28,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:20:28,061 INFO L87 Difference]: Start difference. First operand 351 states and 508 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:28,339 INFO L93 Difference]: Finished difference Result 1061 states and 1535 transitions. [2025-03-17 03:20:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:20:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:20:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:28,343 INFO L225 Difference]: With dead ends: 1061 [2025-03-17 03:20:28,344 INFO L226 Difference]: Without dead ends: 711 [2025-03-17 03:20:28,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:20:28,345 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 266 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:28,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 605 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:20:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-17 03:20:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 583. [2025-03-17 03:20:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 489 states have (on average 1.3905930470347647) internal successors, (680), 490 states have internal predecessors, (680), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:20:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 846 transitions. [2025-03-17 03:20:28,397 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 846 transitions. Word has length 268 [2025-03-17 03:20:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:28,398 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 846 transitions. [2025-03-17 03:20:28,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 846 transitions. [2025-03-17 03:20:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:20:28,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:28,401 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:20:28,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:28,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -562553565, now seen corresponding path program 1 times [2025-03-17 03:20:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979800992] [2025-03-17 03:20:28,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:28,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:20:28,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:20:28,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979800992] [2025-03-17 03:20:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979800992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:20:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129158667] [2025-03-17 03:20:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:20:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:30,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:20:30,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:20:30,147 INFO L87 Difference]: Start difference. First operand 583 states and 846 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:31,560 INFO L93 Difference]: Finished difference Result 1438 states and 2052 transitions. [2025-03-17 03:20:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:20:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:20:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:31,568 INFO L225 Difference]: With dead ends: 1438 [2025-03-17 03:20:31,569 INFO L226 Difference]: Without dead ends: 1088 [2025-03-17 03:20:31,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:20:31,571 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 653 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:31,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 969 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:20:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-17 03:20:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 620. [2025-03-17 03:20:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 526 states have (on average 1.397338403041825) internal successors, (735), 527 states have internal predecessors, (735), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:20:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 901 transitions. [2025-03-17 03:20:31,620 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 901 transitions. Word has length 268 [2025-03-17 03:20:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 901 transitions. [2025-03-17 03:20:31,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 901 transitions. [2025-03-17 03:20:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:20:31,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:31,624 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:20:31,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:31,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:31,625 INFO L85 PathProgramCache]: Analyzing trace with hash 944998244, now seen corresponding path program 1 times [2025-03-17 03:20:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979960588] [2025-03-17 03:20:31,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:31,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:31,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:20:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:20:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:32,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979960588] [2025-03-17 03:20:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979960588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:20:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820655136] [2025-03-17 03:20:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:32,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:20:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:20:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:20:32,606 INFO L87 Difference]: Start difference. First operand 620 states and 901 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:37,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:20:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:38,499 INFO L93 Difference]: Finished difference Result 1505 states and 2172 transitions. [2025-03-17 03:20:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:20:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:20:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:38,504 INFO L225 Difference]: With dead ends: 1505 [2025-03-17 03:20:38,504 INFO L226 Difference]: Without dead ends: 886 [2025-03-17 03:20:38,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:20:38,506 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 563 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:38,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 778 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 974 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-03-17 03:20:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-17 03:20:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 658. [2025-03-17 03:20:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 564 states have (on average 1.4060283687943262) internal successors, (793), 565 states have internal predecessors, (793), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:20:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 959 transitions. [2025-03-17 03:20:38,551 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 959 transitions. Word has length 268 [2025-03-17 03:20:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:38,552 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 959 transitions. [2025-03-17 03:20:38,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 959 transitions. [2025-03-17 03:20:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:20:38,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:38,557 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:20:38,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:38,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1996659355, now seen corresponding path program 1 times [2025-03-17 03:20:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:38,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663511121] [2025-03-17 03:20:38,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:38,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:38,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:20:38,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:20:38,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:38,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:20:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663511121] [2025-03-17 03:20:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663511121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:20:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185737090] [2025-03-17 03:20:38,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:38,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:38,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:38,986 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:20:38,988 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:20:39,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:20:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:20:39,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:39,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:20:39,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:20:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1190 proven. 48 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-03-17 03:20:39,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:20:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:20:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185737090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:20:39,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:20:39,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2025-03-17 03:20:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227317] [2025-03-17 03:20:39,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:20:39,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:20:39,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:39,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:20:39,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:20:39,712 INFO L87 Difference]: Start difference. First operand 658 states and 959 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-17 03:20:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:41,135 INFO L93 Difference]: Finished difference Result 2656 states and 3840 transitions. [2025-03-17 03:20:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 03:20:41,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 268 [2025-03-17 03:20:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:41,146 INFO L225 Difference]: With dead ends: 2656 [2025-03-17 03:20:41,147 INFO L226 Difference]: Without dead ends: 1999 [2025-03-17 03:20:41,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 533 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 03:20:41,151 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1474 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:41,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 971 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:20:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-03-17 03:20:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 712. [2025-03-17 03:20:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 614 states have (on average 1.3990228013029316) internal successors, (859), 615 states have internal predecessors, (859), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:20:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1025 transitions. [2025-03-17 03:20:41,206 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1025 transitions. Word has length 268 [2025-03-17 03:20:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:41,207 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1025 transitions. [2025-03-17 03:20:41,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-17 03:20:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1025 transitions. [2025-03-17 03:20:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-17 03:20:41,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:41,210 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,218 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:20:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:41,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1086047786, now seen corresponding path program 1 times [2025-03-17 03:20:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777072462] [2025-03-17 03:20:41,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:20:41,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:20:41,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:41,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:20:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777072462] [2025-03-17 03:20:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777072462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:20:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295515700] [2025-03-17 03:20:41,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:41,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:41,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:41,758 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:20:41,760 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:20:41,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:20:41,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:20:41,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:41,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:41,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:20:41,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:20:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2021 proven. 126 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-17 03:20:42,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:20:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:20:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295515700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:20:43,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:20:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-17 03:20:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825542494] [2025-03-17 03:20:43,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:20:43,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 03:20:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 03:20:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:20:43,205 INFO L87 Difference]: Start difference. First operand 712 states and 1025 transitions. Second operand has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-17 03:20:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:45,141 INFO L93 Difference]: Finished difference Result 2474 states and 3550 transitions. [2025-03-17 03:20:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 03:20:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) Word has length 269 [2025-03-17 03:20:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:45,150 INFO L225 Difference]: With dead ends: 2474 [2025-03-17 03:20:45,150 INFO L226 Difference]: Without dead ends: 1763 [2025-03-17 03:20:45,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=830, Invalid=1822, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 03:20:45,154 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1805 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:45,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1805 Valid, 654 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:20:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-17 03:20:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1224. [2025-03-17 03:20:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1091 states have (on average 1.3913840513290558) internal successors, (1518), 1095 states have internal predecessors, (1518), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 03:20:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1734 transitions. [2025-03-17 03:20:45,241 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1734 transitions. Word has length 269 [2025-03-17 03:20:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:45,242 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1734 transitions. [2025-03-17 03:20:45,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-17 03:20:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1734 transitions. [2025-03-17 03:20:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-17 03:20:45,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:45,246 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:45,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:20:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:45,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2006645760, now seen corresponding path program 1 times [2025-03-17 03:20:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215461367] [2025-03-17 03:20:45,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:20:45,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:20:45,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:45,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:20:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215461367] [2025-03-17 03:20:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215461367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:20:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023371442] [2025-03-17 03:20:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:20:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:20:46,317 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:20:46,319 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:20:46,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:20:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:20:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:46,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:20:46,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:20:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-17 03:20:46,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:20:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:20:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023371442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:20:47,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:20:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2025-03-17 03:20:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713566033] [2025-03-17 03:20:47,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:20:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 03:20:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:47,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 03:20:47,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:20:47,663 INFO L87 Difference]: Start difference. First operand 1224 states and 1734 transitions. Second operand has 26 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-17 03:20:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:54,283 INFO L93 Difference]: Finished difference Result 4472 states and 6110 transitions. [2025-03-17 03:20:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-17 03:20:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 269 [2025-03-17 03:20:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:54,298 INFO L225 Difference]: With dead ends: 4472 [2025-03-17 03:20:54,298 INFO L226 Difference]: Without dead ends: 3241 [2025-03-17 03:20:54,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2691, Invalid=9741, Unknown=0, NotChecked=0, Total=12432 [2025-03-17 03:20:54,305 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 2564 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 3217 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2564 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 3217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:54,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2564 Valid, 1959 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 3217 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 03:20:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2025-03-17 03:20:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 1486. [2025-03-17 03:20:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1211 states have (on average 1.2981007431874483) internal successors, (1572), 1217 states have internal predecessors, (1572), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:20:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1992 transitions. [2025-03-17 03:20:54,481 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1992 transitions. Word has length 269 [2025-03-17 03:20:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:54,482 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1992 transitions. [2025-03-17 03:20:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.32) internal successors, (183), 24 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-17 03:20:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1992 transitions. [2025-03-17 03:20:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:20:54,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:54,484 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 03:20:54,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 03:20:54,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:54,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -43264630, now seen corresponding path program 1 times [2025-03-17 03:20:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114544207] [2025-03-17 03:20:54,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:54,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:20:54,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:20:54,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:54,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114544207] [2025-03-17 03:20:54,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114544207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:54,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:54,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:20:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808775662] [2025-03-17 03:20:54,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:20:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:54,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:20:54,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:20:54,917 INFO L87 Difference]: Start difference. First operand 1486 states and 1992 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:20:55,331 INFO L93 Difference]: Finished difference Result 3213 states and 4327 transitions. [2025-03-17 03:20:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:20:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-03-17 03:20:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:20:55,340 INFO L225 Difference]: With dead ends: 3213 [2025-03-17 03:20:55,340 INFO L226 Difference]: Without dead ends: 1728 [2025-03-17 03:20:55,344 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:20:55,345 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 224 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:20:55,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 451 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:20:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-03-17 03:20:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1510. [2025-03-17 03:20:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1235 states have (on average 1.2923076923076924) internal successors, (1596), 1241 states have internal predecessors, (1596), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:20:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2016 transitions. [2025-03-17 03:20:55,559 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2016 transitions. Word has length 272 [2025-03-17 03:20:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:20:55,560 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2016 transitions. [2025-03-17 03:20:55,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:20:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2016 transitions. [2025-03-17 03:20:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:20:55,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:20:55,564 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:20:55,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:20:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:20:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1201499851, now seen corresponding path program 1 times [2025-03-17 03:20:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:20:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774617045] [2025-03-17 03:20:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:20:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:20:55,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:20:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:20:55,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:20:55,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:20:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:20:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:20:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774617045] [2025-03-17 03:20:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774617045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:20:58,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:20:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:20:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831433600] [2025-03-17 03:20:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:20:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:20:58,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:20:58,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:20:58,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:20:58,040 INFO L87 Difference]: Start difference. First operand 1510 states and 2016 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:21:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:21:01,089 INFO L93 Difference]: Finished difference Result 3773 states and 5024 transitions. [2025-03-17 03:21:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:21:01,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-03-17 03:21:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:21:01,096 INFO L225 Difference]: With dead ends: 3773 [2025-03-17 03:21:01,096 INFO L226 Difference]: Without dead ends: 2257 [2025-03-17 03:21:01,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-17 03:21:01,100 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1212 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:21:01,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1172 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 03:21:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-17 03:21:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1577. [2025-03-17 03:21:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1302 states have (on average 1.294930875576037) internal successors, (1686), 1308 states have internal predecessors, (1686), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:21:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2106 transitions. [2025-03-17 03:21:01,266 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2106 transitions. Word has length 272 [2025-03-17 03:21:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:21:01,266 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2106 transitions. [2025-03-17 03:21:01,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:21:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2106 transitions. [2025-03-17 03:21:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:21:01,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:21:01,268 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:21:01,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:21:01,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:21:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash -523981046, now seen corresponding path program 1 times [2025-03-17 03:21:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:21:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263055815] [2025-03-17 03:21:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:21:01,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:21:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:21:01,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:01,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:21:02,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:21:02,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263055815] [2025-03-17 03:21:02,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263055815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:21:02,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:21:02,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:21:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378804919] [2025-03-17 03:21:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:21:02,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:21:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:21:02,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:21:02,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:21:02,375 INFO L87 Difference]: Start difference. First operand 1577 states and 2106 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:21:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:21:03,618 INFO L93 Difference]: Finished difference Result 3252 states and 4336 transitions. [2025-03-17 03:21:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:21:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-03-17 03:21:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:21:03,625 INFO L225 Difference]: With dead ends: 3252 [2025-03-17 03:21:03,625 INFO L226 Difference]: Without dead ends: 1676 [2025-03-17 03:21:03,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:21:03,629 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 679 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:21:03,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 715 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:21:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-03-17 03:21:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1577. [2025-03-17 03:21:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1302 states have (on average 1.2918586789554531) internal successors, (1682), 1308 states have internal predecessors, (1682), 210 states have call successors, (210), 64 states have call predecessors, (210), 64 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:21:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2102 transitions. [2025-03-17 03:21:03,760 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2102 transitions. Word has length 272 [2025-03-17 03:21:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:21:03,761 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2102 transitions. [2025-03-17 03:21:03,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:21:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2102 transitions. [2025-03-17 03:21:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:21:03,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:21:03,763 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:21:03,763 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:21:03,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:21:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 829328651, now seen corresponding path program 1 times [2025-03-17 03:21:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:21:03,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399296119] [2025-03-17 03:21:03,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:21:03,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:21:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:21:03,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 138 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-17 03:21:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:21:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399296119] [2025-03-17 03:21:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399296119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:21:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472927379] [2025-03-17 03:21:04,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:21:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:21:04,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:21:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 03:21:04,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:21:04,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:21:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:04,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 03:21:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:21:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1456 proven. 57 refuted. 0 times theorem prover too weak. 1607 trivial. 0 not checked. [2025-03-17 03:21:05,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:21:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-17 03:21:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472927379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:21:06,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:21:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 9] total 28 [2025-03-17 03:21:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27003805] [2025-03-17 03:21:06,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:21:06,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 03:21:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:21:06,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 03:21:06,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:21:06,833 INFO L87 Difference]: Start difference. First operand 1577 states and 2102 transitions. Second operand has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 25 states have internal predecessors, (161), 8 states have call successors, (87), 5 states have call predecessors, (87), 10 states have return successors, (89), 10 states have call predecessors, (89), 8 states have call successors, (89) [2025-03-17 03:21:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:21:12,941 INFO L93 Difference]: Finished difference Result 4937 states and 6480 transitions. [2025-03-17 03:21:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-17 03:21:12,942 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 25 states have internal predecessors, (161), 8 states have call successors, (87), 5 states have call predecessors, (87), 10 states have return successors, (89), 10 states have call predecessors, (89), 8 states have call successors, (89) Word has length 272 [2025-03-17 03:21:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:21:12,952 INFO L225 Difference]: With dead ends: 4937 [2025-03-17 03:21:12,952 INFO L226 Difference]: Without dead ends: 3361 [2025-03-17 03:21:12,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1523, Invalid=5787, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 03:21:12,956 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1882 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:21:12,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 929 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 03:21:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2025-03-17 03:21:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 1415. [2025-03-17 03:21:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1183 states have (on average 1.275570583262891) internal successors, (1509), 1184 states have internal predecessors, (1509), 163 states have call successors, (163), 68 states have call predecessors, (163), 68 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-03-17 03:21:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1835 transitions. [2025-03-17 03:21:13,164 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1835 transitions. Word has length 272 [2025-03-17 03:21:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:21:13,165 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1835 transitions. [2025-03-17 03:21:13,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 25 states have internal predecessors, (161), 8 states have call successors, (87), 5 states have call predecessors, (87), 10 states have return successors, (89), 10 states have call predecessors, (89), 8 states have call successors, (89) [2025-03-17 03:21:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1835 transitions. [2025-03-17 03:21:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 03:21:13,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:21:13,172 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 03:21:13,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 03:21:13,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:21:13,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:21:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2119164847, now seen corresponding path program 1 times [2025-03-17 03:21:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:21:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057364299] [2025-03-17 03:21:13,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:21:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 03:21:13,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 03:21:13,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:21:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:21:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057364299] [2025-03-17 03:21:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057364299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:21:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4225858] [2025-03-17 03:21:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:21:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:21:17,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:21:17,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 03:21:18,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 03:21:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 03:21:18,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:18,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 03:21:18,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:21:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 515 proven. 210 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2025-03-17 03:21:19,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:21:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:21:21,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4225858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:21:21,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:21:21,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 31 [2025-03-17 03:21:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235557746] [2025-03-17 03:21:21,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:21:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 03:21:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:21:21,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 03:21:21,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-03-17 03:21:21,009 INFO L87 Difference]: Start difference. First operand 1415 states and 1835 transitions. Second operand has 31 states, 31 states have (on average 6.645161290322581) internal successors, (206), 30 states have internal predecessors, (206), 7 states have call successors, (120), 4 states have call predecessors, (120), 7 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) [2025-03-17 03:21:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:21:29,501 INFO L93 Difference]: Finished difference Result 3370 states and 4424 transitions. [2025-03-17 03:21:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-17 03:21:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.645161290322581) internal successors, (206), 30 states have internal predecessors, (206), 7 states have call successors, (120), 4 states have call predecessors, (120), 7 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) Word has length 273 [2025-03-17 03:21:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:21:29,508 INFO L225 Difference]: With dead ends: 3370 [2025-03-17 03:21:29,508 INFO L226 Difference]: Without dead ends: 1956 [2025-03-17 03:21:29,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=886, Invalid=2896, Unknown=0, NotChecked=0, Total=3782 [2025-03-17 03:21:29,511 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 2651 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:21:29,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2654 Valid, 1510 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 03:21:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-17 03:21:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 292. [2025-03-17 03:21:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.240343347639485) internal successors, (289), 233 states have internal predecessors, (289), 40 states have call successors, (40), 18 states have call predecessors, (40), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:21:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 369 transitions. [2025-03-17 03:21:29,586 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 369 transitions. Word has length 273 [2025-03-17 03:21:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:21:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 369 transitions. [2025-03-17 03:21:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.645161290322581) internal successors, (206), 30 states have internal predecessors, (206), 7 states have call successors, (120), 4 states have call predecessors, (120), 7 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) [2025-03-17 03:21:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 369 transitions. [2025-03-17 03:21:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 03:21:29,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:21:29,587 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 03:21:29,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:21:29,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:21:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:21:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash 431711935, now seen corresponding path program 1 times [2025-03-17 03:21:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:21:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380858714] [2025-03-17 03:21:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:21:29,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:21:29,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:21:29,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:29,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:21:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:21:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380858714] [2025-03-17 03:21:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380858714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:21:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518551889] [2025-03-17 03:21:30,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:30,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:21:30,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:21:30,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:21:30,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 03:21:30,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:21:30,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:21:30,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:30,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:30,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:21:30,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:21:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1219 proven. 87 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2025-03-17 03:21:30,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:21:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:21:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518551889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:21:30,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:21:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 03:21:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936503836] [2025-03-17 03:21:30,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:21:30,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:21:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:21:30,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:21:30,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:21:30,829 INFO L87 Difference]: Start difference. First operand 292 states and 369 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-17 03:21:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:21:31,499 INFO L93 Difference]: Finished difference Result 894 states and 1123 transitions. [2025-03-17 03:21:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:21:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 275 [2025-03-17 03:21:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:21:31,503 INFO L225 Difference]: With dead ends: 894 [2025-03-17 03:21:31,503 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 03:21:31,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 547 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:21:31,504 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 542 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:21:31,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 586 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:21:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 03:21:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 589. [2025-03-17 03:21:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 470 states have (on average 1.2340425531914894) internal successors, (580), 470 states have internal predecessors, (580), 80 states have call successors, (80), 38 states have call predecessors, (80), 38 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 03:21:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 740 transitions. [2025-03-17 03:21:31,776 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 740 transitions. Word has length 275 [2025-03-17 03:21:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:21:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 740 transitions. [2025-03-17 03:21:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-17 03:21:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 740 transitions. [2025-03-17 03:21:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 03:21:31,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:21:31,778 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:31,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 03:21:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 03:21:31,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:21:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:21:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1785021632, now seen corresponding path program 1 times [2025-03-17 03:21:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:21:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659345445] [2025-03-17 03:21:31,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:21:31,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:21:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:21:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:21:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:21:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659345445] [2025-03-17 03:21:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659345445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:21:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765647866] [2025-03-17 03:21:36,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:21:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:21:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:21:36,631 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21:36,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 03:21:36,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:21:36,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:21:36,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:21:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:21:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-17 03:21:36,809 INFO L279 TraceCheckSpWp]: Computing forward predicates...