./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-pe-ci_file-52.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 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:41:31,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:41:31,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:41:31,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:41:31,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:41:31,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:41:31,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:41:31,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:41:31,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:41:31,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:41:31,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:41:31,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:41:31,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:41:31,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:41:31,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:41:31,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:41:31,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:41:31,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:41:31,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:41:31,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:41:31,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:41:31,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:41:31,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:41:31,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:41:31,606 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 -> 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b [2025-03-08 11:41:31,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:41:31,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:41:31,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:41:31,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:41:31,828 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:41:31,829 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-pe-ci_file-52.i [2025-03-08 11:41:32,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fb620f4/6161d65b6b4243ee8572528ea058d60c/FLAGedc334805 [2025-03-08 11:41:33,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:41:33,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-03-08 11:41:33,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fb620f4/6161d65b6b4243ee8572528ea058d60c/FLAGedc334805 [2025-03-08 11:41:33,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63fb620f4/6161d65b6b4243ee8572528ea058d60c [2025-03-08 11:41:33,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:41:33,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:41:33,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:41:33,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:41:33,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:41:33,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33, skipping insertion in model container [2025-03-08 11:41:33,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:41:33,643 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-pe-ci_file-52.i[919,932] [2025-03-08 11:41:33,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:41:33,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:41:33,714 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-pe-ci_file-52.i[919,932] [2025-03-08 11:41:33,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:41:33,758 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:41:33,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33 WrapperNode [2025-03-08 11:41:33,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:41:33,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:41:33,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:41:33,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:41:33,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,791 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-08 11:41:33,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:41:33,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:41:33,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:41:33,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:41:33,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,822 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-08 11:41:33,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:41:33,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:41:33,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:41:33,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:41:33,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (1/1) ... [2025-03-08 11:41:33,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:41:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:41:33,862 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-08 11:41:33,867 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-08 11:41:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:41:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:41:33,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:41:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:41:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:41:33,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:41:33,942 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:41:33,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:41:34,286 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 11:41:34,286 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:41:34,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:41:34,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:41:34,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:41:34 BoogieIcfgContainer [2025-03-08 11:41:34,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:41:34,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:41:34,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:41:34,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:41:34,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:41:33" (1/3) ... [2025-03-08 11:41:34,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c88e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:41:34, skipping insertion in model container [2025-03-08 11:41:34,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:41:33" (2/3) ... [2025-03-08 11:41:34,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c88e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:41:34, skipping insertion in model container [2025-03-08 11:41:34,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:41:34" (3/3) ... [2025-03-08 11:41:34,310 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-03-08 11:41:34,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:41:34,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:41:34,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:41:34,371 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;@2e64d862, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:41:34,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:41:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 11:41:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 11:41:34,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:34,384 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:34,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -63178327, now seen corresponding path program 1 times [2025-03-08 11:41:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864747507] [2025-03-08 11:41:34,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:34,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 11:41:34,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 11:41:34,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:34,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 11:41:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864747507] [2025-03-08 11:41:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864747507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:41:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889259455] [2025-03-08 11:41:34,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:34,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:41:34,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:41:34,605 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-08 11:41:34,606 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-08 11:41:34,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 11:41:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 11:41:34,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:34,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:34,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:41:34,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:41:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 11:41:34,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:41:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889259455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:41:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:41:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179221756] [2025-03-08 11:41:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:41:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:34,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:41:34,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:41:34,785 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 11:41:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:34,806 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-03-08 11:41:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:41:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 125 [2025-03-08 11:41:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:34,812 INFO L225 Difference]: With dead ends: 152 [2025-03-08 11:41:34,813 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 11:41:34,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-08 11:41:34,816 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:34,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:41:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 11:41:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 11:41:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 11:41:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-03-08 11:41:34,849 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 125 [2025-03-08 11:41:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:34,849 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-03-08 11:41:34,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 11:41:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-03-08 11:41:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 11:41:34,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:34,856 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:34,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:41:35,056 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-08 11:41:35,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:35,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1975782004, now seen corresponding path program 1 times [2025-03-08 11:41:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057121973] [2025-03-08 11:41:35,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 11:41:35,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 11:41:35,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:35,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057121973] [2025-03-08 11:41:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057121973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:41:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556084769] [2025-03-08 11:41:35,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:35,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:41:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:35,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:41:35,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:41:35,372 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:35,550 INFO L93 Difference]: Finished difference Result 272 states and 416 transitions. [2025-03-08 11:41:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:41:35,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-08 11:41:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:35,552 INFO L225 Difference]: With dead ends: 272 [2025-03-08 11:41:35,552 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 11:41:35,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:41:35,553 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:35,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 341 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 11:41:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 147. [2025-03-08 11:41:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 110 states have internal predecessors, (158), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:41:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2025-03-08 11:41:35,588 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 125 [2025-03-08 11:41:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:35,609 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2025-03-08 11:41:35,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2025-03-08 11:41:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:35,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:35,610 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:35,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:41:35,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1842580357, now seen corresponding path program 1 times [2025-03-08 11:41:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805521458] [2025-03-08 11:41:35,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:35,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:35,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:35,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:35,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805521458] [2025-03-08 11:41:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805521458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:41:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906952775] [2025-03-08 11:41:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:35,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:41:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:35,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:41:35,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:35,781 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:35,922 INFO L93 Difference]: Finished difference Result 468 states and 720 transitions. [2025-03-08 11:41:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:41:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 11:41:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:35,925 INFO L225 Difference]: With dead ends: 468 [2025-03-08 11:41:35,925 INFO L226 Difference]: Without dead ends: 324 [2025-03-08 11:41:35,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:41:35,926 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 249 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:35,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 417 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-08 11:41:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 285. [2025-03-08 11:41:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 212 states have (on average 1.4245283018867925) internal successors, (302), 212 states have internal predecessors, (302), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:41:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 438 transitions. [2025-03-08 11:41:35,957 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 438 transitions. Word has length 126 [2025-03-08 11:41:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 438 transitions. [2025-03-08 11:41:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 438 transitions. [2025-03-08 11:41:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:35,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:35,959 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:35,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:41:35,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1346141790, now seen corresponding path program 1 times [2025-03-08 11:41:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47862578] [2025-03-08 11:41:35,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:35,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:35,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:35,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47862578] [2025-03-08 11:41:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47862578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:41:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414179965] [2025-03-08 11:41:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:41:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:36,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:41:36,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:41:36,085 INFO L87 Difference]: Start difference. First operand 285 states and 438 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:36,155 INFO L93 Difference]: Finished difference Result 761 states and 1162 transitions. [2025-03-08 11:41:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:41:36,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 11:41:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:36,160 INFO L225 Difference]: With dead ends: 761 [2025-03-08 11:41:36,161 INFO L226 Difference]: Without dead ends: 479 [2025-03-08 11:41:36,162 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-08 11:41:36,163 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 72 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:41:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-08 11:41:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 297. [2025-03-08 11:41:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:41:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 452 transitions. [2025-03-08 11:41:36,214 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 452 transitions. Word has length 126 [2025-03-08 11:41:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:36,215 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 452 transitions. [2025-03-08 11:41:36,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 452 transitions. [2025-03-08 11:41:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:36,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:36,216 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:36,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:41:36,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1207622458, now seen corresponding path program 1 times [2025-03-08 11:41:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621206523] [2025-03-08 11:41:36,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:36,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:36,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:36,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621206523] [2025-03-08 11:41:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621206523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:36,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:36,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:41:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314763389] [2025-03-08 11:41:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:36,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:41:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:36,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:41:36,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:41:36,459 INFO L87 Difference]: Start difference. First operand 297 states and 452 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:36,620 INFO L93 Difference]: Finished difference Result 885 states and 1350 transitions. [2025-03-08 11:41:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:41:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 11:41:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:36,625 INFO L225 Difference]: With dead ends: 885 [2025-03-08 11:41:36,625 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 11:41:36,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:36,628 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 174 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:36,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 401 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 11:41:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 303. [2025-03-08 11:41:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 230 states have (on average 1.4086956521739131) internal successors, (324), 230 states have internal predecessors, (324), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:41:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 460 transitions. [2025-03-08 11:41:36,670 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 460 transitions. Word has length 126 [2025-03-08 11:41:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 460 transitions. [2025-03-08 11:41:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 460 transitions. [2025-03-08 11:41:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:36,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:36,672 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:36,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:41:36,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -29864730, now seen corresponding path program 1 times [2025-03-08 11:41:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665240171] [2025-03-08 11:41:36,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:36,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:36,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:36,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665240171] [2025-03-08 11:41:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665240171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:41:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768905972] [2025-03-08 11:41:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:36,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:41:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:36,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:41:36,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:41:36,752 INFO L87 Difference]: Start difference. First operand 303 states and 460 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:36,821 INFO L93 Difference]: Finished difference Result 883 states and 1338 transitions. [2025-03-08 11:41:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:41:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 11:41:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:36,826 INFO L225 Difference]: With dead ends: 883 [2025-03-08 11:41:36,826 INFO L226 Difference]: Without dead ends: 583 [2025-03-08 11:41:36,829 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-08 11:41:36,829 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 98 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:36,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 308 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:41:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-08 11:41:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 315. [2025-03-08 11:41:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 242 states have internal predecessors, (340), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:41:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 476 transitions. [2025-03-08 11:41:36,872 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 476 transitions. Word has length 126 [2025-03-08 11:41:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:36,872 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 476 transitions. [2025-03-08 11:41:36,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 476 transitions. [2025-03-08 11:41:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:36,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:36,873 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:36,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:41:36,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:36,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1214899751, now seen corresponding path program 1 times [2025-03-08 11:41:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132678709] [2025-03-08 11:41:36,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:36,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:36,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132678709] [2025-03-08 11:41:37,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132678709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:37,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:37,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:41:37,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434587414] [2025-03-08 11:41:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:37,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:41:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:37,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:41:37,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:41:37,491 INFO L87 Difference]: Start difference. First operand 315 states and 476 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:41:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:38,066 INFO L93 Difference]: Finished difference Result 887 states and 1340 transitions. [2025-03-08 11:41:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:41:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2025-03-08 11:41:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:38,069 INFO L225 Difference]: With dead ends: 887 [2025-03-08 11:41:38,069 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 11:41:38,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:41:38,071 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 421 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:38,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 710 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:41:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 11:41:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 415. [2025-03-08 11:41:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 324 states have (on average 1.404320987654321) internal successors, (455), 324 states have internal predecessors, (455), 85 states have call successors, (85), 5 states have call predecessors, (85), 5 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:41:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 625 transitions. [2025-03-08 11:41:38,114 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 625 transitions. Word has length 126 [2025-03-08 11:41:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:38,114 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 625 transitions. [2025-03-08 11:41:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:41:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 625 transitions. [2025-03-08 11:41:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:38,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:38,116 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:41:38,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1176602651, now seen corresponding path program 1 times [2025-03-08 11:41:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984574391] [2025-03-08 11:41:38,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:38,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:38,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:38,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:38,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:38,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984574391] [2025-03-08 11:41:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984574391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:41:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214307803] [2025-03-08 11:41:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:41:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:38,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:41:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:41:38,298 INFO L87 Difference]: Start difference. First operand 415 states and 625 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 11:41:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:38,704 INFO L93 Difference]: Finished difference Result 1643 states and 2477 transitions. [2025-03-08 11:41:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:41:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-03-08 11:41:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:38,710 INFO L225 Difference]: With dead ends: 1643 [2025-03-08 11:41:38,710 INFO L226 Difference]: Without dead ends: 1331 [2025-03-08 11:41:38,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:41:38,711 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 828 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:38,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 972 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:41:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-03-08 11:41:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 975. [2025-03-08 11:41:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 812 states have (on average 1.4470443349753694) internal successors, (1175), 812 states have internal predecessors, (1175), 153 states have call successors, (153), 9 states have call predecessors, (153), 9 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 11:41:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1481 transitions. [2025-03-08 11:41:38,778 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1481 transitions. Word has length 126 [2025-03-08 11:41:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:38,779 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1481 transitions. [2025-03-08 11:41:38,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 11:41:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1481 transitions. [2025-03-08 11:41:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 11:41:38,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:38,780 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:38,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:41:38,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:38,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1245919558, now seen corresponding path program 1 times [2025-03-08 11:41:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736567519] [2025-03-08 11:41:38,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:38,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 11:41:38,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 11:41:38,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:38,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736567519] [2025-03-08 11:41:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736567519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:38,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:41:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123149688] [2025-03-08 11:41:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:41:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:38,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:41:38,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:38,880 INFO L87 Difference]: Start difference. First operand 975 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:39,012 INFO L93 Difference]: Finished difference Result 1275 states and 1934 transitions. [2025-03-08 11:41:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:41:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 11:41:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:39,016 INFO L225 Difference]: With dead ends: 1275 [2025-03-08 11:41:39,016 INFO L226 Difference]: Without dead ends: 403 [2025-03-08 11:41:39,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:41:39,019 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:39,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 168 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-08 11:41:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 261. [2025-03-08 11:41:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 206 states have internal predecessors, (284), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:41:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-03-08 11:41:39,041 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 126 [2025-03-08 11:41:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:39,042 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-03-08 11:41:39,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-03-08 11:41:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 11:41:39,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:39,043 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:39,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:41:39,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:39,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1973540888, now seen corresponding path program 1 times [2025-03-08 11:41:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229130426] [2025-03-08 11:41:39,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:39,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 11:41:39,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 11:41:39,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:39,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229130426] [2025-03-08 11:41:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229130426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:41:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364238291] [2025-03-08 11:41:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:39,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:41:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:39,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:41:39,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:39,364 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:39,537 INFO L93 Difference]: Finished difference Result 570 states and 828 transitions. [2025-03-08 11:41:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:41:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-03-08 11:41:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:39,540 INFO L225 Difference]: With dead ends: 570 [2025-03-08 11:41:39,540 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 11:41:39,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:41:39,541 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 167 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:39,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 292 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 11:41:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 328. [2025-03-08 11:41:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 270 states have (on average 1.3703703703703705) internal successors, (370), 270 states have internal predecessors, (370), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:41:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 472 transitions. [2025-03-08 11:41:39,572 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 472 transitions. Word has length 127 [2025-03-08 11:41:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 472 transitions. [2025-03-08 11:41:39,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 472 transitions. [2025-03-08 11:41:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 11:41:39,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:39,575 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:39,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:41:39,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:39,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 914231082, now seen corresponding path program 1 times [2025-03-08 11:41:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739107107] [2025-03-08 11:41:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:39,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 11:41:39,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 11:41:39,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:39,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739107107] [2025-03-08 11:41:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739107107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:41:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394531822] [2025-03-08 11:41:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:41:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:39,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:41:39,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:39,914 INFO L87 Difference]: Start difference. First operand 328 states and 472 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:40,052 INFO L93 Difference]: Finished difference Result 671 states and 969 transitions. [2025-03-08 11:41:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:41:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-08 11:41:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:40,055 INFO L225 Difference]: With dead ends: 671 [2025-03-08 11:41:40,055 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 11:41:40,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:40,056 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 164 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:40,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 11:41:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 353. [2025-03-08 11:41:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 295 states have (on average 1.3559322033898304) internal successors, (400), 295 states have internal predecessors, (400), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:41:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 502 transitions. [2025-03-08 11:41:40,081 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 502 transitions. Word has length 128 [2025-03-08 11:41:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 502 transitions. [2025-03-08 11:41:40,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 502 transitions. [2025-03-08 11:41:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 11:41:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:40,083 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:41:40,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1565731675, now seen corresponding path program 1 times [2025-03-08 11:41:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626067242] [2025-03-08 11:41:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 11:41:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 11:41:40,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626067242] [2025-03-08 11:41:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626067242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:41,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:41:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235457959] [2025-03-08 11:41:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:41:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:41,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:41:41,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:41:41,043 INFO L87 Difference]: Start difference. First operand 353 states and 502 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:42,020 INFO L93 Difference]: Finished difference Result 570 states and 809 transitions. [2025-03-08 11:41:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:41:42,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2025-03-08 11:41:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:42,022 INFO L225 Difference]: With dead ends: 570 [2025-03-08 11:41:42,022 INFO L226 Difference]: Without dead ends: 435 [2025-03-08 11:41:42,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:41:42,023 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 343 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:42,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 828 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:41:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-08 11:41:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 383. [2025-03-08 11:41:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 320 states have (on average 1.35625) internal successors, (434), 321 states have internal predecessors, (434), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 11:41:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 544 transitions. [2025-03-08 11:41:42,046 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 544 transitions. Word has length 128 [2025-03-08 11:41:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:42,047 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 544 transitions. [2025-03-08 11:41:42,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 544 transitions. [2025-03-08 11:41:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 11:41:42,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:42,048 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:42,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:41:42,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:42,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1859134682, now seen corresponding path program 1 times [2025-03-08 11:41:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022813094] [2025-03-08 11:41:42,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:42,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 11:41:42,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 11:41:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022813094] [2025-03-08 11:41:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022813094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:42,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:41:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543475494] [2025-03-08 11:41:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:42,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:41:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:42,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:41:42,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:41:42,545 INFO L87 Difference]: Start difference. First operand 383 states and 544 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:41:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:43,061 INFO L93 Difference]: Finished difference Result 563 states and 800 transitions. [2025-03-08 11:41:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:41:43,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2025-03-08 11:41:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:43,064 INFO L225 Difference]: With dead ends: 563 [2025-03-08 11:41:43,064 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 11:41:43,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:41:43,065 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 307 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:43,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 652 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:41:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 11:41:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 333. [2025-03-08 11:41:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 275 states have (on average 1.3527272727272728) internal successors, (372), 275 states have internal predecessors, (372), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:41:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 474 transitions. [2025-03-08 11:41:43,085 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 474 transitions. Word has length 128 [2025-03-08 11:41:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:43,085 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 474 transitions. [2025-03-08 11:41:43,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:41:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 474 transitions. [2025-03-08 11:41:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 11:41:43,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:43,086 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:43,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:41:43,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash -311117455, now seen corresponding path program 1 times [2025-03-08 11:41:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:43,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310867565] [2025-03-08 11:41:43,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:43,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 11:41:43,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 11:41:43,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:43,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310867565] [2025-03-08 11:41:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310867565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:41:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222087178] [2025-03-08 11:41:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:41:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:41:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:41:43,420 INFO L87 Difference]: Start difference. First operand 333 states and 474 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:43,632 INFO L93 Difference]: Finished difference Result 863 states and 1248 transitions. [2025-03-08 11:41:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:41:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2025-03-08 11:41:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:43,635 INFO L225 Difference]: With dead ends: 863 [2025-03-08 11:41:43,635 INFO L226 Difference]: Without dead ends: 615 [2025-03-08 11:41:43,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:41:43,636 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:43,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 307 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:41:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-08 11:41:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 597. [2025-03-08 11:41:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 501 states have (on average 1.3672654690618762) internal successors, (685), 501 states have internal predecessors, (685), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:41:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 855 transitions. [2025-03-08 11:41:43,666 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 855 transitions. Word has length 129 [2025-03-08 11:41:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:43,667 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 855 transitions. [2025-03-08 11:41:43,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 855 transitions. [2025-03-08 11:41:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 11:41:43,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:43,668 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:43,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:41:43,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash -821651632, now seen corresponding path program 1 times [2025-03-08 11:41:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479322140] [2025-03-08 11:41:43,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:43,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 11:41:43,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 11:41:43,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:43,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479322140] [2025-03-08 11:41:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479322140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:41:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556619534] [2025-03-08 11:41:44,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:44,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:41:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:41:44,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:41:44,500 INFO L87 Difference]: Start difference. First operand 597 states and 855 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:45,229 INFO L93 Difference]: Finished difference Result 1154 states and 1650 transitions. [2025-03-08 11:41:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:41:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-03-08 11:41:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:45,233 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 11:41:45,233 INFO L226 Difference]: Without dead ends: 661 [2025-03-08 11:41:45,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:41:45,236 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 295 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:45,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 689 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:41:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-08 11:41:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 608. [2025-03-08 11:41:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 512 states have (on average 1.365234375) internal successors, (699), 512 states have internal predecessors, (699), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:41:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2025-03-08 11:41:45,269 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 129 [2025-03-08 11:41:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2025-03-08 11:41:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2025-03-08 11:41:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 11:41:45,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:45,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:45,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:41:45,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash 202001999, now seen corresponding path program 1 times [2025-03-08 11:41:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524159874] [2025-03-08 11:41:45,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 11:41:45,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 11:41:45,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:45,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:56,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524159874] [2025-03-08 11:41:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524159874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:56,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:41:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608595934] [2025-03-08 11:41:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:56,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:41:56,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:56,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:41:56,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:41:56,335 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:57,602 INFO L93 Difference]: Finished difference Result 1153 states and 1650 transitions. [2025-03-08 11:41:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:41:57,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-03-08 11:41:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:57,605 INFO L225 Difference]: With dead ends: 1153 [2025-03-08 11:41:57,606 INFO L226 Difference]: Without dead ends: 609 [2025-03-08 11:41:57,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:41:57,607 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 192 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:57,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 627 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:41:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-08 11:41:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 579. [2025-03-08 11:41:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 483 states have (on average 1.360248447204969) internal successors, (657), 483 states have internal predecessors, (657), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:41:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 827 transitions. [2025-03-08 11:41:57,636 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 827 transitions. Word has length 129 [2025-03-08 11:41:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:57,636 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 827 transitions. [2025-03-08 11:41:57,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:41:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 827 transitions. [2025-03-08 11:41:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 11:41:57,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:57,637 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:57,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 11:41:57,637 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:57,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 246697767, now seen corresponding path program 1 times [2025-03-08 11:41:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22173800] [2025-03-08 11:41:57,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:57,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 11:41:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 11:41:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:57,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:41:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:41:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:41:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22173800] [2025-03-08 11:41:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22173800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:41:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:41:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:41:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70623098] [2025-03-08 11:41:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:41:57,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:41:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:41:57,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:41:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:41:57,986 INFO L87 Difference]: Start difference. First operand 579 states and 827 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:41:58,512 INFO L93 Difference]: Finished difference Result 1220 states and 1762 transitions. [2025-03-08 11:41:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:41:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-08 11:41:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:41:58,517 INFO L225 Difference]: With dead ends: 1220 [2025-03-08 11:41:58,517 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 11:41:58,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:41:58,518 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 252 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:41:58,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 570 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:41:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 11:41:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 611. [2025-03-08 11:41:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 515 states have (on average 1.3689320388349515) internal successors, (705), 515 states have internal predecessors, (705), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:41:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 875 transitions. [2025-03-08 11:41:58,553 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 875 transitions. Word has length 130 [2025-03-08 11:41:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:41:58,553 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 875 transitions. [2025-03-08 11:41:58,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:41:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 875 transitions. [2025-03-08 11:41:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 11:41:58,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:41:58,554 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:41:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 11:41:58,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:41:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:41:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash -263836410, now seen corresponding path program 1 times [2025-03-08 11:41:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:41:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712510349] [2025-03-08 11:41:58,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:41:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:41:58,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 11:41:58,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 11:41:58,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:41:58,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712510349] [2025-03-08 11:42:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712510349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:00,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:00,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:42:00,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878056961] [2025-03-08 11:42:00,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:00,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:42:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:00,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:42:00,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:42:00,626 INFO L87 Difference]: Start difference. First operand 611 states and 875 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:03,443 INFO L93 Difference]: Finished difference Result 953 states and 1360 transitions. [2025-03-08 11:42:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:42:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2025-03-08 11:42:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:03,446 INFO L225 Difference]: With dead ends: 953 [2025-03-08 11:42:03,446 INFO L226 Difference]: Without dead ends: 677 [2025-03-08 11:42:03,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:42:03,448 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 534 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:03,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 591 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:42:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-08 11:42:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 610. [2025-03-08 11:42:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 514 states have (on average 1.367704280155642) internal successors, (703), 514 states have internal predecessors, (703), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 873 transitions. [2025-03-08 11:42:03,484 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 873 transitions. Word has length 130 [2025-03-08 11:42:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 873 transitions. [2025-03-08 11:42:03,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 873 transitions. [2025-03-08 11:42:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 11:42:03,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:03,485 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 11:42:03,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:03,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash -396714770, now seen corresponding path program 1 times [2025-03-08 11:42:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442595595] [2025-03-08 11:42:03,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 11:42:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 11:42:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442595595] [2025-03-08 11:42:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442595595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:04,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:42:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309177670] [2025-03-08 11:42:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:04,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:42:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:04,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:42:04,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:42:04,345 INFO L87 Difference]: Start difference. First operand 610 states and 873 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:05,082 INFO L93 Difference]: Finished difference Result 1151 states and 1652 transitions. [2025-03-08 11:42:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:42:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2025-03-08 11:42:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:05,085 INFO L225 Difference]: With dead ends: 1151 [2025-03-08 11:42:05,085 INFO L226 Difference]: Without dead ends: 624 [2025-03-08 11:42:05,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:42:05,087 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 272 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:05,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 820 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:42:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-08 11:42:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 608. [2025-03-08 11:42:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 512 states have (on average 1.365234375) internal successors, (699), 512 states have internal predecessors, (699), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2025-03-08 11:42:05,139 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 130 [2025-03-08 11:42:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2025-03-08 11:42:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2025-03-08 11:42:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 11:42:05,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:05,141 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:05,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 11:42:05,141 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:05,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash -284312072, now seen corresponding path program 1 times [2025-03-08 11:42:05,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:05,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138061910] [2025-03-08 11:42:05,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 11:42:05,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 11:42:05,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138061910] [2025-03-08 11:42:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138061910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:05,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:42:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632213015] [2025-03-08 11:42:05,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:05,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:42:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:42:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:42:05,838 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:42:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:06,373 INFO L93 Difference]: Finished difference Result 917 states and 1310 transitions. [2025-03-08 11:42:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:42:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-03-08 11:42:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:06,378 INFO L225 Difference]: With dead ends: 917 [2025-03-08 11:42:06,378 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 11:42:06,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:42:06,379 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 358 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:06,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 463 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:42:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 11:42:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 607. [2025-03-08 11:42:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 511 states have (on average 1.3639921722113504) internal successors, (697), 511 states have internal predecessors, (697), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 867 transitions. [2025-03-08 11:42:06,417 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 867 transitions. Word has length 131 [2025-03-08 11:42:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:06,418 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 867 transitions. [2025-03-08 11:42:06,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:42:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 867 transitions. [2025-03-08 11:42:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 11:42:06,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:06,419 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 11:42:06,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:06,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash -449539831, now seen corresponding path program 1 times [2025-03-08 11:42:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414088223] [2025-03-08 11:42:06,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 11:42:06,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 11:42:06,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414088223] [2025-03-08 11:42:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414088223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:08,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:08,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:42:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648913567] [2025-03-08 11:42:08,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:42:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:08,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:42:08,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:42:08,551 INFO L87 Difference]: Start difference. First operand 607 states and 867 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:42:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:09,974 INFO L93 Difference]: Finished difference Result 1174 states and 1681 transitions. [2025-03-08 11:42:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:42:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-03-08 11:42:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:09,977 INFO L225 Difference]: With dead ends: 1174 [2025-03-08 11:42:09,978 INFO L226 Difference]: Without dead ends: 653 [2025-03-08 11:42:09,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:42:09,980 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 708 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:09,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 503 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:42:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-08 11:42:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 615. [2025-03-08 11:42:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 519 states have (on average 1.3622350674373795) internal successors, (707), 519 states have internal predecessors, (707), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 877 transitions. [2025-03-08 11:42:10,019 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 877 transitions. Word has length 131 [2025-03-08 11:42:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 877 transitions. [2025-03-08 11:42:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 11:42:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 877 transitions. [2025-03-08 11:42:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 11:42:10,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:10,020 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:10,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 11:42:10,021 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:10,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash -960074008, now seen corresponding path program 1 times [2025-03-08 11:42:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82589342] [2025-03-08 11:42:10,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 11:42:10,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 11:42:10,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:10,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82589342] [2025-03-08 11:42:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82589342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:22,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:22,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 11:42:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069232658] [2025-03-08 11:42:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:22,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 11:42:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:22,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 11:42:22,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:42:22,350 INFO L87 Difference]: Start difference. First operand 615 states and 877 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 11:42:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:26,998 INFO L93 Difference]: Finished difference Result 718 states and 1012 transitions. [2025-03-08 11:42:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:42:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 131 [2025-03-08 11:42:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:27,003 INFO L225 Difference]: With dead ends: 718 [2025-03-08 11:42:27,003 INFO L226 Difference]: Without dead ends: 716 [2025-03-08 11:42:27,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 11:42:27,005 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1025 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:27,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 627 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:42:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-08 11:42:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 631. [2025-03-08 11:42:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 535 states have (on average 1.360747663551402) internal successors, (728), 535 states have internal predecessors, (728), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 898 transitions. [2025-03-08 11:42:27,097 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 898 transitions. Word has length 131 [2025-03-08 11:42:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:27,097 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 898 transitions. [2025-03-08 11:42:27,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 11:42:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 898 transitions. [2025-03-08 11:42:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 11:42:27,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:27,099 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:27,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 11:42:27,099 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1056632341, now seen corresponding path program 1 times [2025-03-08 11:42:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115522497] [2025-03-08 11:42:27,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:27,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 11:42:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 11:42:27,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115522497] [2025-03-08 11:42:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115522497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:42:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218840839] [2025-03-08 11:42:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:42:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:31,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:42:31,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:42:31,320 INFO L87 Difference]: Start difference. First operand 631 states and 898 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:32,784 INFO L93 Difference]: Finished difference Result 707 states and 995 transitions. [2025-03-08 11:42:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:42:32,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 131 [2025-03-08 11:42:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:32,788 INFO L225 Difference]: With dead ends: 707 [2025-03-08 11:42:32,788 INFO L226 Difference]: Without dead ends: 705 [2025-03-08 11:42:32,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-03-08 11:42:32,789 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 442 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:32,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 760 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:42:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-08 11:42:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 635. [2025-03-08 11:42:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 539 states have (on average 1.3617810760667903) internal successors, (734), 539 states have internal predecessors, (734), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 904 transitions. [2025-03-08 11:42:32,836 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 904 transitions. Word has length 131 [2025-03-08 11:42:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:32,836 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 904 transitions. [2025-03-08 11:42:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 11:42:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 904 transitions. [2025-03-08 11:42:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:42:32,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:32,838 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 11:42:32,838 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:32,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:32,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1260023489, now seen corresponding path program 1 times [2025-03-08 11:42:32,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:32,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400769755] [2025-03-08 11:42:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:42:32,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:42:32,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400769755] [2025-03-08 11:42:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400769755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:42:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413411249] [2025-03-08 11:42:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:32,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:42:32,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:32,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:42:32,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:42:32,992 INFO L87 Difference]: Start difference. First operand 635 states and 904 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:33,240 INFO L93 Difference]: Finished difference Result 1530 states and 2206 transitions. [2025-03-08 11:42:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:42:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-08 11:42:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:33,244 INFO L225 Difference]: With dead ends: 1530 [2025-03-08 11:42:33,245 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 11:42:33,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:42:33,247 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 246 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:33,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 627 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:42:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 11:42:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 657. [2025-03-08 11:42:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 561 states have (on average 1.35650623885918) internal successors, (761), 561 states have internal predecessors, (761), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 11:42:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 931 transitions. [2025-03-08 11:42:33,289 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 931 transitions. Word has length 132 [2025-03-08 11:42:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:33,290 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 931 transitions. [2025-03-08 11:42:33,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 931 transitions. [2025-03-08 11:42:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:42:33,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:33,291 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:33,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 11:42:33,291 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:33,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1770557666, now seen corresponding path program 1 times [2025-03-08 11:42:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:33,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833086028] [2025-03-08 11:42:33,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:42:33,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:42:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833086028] [2025-03-08 11:42:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833086028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:39,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:39,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:42:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470944598] [2025-03-08 11:42:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:42:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:39,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:42:39,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:42:39,445 INFO L87 Difference]: Start difference. First operand 657 states and 931 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:41,221 INFO L93 Difference]: Finished difference Result 1037 states and 1456 transitions. [2025-03-08 11:42:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:42:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-08 11:42:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:41,224 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 11:42:41,224 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 11:42:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2025-03-08 11:42:41,225 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 371 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:41,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 372 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:42:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 11:42:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 341. [2025-03-08 11:42:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.2720848056537102) internal successors, (360), 283 states have internal predecessors, (360), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:42:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2025-03-08 11:42:41,251 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 132 [2025-03-08 11:42:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:41,251 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2025-03-08 11:42:41,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2025-03-08 11:42:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:42:41,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:41,252 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:41,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 11:42:41,252 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash -392841130, now seen corresponding path program 1 times [2025-03-08 11:42:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389665744] [2025-03-08 11:42:41,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:41,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:42:41,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:42:41,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:41,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:42:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 11:42:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:42:47,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389665744] [2025-03-08 11:42:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389665744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:42:47,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:42:47,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:42:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988459796] [2025-03-08 11:42:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:42:47,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:42:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:42:47,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:42:47,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:42:47,575 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:42:50,826 INFO L93 Difference]: Finished difference Result 506 states and 685 transitions. [2025-03-08 11:42:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 11:42:50,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-08 11:42:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:42:50,829 INFO L225 Difference]: With dead ends: 506 [2025-03-08 11:42:50,829 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 11:42:50,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=437, Invalid=1369, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 11:42:50,829 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 747 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:42:50,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 515 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:42:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 11:42:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 355. [2025-03-08 11:42:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 297 states have (on average 1.2861952861952861) internal successors, (382), 297 states have internal predecessors, (382), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:42:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 484 transitions. [2025-03-08 11:42:50,858 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 484 transitions. Word has length 132 [2025-03-08 11:42:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:42:50,858 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 484 transitions. [2025-03-08 11:42:50,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 11:42:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 484 transitions. [2025-03-08 11:42:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:42:50,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:42:50,859 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:42:50,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 11:42:50,859 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:42:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:42:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1777547871, now seen corresponding path program 1 times [2025-03-08 11:42:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:42:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754080399] [2025-03-08 11:42:50,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:42:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:42:50,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:42:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:42:50,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:42:50,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat