./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.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_fillercode_fillercodestructure_filler-pr-co_file-66.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 fc772c7bbac1de5fe64d64c143c1154d0fb749c01b6a27196c7210715a9fc32d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:48:42,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:48:42,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:48:42,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:48:42,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:48:42,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:48:42,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:48:42,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:48:42,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:48:42,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:48:42,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:48:42,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:48:42,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:48:42,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:48:42,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:48:42,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:48:42,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:48:42,395 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:48:42,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:42,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:48:42,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:48:42,396 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 -> fc772c7bbac1de5fe64d64c143c1154d0fb749c01b6a27196c7210715a9fc32d [2025-03-17 01:48:42,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:48:42,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:48:42,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:48:42,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:48:42,686 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:48:42,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-03-17 01:48:43,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a20a899/9479ab905d534e2c82579c78c5579217/FLAG3290d68c4 [2025-03-17 01:48:44,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:48:44,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-03-17 01:48:44,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a20a899/9479ab905d534e2c82579c78c5579217/FLAG3290d68c4 [2025-03-17 01:48:44,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a20a899/9479ab905d534e2c82579c78c5579217 [2025-03-17 01:48:44,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:48:44,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:48:44,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:44,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:48:44,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:48:44,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa1d3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44, skipping insertion in model container [2025-03-17 01:48:44,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:48:44,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i[919,932] [2025-03-17 01:48:44,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:44,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:48:44,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i[919,932] [2025-03-17 01:48:44,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:44,363 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:48:44,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44 WrapperNode [2025-03-17 01:48:44,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:44,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:44,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:48:44,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:48:44,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,411 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-17 01:48:44,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:44,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:48:44,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:48:44,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:48:44,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,468 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 01:48:44,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:48:44,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:48:44,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:48:44,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:48:44,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (1/1) ... [2025-03-17 01:48:44,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:44,561 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 01:48:44,565 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 01:48:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:48:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:48:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:48:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:48:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:48:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:48:44,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:48:44,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:48:44,955 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:48:44,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:48:44,970 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:48:44,970 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:48:44,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:44 BoogieIcfgContainer [2025-03-17 01:48:44,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:48:44,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:48:44,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:48:44,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:48:44,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:48:44" (1/3) ... [2025-03-17 01:48:44,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5a419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:44, skipping insertion in model container [2025-03-17 01:48:44,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:44" (2/3) ... [2025-03-17 01:48:44,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5a419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:44, skipping insertion in model container [2025-03-17 01:48:44,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:44" (3/3) ... [2025-03-17 01:48:44,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i [2025-03-17 01:48:44,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:48:44,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-66.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:48:45,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:48:45,041 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;@5b848b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:48:45,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:48:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 01:48:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:48:45,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:45,058 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:48:45,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1545713429, now seen corresponding path program 1 times [2025-03-17 01:48:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420506978] [2025-03-17 01:48:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:45,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:48:45,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:48:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 01:48:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420506978] [2025-03-17 01:48:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420506978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:48:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484181814] [2025-03-17 01:48:45,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:45,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:45,354 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 01:48:45,356 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 01:48:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:48:45,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:48:45,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:45,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:45,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:48:45,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 01:48:45,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:48:45,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484181814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:45,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:48:45,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:48:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945500902] [2025-03-17 01:48:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:45,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:48:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:45,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:48:45,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:48:45,578 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 01:48:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:45,599 INFO L93 Difference]: Finished difference Result 151 states and 270 transitions. [2025-03-17 01:48:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:48:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2025-03-17 01:48:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:45,609 INFO L225 Difference]: With dead ends: 151 [2025-03-17 01:48:45,609 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 01:48:45,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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 01:48:45,614 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:45,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 01:48:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 01:48:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 01:48:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 117 transitions. [2025-03-17 01:48:45,652 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 117 transitions. Word has length 156 [2025-03-17 01:48:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:45,654 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 117 transitions. [2025-03-17 01:48:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 01:48:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2025-03-17 01:48:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:48:45,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:45,657 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:48:45,664 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 01:48:45,857 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 01:48:45,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 110303949, now seen corresponding path program 1 times [2025-03-17 01:48:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425470836] [2025-03-17 01:48:45,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:45,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:48:45,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:48:45,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:45,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:48:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425470836] [2025-03-17 01:48:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425470836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:48:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237604148] [2025-03-17 01:48:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:48:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:46,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:48:46,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:48:46,641 INFO L87 Difference]: Start difference. First operand 74 states and 117 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:48:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:47,019 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2025-03-17 01:48:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:48:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 156 [2025-03-17 01:48:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:47,022 INFO L225 Difference]: With dead ends: 205 [2025-03-17 01:48:47,022 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 01:48:47,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:48:47,023 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 294 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:47,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 205 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:48:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 01:48:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2025-03-17 01:48:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 80 states have internal predecessors, (116), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 01:48:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-03-17 01:48:47,064 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 156 [2025-03-17 01:48:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-03-17 01:48:47,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:48:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-03-17 01:48:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:48:47,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:47,069 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:48:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:48:47,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:47,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 138933100, now seen corresponding path program 1 times [2025-03-17 01:48:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:47,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946387884] [2025-03-17 01:48:47,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:48:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:48:47,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:47,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946387884] [2025-03-17 01:49:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946387884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:49:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751093598] [2025-03-17 01:49:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:49:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:13,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:49:13,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:49:13,444 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:14,952 INFO L93 Difference]: Finished difference Result 486 states and 743 transitions. [2025-03-17 01:49:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:49:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:14,961 INFO L225 Difference]: With dead ends: 486 [2025-03-17 01:49:14,961 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 01:49:14,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:49:14,962 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 326 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:14,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 593 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:49:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 01:49:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 203. [2025-03-17 01:49:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 145 states have internal predecessors, (203), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 01:49:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2025-03-17 01:49:15,007 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 156 [2025-03-17 01:49:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:15,008 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2025-03-17 01:49:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2025-03-17 01:49:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:15,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:15,012 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:49:15,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 138962891, now seen corresponding path program 1 times [2025-03-17 01:49:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:15,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515710992] [2025-03-17 01:49:15,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:15,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:15,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:15,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:15,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515710992] [2025-03-17 01:49:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515710992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:49:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590687653] [2025-03-17 01:49:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:49:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:19,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:49:19,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:49:19,173 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:20,028 INFO L93 Difference]: Finished difference Result 544 states and 820 transitions. [2025-03-17 01:49:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:49:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:20,032 INFO L225 Difference]: With dead ends: 544 [2025-03-17 01:49:20,032 INFO L226 Difference]: Without dead ends: 434 [2025-03-17 01:49:20,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:49:20,033 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 298 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:20,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 458 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:49:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-17 01:49:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 229. [2025-03-17 01:49:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 170 states have (on average 1.423529411764706) internal successors, (242), 171 states have internal predecessors, (242), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 01:49:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2025-03-17 01:49:20,055 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 156 [2025-03-17 01:49:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2025-03-17 01:49:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2025-03-17 01:49:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:20,057 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:49:20,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1686647410, now seen corresponding path program 1 times [2025-03-17 01:49:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843983166] [2025-03-17 01:49:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:20,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:20,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:20,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:20,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:21,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843983166] [2025-03-17 01:49:21,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843983166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:21,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:21,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:49:21,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222183113] [2025-03-17 01:49:21,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:21,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:49:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:21,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:49:21,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:49:21,777 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:22,430 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2025-03-17 01:49:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:49:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 156 [2025-03-17 01:49:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:22,433 INFO L225 Difference]: With dead ends: 517 [2025-03-17 01:49:22,433 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 01:49:22,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:49:22,434 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 292 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:22,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 367 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:49:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 01:49:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 258. [2025-03-17 01:49:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 200 states have internal predecessors, (286), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:49:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 386 transitions. [2025-03-17 01:49:22,461 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 386 transitions. Word has length 156 [2025-03-17 01:49:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 386 transitions. [2025-03-17 01:49:22,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 386 transitions. [2025-03-17 01:49:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:22,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:22,464 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:49:22,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:22,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1658018259, now seen corresponding path program 1 times [2025-03-17 01:49:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504626260] [2025-03-17 01:49:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:22,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:22,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:22,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504626260] [2025-03-17 01:49:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504626260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:49:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704800597] [2025-03-17 01:49:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:49:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:26,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:49:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:49:26,215 INFO L87 Difference]: Start difference. First operand 258 states and 386 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:26,958 INFO L93 Difference]: Finished difference Result 399 states and 572 transitions. [2025-03-17 01:49:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:49:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:26,961 INFO L225 Difference]: With dead ends: 399 [2025-03-17 01:49:26,961 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 01:49:26,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:49:26,962 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 198 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:26,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 652 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:49:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 01:49:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 262. [2025-03-17 01:49:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.438423645320197) internal successors, (292), 204 states have internal predecessors, (292), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:49:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2025-03-17 01:49:26,987 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 156 [2025-03-17 01:49:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2025-03-17 01:49:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2025-03-17 01:49:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:26,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:26,990 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:26,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:49:26,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:26,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1657988468, now seen corresponding path program 1 times [2025-03-17 01:49:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:26,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440534678] [2025-03-17 01:49:26,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:26,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:27,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440534678] [2025-03-17 01:49:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440534678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:49:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370963525] [2025-03-17 01:49:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:49:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:31,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:49:31,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:49:31,934 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:33,676 INFO L93 Difference]: Finished difference Result 453 states and 658 transitions. [2025-03-17 01:49:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 01:49:33,677 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:33,679 INFO L225 Difference]: With dead ends: 453 [2025-03-17 01:49:33,679 INFO L226 Difference]: Without dead ends: 451 [2025-03-17 01:49:33,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:49:33,680 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 318 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:33,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 730 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:49:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-17 01:49:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 266. [2025-03-17 01:49:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 207 states have (on average 1.4396135265700483) internal successors, (298), 208 states have internal predecessors, (298), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:49:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 398 transitions. [2025-03-17 01:49:33,703 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 398 transitions. Word has length 156 [2025-03-17 01:49:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 398 transitions. [2025-03-17 01:49:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2025-03-17 01:49:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:33,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:33,706 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:33,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:49:33,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1646484909, now seen corresponding path program 1 times [2025-03-17 01:49:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375698850] [2025-03-17 01:49:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:33,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:33,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:33,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:33,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:33,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375698850] [2025-03-17 01:49:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375698850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:49:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773373248] [2025-03-17 01:49:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:33,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:49:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:33,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:49:33,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:49:33,760 INFO L87 Difference]: Start difference. First operand 266 states and 398 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:33,813 INFO L93 Difference]: Finished difference Result 571 states and 864 transitions. [2025-03-17 01:49:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:49:33,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:33,817 INFO L225 Difference]: With dead ends: 571 [2025-03-17 01:49:33,817 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 01:49:33,817 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 01:49:33,818 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 100 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:33,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 305 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:49:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 01:49:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2025-03-17 01:49:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 296 states have (on average 1.3783783783783783) internal successors, (408), 298 states have internal predecessors, (408), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 01:49:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 560 transitions. [2025-03-17 01:49:33,849 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 560 transitions. Word has length 156 [2025-03-17 01:49:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:33,849 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 560 transitions. [2025-03-17 01:49:33,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 560 transitions. [2025-03-17 01:49:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:33,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:33,851 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:33,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:49:33,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1449971404, now seen corresponding path program 1 times [2025-03-17 01:49:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109928859] [2025-03-17 01:49:33,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:33,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:33,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:33,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:33,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109928859] [2025-03-17 01:49:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109928859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:49:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25768011] [2025-03-17 01:49:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:49:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:33,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:49:33,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:49:33,921 INFO L87 Difference]: Start difference. First operand 385 states and 560 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:34,115 INFO L93 Difference]: Finished difference Result 877 states and 1265 transitions. [2025-03-17 01:49:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:49:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-03-17 01:49:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:34,119 INFO L225 Difference]: With dead ends: 877 [2025-03-17 01:49:34,119 INFO L226 Difference]: Without dead ends: 576 [2025-03-17 01:49:34,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:49:34,121 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 94 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:34,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 366 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:49:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-17 01:49:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 528. [2025-03-17 01:49:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 409 states have (on average 1.374083129584352) internal successors, (562), 412 states have internal predecessors, (562), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 01:49:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 766 transitions. [2025-03-17 01:49:34,172 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 766 transitions. Word has length 156 [2025-03-17 01:49:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:34,172 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 766 transitions. [2025-03-17 01:49:34,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 766 transitions. [2025-03-17 01:49:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:34,174 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:49:34,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -375609106, now seen corresponding path program 1 times [2025-03-17 01:49:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707865983] [2025-03-17 01:49:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:34,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:35,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:35,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707865983] [2025-03-17 01:49:35,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707865983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:35,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:35,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:49:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047093086] [2025-03-17 01:49:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:35,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:49:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:35,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:49:35,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:49:35,014 INFO L87 Difference]: Start difference. First operand 528 states and 766 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 01:49:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:35,921 INFO L93 Difference]: Finished difference Result 1018 states and 1458 transitions. [2025-03-17 01:49:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:49:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 156 [2025-03-17 01:49:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:35,924 INFO L225 Difference]: With dead ends: 1018 [2025-03-17 01:49:35,924 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 01:49:35,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:49:35,926 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 248 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:35,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 526 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:49:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 01:49:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 503. [2025-03-17 01:49:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 386 states have (on average 1.3730569948186528) internal successors, (530), 388 states have internal predecessors, (530), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:49:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 730 transitions. [2025-03-17 01:49:35,970 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 730 transitions. Word has length 156 [2025-03-17 01:49:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:35,972 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 730 transitions. [2025-03-17 01:49:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 01:49:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 730 transitions. [2025-03-17 01:49:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:35,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:35,974 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:49:35,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -346979955, now seen corresponding path program 1 times [2025-03-17 01:49:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540342960] [2025-03-17 01:49:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:35,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:36,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:36,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540342960] [2025-03-17 01:49:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540342960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:37,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:37,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:49:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797042567] [2025-03-17 01:49:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:37,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:49:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:37,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:49:37,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:49:37,478 INFO L87 Difference]: Start difference. First operand 503 states and 730 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:38,551 INFO L93 Difference]: Finished difference Result 1041 states and 1484 transitions. [2025-03-17 01:49:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:49:38,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 156 [2025-03-17 01:49:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:38,555 INFO L225 Difference]: With dead ends: 1041 [2025-03-17 01:49:38,556 INFO L226 Difference]: Without dead ends: 632 [2025-03-17 01:49:38,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:49:38,558 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:38,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 716 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:49:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-17 01:49:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 521. [2025-03-17 01:49:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 404 states have (on average 1.3787128712871286) internal successors, (557), 406 states have internal predecessors, (557), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:49:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 757 transitions. [2025-03-17 01:49:38,610 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 757 transitions. Word has length 156 [2025-03-17 01:49:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:38,610 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 757 transitions. [2025-03-17 01:49:38,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 757 transitions. [2025-03-17 01:49:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 01:49:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:38,612 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:49:38,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -858139253, now seen corresponding path program 1 times [2025-03-17 01:49:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857147582] [2025-03-17 01:49:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:38,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 01:49:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 01:49:38,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:38,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857147582] [2025-03-17 01:49:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857147582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:49:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315901290] [2025-03-17 01:49:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:38,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:49:38,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:38,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:49:38,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:49:38,941 INFO L87 Difference]: Start difference. First operand 521 states and 757 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 01:49:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:39,159 INFO L93 Difference]: Finished difference Result 975 states and 1415 transitions. [2025-03-17 01:49:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:49:39,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 156 [2025-03-17 01:49:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:39,162 INFO L225 Difference]: With dead ends: 975 [2025-03-17 01:49:39,162 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 01:49:39,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:49:39,164 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 124 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:39,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 434 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:49:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 01:49:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 513. [2025-03-17 01:49:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.371212121212121) internal successors, (543), 398 states have internal predecessors, (543), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:49:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 743 transitions. [2025-03-17 01:49:39,212 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 743 transitions. Word has length 156 [2025-03-17 01:49:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:39,213 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 743 transitions. [2025-03-17 01:49:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 01:49:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 743 transitions. [2025-03-17 01:49:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 01:49:39,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:39,215 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:39,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:49:39,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash 265464610, now seen corresponding path program 1 times [2025-03-17 01:49:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603512618] [2025-03-17 01:49:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:39,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:39,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:39,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:39,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603512618] [2025-03-17 01:49:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603512618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:39,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:39,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:49:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186036601] [2025-03-17 01:49:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:39,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:49:39,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:39,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:49:39,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:49:39,410 INFO L87 Difference]: Start difference. First operand 513 states and 743 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:39,730 INFO L93 Difference]: Finished difference Result 1133 states and 1592 transitions. [2025-03-17 01:49:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:49:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 157 [2025-03-17 01:49:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:39,734 INFO L225 Difference]: With dead ends: 1133 [2025-03-17 01:49:39,734 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 01:49:39,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:49:39,735 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 202 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:39,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 225 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:49:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 01:49:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 426. [2025-03-17 01:49:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 313 states have (on average 1.3322683706070289) internal successors, (417), 313 states have internal predecessors, (417), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:49:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 609 transitions. [2025-03-17 01:49:39,782 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 609 transitions. Word has length 157 [2025-03-17 01:49:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:39,783 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 609 transitions. [2025-03-17 01:49:39,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 01:49:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 609 transitions. [2025-03-17 01:49:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 01:49:39,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:39,784 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:39,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:49:39,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:39,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:39,784 INFO L85 PathProgramCache]: Analyzing trace with hash 294093761, now seen corresponding path program 1 times [2025-03-17 01:49:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045656050] [2025-03-17 01:49:39,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:39,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:39,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:39,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 01:49:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045656050] [2025-03-17 01:49:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045656050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:49:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112022053] [2025-03-17 01:49:40,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:49:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:49:40,075 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 01:49:40,075 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 01:49:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:40,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:40,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:40,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:40,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 01:49:40,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:49:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 680 proven. 72 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 01:49:40,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:49:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 60 proven. 75 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-17 01:49:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112022053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:49:41,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:49:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2025-03-17 01:49:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161364112] [2025-03-17 01:49:41,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:49:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 01:49:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:41,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 01:49:41,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-03-17 01:49:41,361 INFO L87 Difference]: Start difference. First operand 426 states and 609 transitions. Second operand has 27 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 10 states have call successors, (66), 4 states have call predecessors, (66), 8 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-17 01:49:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:44,512 INFO L93 Difference]: Finished difference Result 2755 states and 3739 transitions. [2025-03-17 01:49:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-17 01:49:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 10 states have call successors, (66), 4 states have call predecessors, (66), 8 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) Word has length 157 [2025-03-17 01:49:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:44,523 INFO L225 Difference]: With dead ends: 2755 [2025-03-17 01:49:44,523 INFO L226 Difference]: Without dead ends: 2359 [2025-03-17 01:49:44,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4423 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2625, Invalid=10257, Unknown=0, NotChecked=0, Total=12882 [2025-03-17 01:49:44,527 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1453 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:44,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1240 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 01:49:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2025-03-17 01:49:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1303. [2025-03-17 01:49:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 902 states have (on average 1.229490022172949) internal successors, (1109), 907 states have internal predecessors, (1109), 314 states have call successors, (314), 86 states have call predecessors, (314), 86 states have return successors, (314), 309 states have call predecessors, (314), 314 states have call successors, (314) [2025-03-17 01:49:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1737 transitions. [2025-03-17 01:49:44,739 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1737 transitions. Word has length 157 [2025-03-17 01:49:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1737 transitions. [2025-03-17 01:49:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 10 states have call successors, (66), 4 states have call predecessors, (66), 8 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-17 01:49:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1737 transitions. [2025-03-17 01:49:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 01:49:44,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:44,741 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:44,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:49:44,942 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,SelfDestructingSolverStorable13 [2025-03-17 01:49:44,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:44,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 952241246, now seen corresponding path program 1 times [2025-03-17 01:49:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232909524] [2025-03-17 01:49:44,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:44,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:44,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:44,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:46,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:46,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232909524] [2025-03-17 01:49:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232909524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:46,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:46,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:49:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591212991] [2025-03-17 01:49:46,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:46,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:49:46,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:46,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:49:46,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:49:46,604 INFO L87 Difference]: Start difference. First operand 1303 states and 1737 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:47,531 INFO L93 Difference]: Finished difference Result 2714 states and 3587 transitions. [2025-03-17 01:49:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:49:47,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-03-17 01:49:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:47,537 INFO L225 Difference]: With dead ends: 2714 [2025-03-17 01:49:47,537 INFO L226 Difference]: Without dead ends: 1478 [2025-03-17 01:49:47,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:49:47,541 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 239 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:47,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 467 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:49:47,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-03-17 01:49:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1308. [2025-03-17 01:49:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 907 states have (on average 1.224917309812569) internal successors, (1111), 912 states have internal predecessors, (1111), 314 states have call successors, (314), 86 states have call predecessors, (314), 86 states have return successors, (314), 309 states have call predecessors, (314), 314 states have call successors, (314) [2025-03-17 01:49:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1739 transitions. [2025-03-17 01:49:47,744 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1739 transitions. Word has length 157 [2025-03-17 01:49:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1739 transitions. [2025-03-17 01:49:47,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1739 transitions. [2025-03-17 01:49:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 01:49:47,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:47,745 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:47,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:49:47,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash 952271037, now seen corresponding path program 1 times [2025-03-17 01:49:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288395047] [2025-03-17 01:49:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:47,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:47,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:47,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:49:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 01:49:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:49:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288395047] [2025-03-17 01:49:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288395047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:49:50,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:49:50,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:49:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477453142] [2025-03-17 01:49:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:49:50,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:49:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:49:50,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:49:50,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:49:50,436 INFO L87 Difference]: Start difference. First operand 1308 states and 1739 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:49:51,557 INFO L93 Difference]: Finished difference Result 1478 states and 1936 transitions. [2025-03-17 01:49:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:49:51,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-03-17 01:49:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:49:51,563 INFO L225 Difference]: With dead ends: 1478 [2025-03-17 01:49:51,563 INFO L226 Difference]: Without dead ends: 1476 [2025-03-17 01:49:51,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:49:51,564 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 237 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:49:51,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 503 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:49:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-03-17 01:49:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1308. [2025-03-17 01:49:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 907 states have (on average 1.224917309812569) internal successors, (1111), 912 states have internal predecessors, (1111), 314 states have call successors, (314), 86 states have call predecessors, (314), 86 states have return successors, (314), 309 states have call predecessors, (314), 314 states have call successors, (314) [2025-03-17 01:49:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1739 transitions. [2025-03-17 01:49:51,779 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1739 transitions. Word has length 157 [2025-03-17 01:49:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:49:51,779 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1739 transitions. [2025-03-17 01:49:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 01:49:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1739 transitions. [2025-03-17 01:49:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 01:49:51,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:49:51,780 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:49:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:49:51,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:49:51,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:49:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1668757467, now seen corresponding path program 1 times [2025-03-17 01:49:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:49:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769659125] [2025-03-17 01:49:51,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:49:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:49:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 01:49:51,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 01:49:51,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:49:51,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat