./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.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 d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:31:51,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:31:51,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:31:51,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:31:51,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:31:51,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:31:51,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:31:51,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:31:51,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:31:51,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:31:51,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:31:51,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:31:51,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:31:51,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:31:51,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:31:51,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:31:51,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:31:51,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:31:51,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:31:51,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:31:51,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:31:51,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:31:51,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:31:51,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:31:51,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:31:51,445 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 -> d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 [2025-03-03 21:31:51,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:31:51,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:31:51,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:31:51,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:31:51,655 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:31:51,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-03 21:31:52,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff436f52/5b4fdf17a73a45c590f069546e6bc64f/FLAG977e9cacf [2025-03-03 21:31:53,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:31:53,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-03 21:31:53,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff436f52/5b4fdf17a73a45c590f069546e6bc64f/FLAG977e9cacf [2025-03-03 21:31:53,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff436f52/5b4fdf17a73a45c590f069546e6bc64f [2025-03-03 21:31:53,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:31:53,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:31:53,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:53,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:31:53,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:31:53,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f14716e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53, skipping insertion in model container [2025-03-03 21:31:53,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:31:53,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i[919,932] [2025-03-03 21:31:53,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:53,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:31:53,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i[919,932] [2025-03-03 21:31:53,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:53,648 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:31:53,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53 WrapperNode [2025-03-03 21:31:53,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:53,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:53,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:31:53,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:31:53,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,706 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-03-03 21:31:53,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:53,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:31:53,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:31:53,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:31:53,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,739 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:31:53,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:31:53,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:31:53,772 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:31:53,772 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:31:53,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (1/1) ... [2025-03-03 21:31:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:31:53,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:53,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:31:53,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:31:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:31:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:31:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:31:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:31:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:31:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:31:53,881 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:31:53,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:31:54,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-03-03 21:31:54,269 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:31:54,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:31:54,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:31:54,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:31:54,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:54 BoogieIcfgContainer [2025-03-03 21:31:54,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:31:54,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:31:54,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:31:54,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:31:54,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:31:53" (1/3) ... [2025-03-03 21:31:54,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e062e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:54, skipping insertion in model container [2025-03-03 21:31:54,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:53" (2/3) ... [2025-03-03 21:31:54,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e062e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:54, skipping insertion in model container [2025-03-03 21:31:54,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:54" (3/3) ... [2025-03-03 21:31:54,298 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-03 21:31:54,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:31:54,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:31:54,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:31:54,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;@91a7e82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:31:54,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:31:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:31:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:31:54,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:54,388 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:31:54,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:54,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1509120945, now seen corresponding path program 1 times [2025-03-03 21:31:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:54,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771269793] [2025-03-03 21:31:54,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:54,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:31:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:31:54,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:54,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:31:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771269793] [2025-03-03 21:31:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771269793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529556955] [2025-03-03 21:31:54,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:54,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:31:54,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:31:54,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:31:54,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:31:54,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:54,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:31:54,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:31:54,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:31:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529556955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:31:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:31:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769656493] [2025-03-03 21:31:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:54,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:31:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:54,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:31:54,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:31:54,950 INFO L87 Difference]: Start difference. First operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:31:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:54,981 INFO L93 Difference]: Finished difference Result 254 states and 459 transitions. [2025-03-03 21:31:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:31:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-03-03 21:31:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:54,987 INFO L225 Difference]: With dead ends: 254 [2025-03-03 21:31:54,988 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 21:31:54,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:31:54,994 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:54,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:31:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 21:31:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 21:31:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:31:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2025-03-03 21:31:55,035 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2025-03-03 21:31:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:55,035 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2025-03-03 21:31:55,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:31:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2025-03-03 21:31:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:31:55,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:55,042 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:31:55,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:31:55,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:31:55,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:55,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1634618571, now seen corresponding path program 1 times [2025-03-03 21:31:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548315256] [2025-03-03 21:31:55,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:55,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:31:55,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:31:55,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:55,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:31:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:58,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548315256] [2025-03-03 21:31:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548315256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 21:31:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654487724] [2025-03-03 21:31:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:31:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:58,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:31:58,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:31:58,906 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:00,694 INFO L93 Difference]: Finished difference Result 628 states and 1002 transitions. [2025-03-03 21:32:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:32:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:00,702 INFO L225 Difference]: With dead ends: 628 [2025-03-03 21:32:00,703 INFO L226 Difference]: Without dead ends: 504 [2025-03-03 21:32:00,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:32:00,707 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1237 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:00,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1142 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:32:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-03 21:32:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 247. [2025-03-03 21:32:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 148 states have internal predecessors, (207), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:32:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 399 transitions. [2025-03-03 21:32:00,752 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 399 transitions. Word has length 295 [2025-03-03 21:32:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 399 transitions. [2025-03-03 21:32:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 399 transitions. [2025-03-03 21:32:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:00,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:00,756 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:32:00,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1307039028, now seen corresponding path program 1 times [2025-03-03 21:32:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356174497] [2025-03-03 21:32:00,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:00,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:00,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:00,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:00,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:11,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356174497] [2025-03-03 21:32:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356174497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:11,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:32:11,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565546430] [2025-03-03 21:32:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:11,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:32:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:11,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:32:11,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:32:11,641 INFO L87 Difference]: Start difference. First operand 247 states and 399 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:14,350 INFO L93 Difference]: Finished difference Result 606 states and 973 transitions. [2025-03-03 21:32:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:32:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:14,354 INFO L225 Difference]: With dead ends: 606 [2025-03-03 21:32:14,354 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 21:32:14,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:32:14,358 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1013 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:14,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1024 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:32:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 21:32:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 305. [2025-03-03 21:32:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 206 states have (on average 1.4854368932038835) internal successors, (306), 206 states have internal predecessors, (306), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:32:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 498 transitions. [2025-03-03 21:32:14,403 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 498 transitions. Word has length 295 [2025-03-03 21:32:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:14,404 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 498 transitions. [2025-03-03 21:32:14,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 498 transitions. [2025-03-03 21:32:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:14,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:14,408 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:14,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:32:14,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:14,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1812597653, now seen corresponding path program 1 times [2025-03-03 21:32:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586750701] [2025-03-03 21:32:14,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:14,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586750701] [2025-03-03 21:32:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586750701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:32:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538975362] [2025-03-03 21:32:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:32:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:14,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:32:14,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:32:14,651 INFO L87 Difference]: Start difference. First operand 305 states and 498 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:14,716 INFO L93 Difference]: Finished difference Result 517 states and 835 transitions. [2025-03-03 21:32:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:32:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:14,722 INFO L225 Difference]: With dead ends: 517 [2025-03-03 21:32:14,722 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 21:32:14,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:32:14,724 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 72 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:14,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 588 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:32:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 21:32:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-03-03 21:32:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 273 states have (on average 1.4945054945054945) internal successors, (408), 274 states have internal predecessors, (408), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 608 transitions. [2025-03-03 21:32:14,757 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 608 transitions. Word has length 295 [2025-03-03 21:32:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 608 transitions. [2025-03-03 21:32:14,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 608 transitions. [2025-03-03 21:32:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:14,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:14,762 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:14,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:32:14,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 637546218, now seen corresponding path program 1 times [2025-03-03 21:32:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342629734] [2025-03-03 21:32:14,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:14,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:14,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:14,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:14,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342629734] [2025-03-03 21:32:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342629734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:32:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657071502] [2025-03-03 21:32:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:32:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:15,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:32:15,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:32:15,553 INFO L87 Difference]: Start difference. First operand 377 states and 608 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:16,550 INFO L93 Difference]: Finished difference Result 802 states and 1282 transitions. [2025-03-03 21:32:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:32:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-03-03 21:32:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:16,554 INFO L225 Difference]: With dead ends: 802 [2025-03-03 21:32:16,554 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 21:32:16,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:32:16,555 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 641 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:16,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1034 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:32:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 21:32:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 384. [2025-03-03 21:32:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 280 states have (on average 1.4892857142857143) internal successors, (417), 281 states have internal predecessors, (417), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 617 transitions. [2025-03-03 21:32:16,589 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 617 transitions. Word has length 295 [2025-03-03 21:32:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 617 transitions. [2025-03-03 21:32:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 617 transitions. [2025-03-03 21:32:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:16,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:16,594 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:16,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:32:16,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1845969484, now seen corresponding path program 1 times [2025-03-03 21:32:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241809062] [2025-03-03 21:32:16,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:16,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:16,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:16,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:16,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:17,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241809062] [2025-03-03 21:32:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241809062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:17,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:32:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543196912] [2025-03-03 21:32:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:32:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:17,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:32:17,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:32:17,720 INFO L87 Difference]: Start difference. First operand 384 states and 617 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:18,282 INFO L93 Difference]: Finished difference Result 902 states and 1431 transitions. [2025-03-03 21:32:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:32:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:18,286 INFO L225 Difference]: With dead ends: 902 [2025-03-03 21:32:18,286 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 21:32:18,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:32:18,288 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 677 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:18,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 871 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:32:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 21:32:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 392. [2025-03-03 21:32:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 631 transitions. [2025-03-03 21:32:18,329 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 631 transitions. Word has length 295 [2025-03-03 21:32:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:18,330 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 631 transitions. [2025-03-03 21:32:18,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 631 transitions. [2025-03-03 21:32:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:18,335 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:18,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:32:18,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:18,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1095688115, now seen corresponding path program 1 times [2025-03-03 21:32:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309697811] [2025-03-03 21:32:18,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:18,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:18,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:18,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309697811] [2025-03-03 21:32:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309697811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:27,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:27,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:32:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818071142] [2025-03-03 21:32:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:32:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:27,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:32:27,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:32:27,091 INFO L87 Difference]: Start difference. First operand 392 states and 631 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:28,006 INFO L93 Difference]: Finished difference Result 705 states and 1120 transitions. [2025-03-03 21:32:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:32:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:28,009 INFO L225 Difference]: With dead ends: 705 [2025-03-03 21:32:28,009 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 21:32:28,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:32:28,013 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 421 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:28,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 850 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:32:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 21:32:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 387. [2025-03-03 21:32:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 283 states have (on average 1.4911660777385158) internal successors, (422), 284 states have internal predecessors, (422), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 622 transitions. [2025-03-03 21:32:28,039 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 622 transitions. Word has length 295 [2025-03-03 21:32:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:28,039 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 622 transitions. [2025-03-03 21:32:28,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 622 transitions. [2025-03-03 21:32:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:32:28,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:28,041 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:28,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:32:28,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 848897131, now seen corresponding path program 1 times [2025-03-03 21:32:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696085825] [2025-03-03 21:32:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:28,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:32:28,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:32:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:28,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696085825] [2025-03-03 21:32:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696085825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:32:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515217655] [2025-03-03 21:32:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:32:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:28,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:32:28,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:32:28,601 INFO L87 Difference]: Start difference. First operand 387 states and 622 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:29,109 INFO L93 Difference]: Finished difference Result 777 states and 1244 transitions. [2025-03-03 21:32:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:32:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:32:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:29,113 INFO L225 Difference]: With dead ends: 777 [2025-03-03 21:32:29,113 INFO L226 Difference]: Without dead ends: 580 [2025-03-03 21:32:29,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:32:29,114 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 343 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:29,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 800 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:32:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-03 21:32:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 388. [2025-03-03 21:32:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 284 states have (on average 1.4929577464788732) internal successors, (424), 285 states have internal predecessors, (424), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 624 transitions. [2025-03-03 21:32:29,144 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 624 transitions. Word has length 295 [2025-03-03 21:32:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:29,144 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 624 transitions. [2025-03-03 21:32:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 624 transitions. [2025-03-03 21:32:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:29,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:29,146 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:29,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:32:29,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash -890085896, now seen corresponding path program 1 times [2025-03-03 21:32:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:29,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240581655] [2025-03-03 21:32:29,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:29,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:29,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:29,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240581655] [2025-03-03 21:32:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240581655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:32:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132264637] [2025-03-03 21:32:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:32:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:29,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:32:29,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:32:29,878 INFO L87 Difference]: Start difference. First operand 388 states and 624 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:30,950 INFO L93 Difference]: Finished difference Result 800 states and 1266 transitions. [2025-03-03 21:32:30,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:32:30,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:32:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:30,954 INFO L225 Difference]: With dead ends: 800 [2025-03-03 21:32:30,954 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 21:32:30,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:32:30,958 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 297 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:30,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1067 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:32:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 21:32:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2025-03-03 21:32:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 269 states have (on average 1.479553903345725) internal successors, (398), 270 states have internal predecessors, (398), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 598 transitions. [2025-03-03 21:32:30,986 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 598 transitions. Word has length 296 [2025-03-03 21:32:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 598 transitions. [2025-03-03 21:32:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 598 transitions. [2025-03-03 21:32:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:30,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:30,988 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:32:30,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1886654682, now seen corresponding path program 1 times [2025-03-03 21:32:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051047092] [2025-03-03 21:32:30,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:30,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:31,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051047092] [2025-03-03 21:32:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051047092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:37,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:32:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632849614] [2025-03-03 21:32:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:37,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:32:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:37,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:32:37,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:32:37,315 INFO L87 Difference]: Start difference. First operand 373 states and 598 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:41,289 INFO L93 Difference]: Finished difference Result 839 states and 1316 transitions. [2025-03-03 21:32:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 21:32:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 296 [2025-03-03 21:32:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:41,292 INFO L225 Difference]: With dead ends: 839 [2025-03-03 21:32:41,292 INFO L226 Difference]: Without dead ends: 664 [2025-03-03 21:32:41,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:32:41,295 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1009 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:41,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1053 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 21:32:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-03 21:32:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 393. [2025-03-03 21:32:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 289 states have (on average 1.5017301038062283) internal successors, (434), 290 states have internal predecessors, (434), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 634 transitions. [2025-03-03 21:32:41,323 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 634 transitions. Word has length 296 [2025-03-03 21:32:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:41,323 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 634 transitions. [2025-03-03 21:32:41,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 634 transitions. [2025-03-03 21:32:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:41,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:41,325 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:41,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:32:41,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:41,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1381096057, now seen corresponding path program 1 times [2025-03-03 21:32:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:41,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237787570] [2025-03-03 21:32:41,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:41,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:41,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:41,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237787570] [2025-03-03 21:32:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237787570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:32:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23345508] [2025-03-03 21:32:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:32:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:46,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:32:46,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:32:46,373 INFO L87 Difference]: Start difference. First operand 393 states and 634 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:47,918 INFO L93 Difference]: Finished difference Result 770 states and 1218 transitions. [2025-03-03 21:32:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:32:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:32:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:47,922 INFO L225 Difference]: With dead ends: 770 [2025-03-03 21:32:47,922 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 21:32:47,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:32:47,923 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 546 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:47,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1184 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:32:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 21:32:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 424. [2025-03-03 21:32:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 320 states have (on average 1.50625) internal successors, (482), 321 states have internal predecessors, (482), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 682 transitions. [2025-03-03 21:32:47,951 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 682 transitions. Word has length 296 [2025-03-03 21:32:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:47,952 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 682 transitions. [2025-03-03 21:32:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 682 transitions. [2025-03-03 21:32:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:47,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:47,954 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:32:47,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2098005595, now seen corresponding path program 1 times [2025-03-03 21:32:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7284846] [2025-03-03 21:32:47,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:47,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:48,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:48,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:48,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:53,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:53,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7284846] [2025-03-03 21:32:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7284846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:32:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351776017] [2025-03-03 21:32:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:53,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:32:53,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:53,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:32:53,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:32:53,329 INFO L87 Difference]: Start difference. First operand 424 states and 682 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:54,682 INFO L93 Difference]: Finished difference Result 730 states and 1158 transitions. [2025-03-03 21:32:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:32:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:32:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:54,685 INFO L225 Difference]: With dead ends: 730 [2025-03-03 21:32:54,685 INFO L226 Difference]: Without dead ends: 555 [2025-03-03 21:32:54,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:32:54,686 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 399 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:54,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 934 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:32:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-03 21:32:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 421. [2025-03-03 21:32:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 318 states have internal predecessors, (479), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 679 transitions. [2025-03-03 21:32:54,712 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 679 transitions. Word has length 296 [2025-03-03 21:32:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 679 transitions. [2025-03-03 21:32:54,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 679 transitions. [2025-03-03 21:32:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:54,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:54,714 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:32:54,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:54,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1592446970, now seen corresponding path program 1 times [2025-03-03 21:32:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929932214] [2025-03-03 21:32:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:54,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:54,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:54,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929932214] [2025-03-03 21:32:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929932214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:55,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:55,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:32:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873814728] [2025-03-03 21:32:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:32:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:55,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:32:55,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:32:55,338 INFO L87 Difference]: Start difference. First operand 421 states and 679 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:56,021 INFO L93 Difference]: Finished difference Result 714 states and 1134 transitions. [2025-03-03 21:32:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:32:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:32:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:56,024 INFO L225 Difference]: With dead ends: 714 [2025-03-03 21:32:56,024 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 21:32:56,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:32:56,025 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 446 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:56,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 845 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:32:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 21:32:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 402. [2025-03-03 21:32:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 298 states have (on average 1.4966442953020134) internal successors, (446), 299 states have internal predecessors, (446), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:32:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 646 transitions. [2025-03-03 21:32:56,060 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 646 transitions. Word has length 296 [2025-03-03 21:32:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 646 transitions. [2025-03-03 21:32:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 646 transitions. [2025-03-03 21:32:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:56,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:56,062 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:32:56,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 466338232, now seen corresponding path program 1 times [2025-03-03 21:32:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876020290] [2025-03-03 21:32:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:56,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:56,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:56,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:56,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876020290] [2025-03-03 21:32:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876020290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:56,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:32:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944925084] [2025-03-03 21:32:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:56,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:32:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:32:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:32:56,249 INFO L87 Difference]: Start difference. First operand 402 states and 646 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:56,314 INFO L93 Difference]: Finished difference Result 661 states and 1055 transitions. [2025-03-03 21:32:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:32:56,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:32:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:56,317 INFO L225 Difference]: With dead ends: 661 [2025-03-03 21:32:56,317 INFO L226 Difference]: Without dead ends: 480 [2025-03-03 21:32:56,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:32:56,318 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 126 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:56,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 659 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:32:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-03 21:32:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 395. [2025-03-03 21:32:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 294 states have internal predecessors, (445), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:32:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 637 transitions. [2025-03-03 21:32:56,347 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 637 transitions. Word has length 296 [2025-03-03 21:32:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 637 transitions. [2025-03-03 21:32:56,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:32:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 637 transitions. [2025-03-03 21:32:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:56,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:56,349 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:32:56,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -39220393, now seen corresponding path program 1 times [2025-03-03 21:32:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909423645] [2025-03-03 21:32:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:56,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:56,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:56,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:56,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:32:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:32:57,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909423645] [2025-03-03 21:32:57,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909423645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:57,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:32:57,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:32:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239247577] [2025-03-03 21:32:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:57,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:32:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:32:57,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:32:57,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:32:57,494 INFO L87 Difference]: Start difference. First operand 395 states and 637 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:58,765 INFO L93 Difference]: Finished difference Result 802 states and 1258 transitions. [2025-03-03 21:32:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:32:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 296 [2025-03-03 21:32:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:58,768 INFO L225 Difference]: With dead ends: 802 [2025-03-03 21:32:58,768 INFO L226 Difference]: Without dead ends: 630 [2025-03-03 21:32:58,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:32:58,769 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 858 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:58,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1454 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:32:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-03 21:32:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 410. [2025-03-03 21:32:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 309 states have internal predecessors, (469), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:32:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 661 transitions. [2025-03-03 21:32:58,797 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 661 transitions. Word has length 296 [2025-03-03 21:32:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:58,797 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 661 transitions. [2025-03-03 21:32:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:32:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 661 transitions. [2025-03-03 21:32:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:32:58,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:58,799 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:32:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 21:32:58,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:58,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1314089304, now seen corresponding path program 1 times [2025-03-03 21:32:58,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:32:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174302136] [2025-03-03 21:32:58,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:32:58,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:32:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:32:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:33:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174302136] [2025-03-03 21:33:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174302136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:04,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:33:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:33:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114511323] [2025-03-03 21:33:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:04,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:33:04,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:04,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:33:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:33:04,753 INFO L87 Difference]: Start difference. First operand 410 states and 661 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:33:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:05,944 INFO L93 Difference]: Finished difference Result 658 states and 1049 transitions. [2025-03-03 21:33:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:33:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 296 [2025-03-03 21:33:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:05,947 INFO L225 Difference]: With dead ends: 658 [2025-03-03 21:33:05,947 INFO L226 Difference]: Without dead ends: 486 [2025-03-03 21:33:05,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:33:05,948 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 366 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1278 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:33:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-03 21:33:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 407. [2025-03-03 21:33:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 306 states have (on average 1.5196078431372548) internal successors, (465), 306 states have internal predecessors, (465), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:33:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 657 transitions. [2025-03-03 21:33:05,977 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 657 transitions. Word has length 296 [2025-03-03 21:33:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 657 transitions. [2025-03-03 21:33:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:33:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 657 transitions. [2025-03-03 21:33:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:33:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:05,979 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:33:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 21:33:05,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:05,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 172130520, now seen corresponding path program 1 times [2025-03-03 21:33:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537037369] [2025-03-03 21:33:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:33:06,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:33:06,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:06,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:33:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537037369] [2025-03-03 21:33:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537037369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:33:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:33:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492071860] [2025-03-03 21:33:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:33:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:33:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:33:06,438 INFO L87 Difference]: Start difference. First operand 407 states and 657 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:33:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:06,858 INFO L93 Difference]: Finished difference Result 674 states and 1073 transitions. [2025-03-03 21:33:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:33:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:33:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:06,861 INFO L225 Difference]: With dead ends: 674 [2025-03-03 21:33:06,861 INFO L226 Difference]: Without dead ends: 502 [2025-03-03 21:33:06,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:33:06,862 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 232 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:06,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 979 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:33:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-03 21:33:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 418. [2025-03-03 21:33:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 317 states have (on average 1.523659305993691) internal successors, (483), 317 states have internal predecessors, (483), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:33:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 675 transitions. [2025-03-03 21:33:06,890 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 675 transitions. Word has length 296 [2025-03-03 21:33:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 675 transitions. [2025-03-03 21:33:06,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:33:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 675 transitions. [2025-03-03 21:33:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 21:33:06,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:06,892 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:33:06,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 21:33:06,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1525440217, now seen corresponding path program 1 times [2025-03-03 21:33:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690179357] [2025-03-03 21:33:06,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 21:33:06,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 21:33:06,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:06,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:33:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:33:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:33:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690179357] [2025-03-03 21:33:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690179357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:33:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:33:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:33:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629346136] [2025-03-03 21:33:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:33:14,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:33:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:33:14,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:33:14,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:33:14,620 INFO L87 Difference]: Start difference. First operand 418 states and 675 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:33:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:33:15,510 INFO L93 Difference]: Finished difference Result 849 states and 1364 transitions. [2025-03-03 21:33:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:33:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-03 21:33:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:33:15,515 INFO L225 Difference]: With dead ends: 849 [2025-03-03 21:33:15,515 INFO L226 Difference]: Without dead ends: 677 [2025-03-03 21:33:15,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:33:15,516 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 433 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:33:15,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1199 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:33:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-03 21:33:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 532. [2025-03-03 21:33:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 381 states have (on average 1.4855643044619422) internal successors, (566), 381 states have internal predecessors, (566), 144 states have call successors, (144), 6 states have call predecessors, (144), 6 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 21:33:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 854 transitions. [2025-03-03 21:33:15,557 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 854 transitions. Word has length 296 [2025-03-03 21:33:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:33:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 854 transitions. [2025-03-03 21:33:15,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:33:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 854 transitions. [2025-03-03 21:33:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 21:33:15,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:33:15,559 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:33:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 21:33:15,559 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:33:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:33:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1534512586, now seen corresponding path program 1 times [2025-03-03 21:33:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:33:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180976878] [2025-03-03 21:33:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:33:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:33:15,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 21:33:15,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 21:33:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:33:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat