./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.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 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:03:57,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:03:57,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:03:57,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:03:57,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:03:57,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:03:57,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:03:57,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:03:57,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:03:57,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:03:57,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:03:57,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:03:57,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:03:57,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:03:57,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:03:57,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:03:57,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:03:57,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:03:57,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:03:57,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:03:57,648 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 -> 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 [2025-03-08 15:03:57,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:03:57,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:03:57,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:03:57,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:03:57,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:03:57,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-03-08 15:03:59,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe852cc6/02b0a4ce5a11477d9704dda0201a322a/FLAG124edff12 [2025-03-08 15:03:59,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:03:59,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-03-08 15:03:59,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe852cc6/02b0a4ce5a11477d9704dda0201a322a/FLAG124edff12 [2025-03-08 15:03:59,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe852cc6/02b0a4ce5a11477d9704dda0201a322a [2025-03-08 15:03:59,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:03:59,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:03:59,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:03:59,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:03:59,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:03:59,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59, skipping insertion in model container [2025-03-08 15:03:59,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:03:59,718 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_operatoramount_amount100_file-20.i[916,929] [2025-03-08 15:03:59,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:03:59,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:03:59,826 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_operatoramount_amount100_file-20.i[916,929] [2025-03-08 15:03:59,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:03:59,889 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:03:59,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59 WrapperNode [2025-03-08 15:03:59,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:03:59,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:03:59,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:03:59,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:03:59,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,946 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-03-08 15:03:59,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:03:59,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:03:59,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:03:59,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:03:59,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,974 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:03:59,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:03:59,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:03:59,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:03:59,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:03:59,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:03:59,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (1/1) ... [2025-03-08 15:04:00,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:04:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:00,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:04:00,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:04:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:04:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:04:00,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:04:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:04:00,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:04:00,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:04:00,101 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:04:00,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:04:00,447 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-08 15:04:00,487 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-08 15:04:00,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:04:00,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:04:00,505 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:04:00,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:00 BoogieIcfgContainer [2025-03-08 15:04:00,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:04:00,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:04:00,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:04:00,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:04:00,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:03:59" (1/3) ... [2025-03-08 15:04:00,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594eaf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:00, skipping insertion in model container [2025-03-08 15:04:00,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:03:59" (2/3) ... [2025-03-08 15:04:00,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594eaf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:00, skipping insertion in model container [2025-03-08 15:04:00,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:00" (3/3) ... [2025-03-08 15:04:00,513 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-20.i [2025-03-08 15:04:00,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:04:00,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:04:00,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:04:00,602 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;@3100fe0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:04:00,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:04:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 15:04:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 15:04:00,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:00,614 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:00,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1783017545, now seen corresponding path program 1 times [2025-03-08 15:04:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-03-08 15:04:00,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:00,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 15:04:00,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 15:04:00,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:00,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 15:04:00,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:00,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-03-08 15:04:00,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213441188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373002264] [2025-03-08 15:04:00,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:00,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:00,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:04:00,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:04:00,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 15:04:01,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 15:04:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:01,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:04:01,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 15:04:01,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:04:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373002264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:01,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:04:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:04:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909714441] [2025-03-08 15:04:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:04:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:04:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:04:01,113 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:04:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:01,140 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2025-03-08 15:04:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:04:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-03-08 15:04:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:01,147 INFO L225 Difference]: With dead ends: 224 [2025-03-08 15:04:01,147 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 15:04:01,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:04:01,151 INFO L435 NwaCegarLoop]: 169 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, 169 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-08 15:04:01,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:04:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 15:04:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 15:04:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 15:04:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-08 15:04:01,185 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-03-08 15:04:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-08 15:04:01,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:04:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-08 15:04:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 15:04:01,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:01,188 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:01,195 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-08 15:04:01,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:04:01,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:01,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1184231988, now seen corresponding path program 1 times [2025-03-08 15:04:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319450379] [2025-03-08 15:04:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:01,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 15:04:01,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 15:04:01,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:01,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319450379] [2025-03-08 15:04:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319450379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:04:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571149788] [2025-03-08 15:04:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:04:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:04:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:04:01,840 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:02,076 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-03-08 15:04:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:04:02,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-08 15:04:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:02,082 INFO L225 Difference]: With dead ends: 364 [2025-03-08 15:04:02,083 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 15:04:02,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:04:02,086 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 168 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:02,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 514 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:04:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 15:04:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-03-08 15:04:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:04:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-03-08 15:04:02,124 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-03-08 15:04:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:02,125 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-03-08 15:04:02,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-03-08 15:04:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 15:04:02,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:02,130 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:02,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:04:02,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:02,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1871445696, now seen corresponding path program 1 times [2025-03-08 15:04:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:02,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512001804] [2025-03-08 15:04:02,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:02,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 15:04:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 15:04:02,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512001804] [2025-03-08 15:04:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512001804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:04:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240832816] [2025-03-08 15:04:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:04:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:02,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:04:02,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:04:02,745 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:03,274 INFO L93 Difference]: Finished difference Result 832 states and 1268 transitions. [2025-03-08 15:04:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:04:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-08 15:04:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:03,278 INFO L225 Difference]: With dead ends: 832 [2025-03-08 15:04:03,278 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 15:04:03,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:04:03,282 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 262 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:03,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1020 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:04:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 15:04:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 437. [2025-03-08 15:04:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 358 states have (on average 1.4301675977653632) internal successors, (512), 360 states have internal predecessors, (512), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 15:04:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2025-03-08 15:04:03,335 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 205 [2025-03-08 15:04:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2025-03-08 15:04:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2025-03-08 15:04:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 15:04:03,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:03,338 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:03,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:04:03,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -706933234, now seen corresponding path program 1 times [2025-03-08 15:04:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357379485] [2025-03-08 15:04:03,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:03,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 15:04:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 15:04:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357379485] [2025-03-08 15:04:04,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357379485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:04:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944607919] [2025-03-08 15:04:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:04,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:04:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:04,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:04:04,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:04:04,378 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:05,084 INFO L93 Difference]: Finished difference Result 1363 states and 2032 transitions. [2025-03-08 15:04:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:04:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 15:04:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:05,091 INFO L225 Difference]: With dead ends: 1363 [2025-03-08 15:04:05,091 INFO L226 Difference]: Without dead ends: 929 [2025-03-08 15:04:05,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:04:05,093 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 362 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:05,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 738 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:04:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-08 15:04:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 633. [2025-03-08 15:04:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 543 states have internal predecessors, (779), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:04:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 951 transitions. [2025-03-08 15:04:05,131 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 951 transitions. Word has length 206 [2025-03-08 15:04:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:05,132 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 951 transitions. [2025-03-08 15:04:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 951 transitions. [2025-03-08 15:04:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 15:04:05,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:05,134 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:05,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:04:05,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1212491859, now seen corresponding path program 1 times [2025-03-08 15:04:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022417222] [2025-03-08 15:04:05,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:05,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 15:04:05,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 15:04:05,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:05,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:05,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022417222] [2025-03-08 15:04:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022417222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:05,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:04:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174899104] [2025-03-08 15:04:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:04:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:04:05,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:04:05,432 INFO L87 Difference]: Start difference. First operand 633 states and 951 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:05,985 INFO L93 Difference]: Finished difference Result 1591 states and 2373 transitions. [2025-03-08 15:04:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:04:05,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 15:04:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:05,990 INFO L225 Difference]: With dead ends: 1591 [2025-03-08 15:04:05,990 INFO L226 Difference]: Without dead ends: 968 [2025-03-08 15:04:05,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:04:05,992 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 252 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:05,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 649 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:04:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-03-08 15:04:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 804. [2025-03-08 15:04:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 668 states have (on average 1.4251497005988023) internal successors, (952), 675 states have internal predecessors, (952), 123 states have call successors, (123), 12 states have call predecessors, (123), 12 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 15:04:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1198 transitions. [2025-03-08 15:04:06,073 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1198 transitions. Word has length 206 [2025-03-08 15:04:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:06,075 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1198 transitions. [2025-03-08 15:04:06,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1198 transitions. [2025-03-08 15:04:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 15:04:06,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:06,077 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:06,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:04:06,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 537831247, now seen corresponding path program 1 times [2025-03-08 15:04:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666662938] [2025-03-08 15:04:06,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:06,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 15:04:06,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 15:04:06,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:06,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666662938] [2025-03-08 15:04:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666662938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:07,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:07,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:04:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262696430] [2025-03-08 15:04:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:07,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:04:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:07,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:04:07,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:04:07,860 INFO L87 Difference]: Start difference. First operand 804 states and 1198 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:09,437 INFO L93 Difference]: Finished difference Result 3070 states and 4529 transitions. [2025-03-08 15:04:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:04:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 15:04:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:09,449 INFO L225 Difference]: With dead ends: 3070 [2025-03-08 15:04:09,450 INFO L226 Difference]: Without dead ends: 2276 [2025-03-08 15:04:09,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:04:09,453 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 499 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:09,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 711 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:04:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-08 15:04:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1047. [2025-03-08 15:04:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 911 states have (on average 1.4621295279912185) internal successors, (1332), 918 states have internal predecessors, (1332), 123 states have call successors, (123), 12 states have call predecessors, (123), 12 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 15:04:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1578 transitions. [2025-03-08 15:04:09,524 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1578 transitions. Word has length 206 [2025-03-08 15:04:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:09,526 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1578 transitions. [2025-03-08 15:04:09,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1578 transitions. [2025-03-08 15:04:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 15:04:09,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:09,529 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:09,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:04:09,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 129007022, now seen corresponding path program 1 times [2025-03-08 15:04:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66545596] [2025-03-08 15:04:09,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:09,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 15:04:09,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 15:04:09,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66545596] [2025-03-08 15:04:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66545596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:04:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696648505] [2025-03-08 15:04:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:09,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:04:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:04:09,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:09,643 INFO L87 Difference]: Start difference. First operand 1047 states and 1578 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:09,758 INFO L93 Difference]: Finished difference Result 2438 states and 3670 transitions. [2025-03-08 15:04:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:04:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 15:04:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:09,768 INFO L225 Difference]: With dead ends: 2438 [2025-03-08 15:04:09,768 INFO L226 Difference]: Without dead ends: 1401 [2025-03-08 15:04:09,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:09,771 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 148 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:09,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 439 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:04:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-08 15:04:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1150. [2025-03-08 15:04:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1022 states have (on average 1.477495107632094) internal successors, (1510), 1028 states have internal predecessors, (1510), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:04:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1744 transitions. [2025-03-08 15:04:09,836 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1744 transitions. Word has length 206 [2025-03-08 15:04:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:09,836 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1744 transitions. [2025-03-08 15:04:09,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1744 transitions. [2025-03-08 15:04:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 15:04:09,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:09,840 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:09,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:04:09,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2035021443, now seen corresponding path program 1 times [2025-03-08 15:04:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605162252] [2025-03-08 15:04:09,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:09,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 15:04:09,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 15:04:09,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:09,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:11,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:11,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605162252] [2025-03-08 15:04:11,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605162252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:11,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:04:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755669226] [2025-03-08 15:04:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:11,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:04:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:11,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:04:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:04:11,723 INFO L87 Difference]: Start difference. First operand 1150 states and 1744 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:13,386 INFO L93 Difference]: Finished difference Result 2334 states and 3489 transitions. [2025-03-08 15:04:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:04:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 15:04:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:13,393 INFO L225 Difference]: With dead ends: 2334 [2025-03-08 15:04:13,393 INFO L226 Difference]: Without dead ends: 1749 [2025-03-08 15:04:13,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:04:13,395 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 481 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:13,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 727 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:04:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-08 15:04:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1198. [2025-03-08 15:04:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1070 states have (on average 1.4813084112149533) internal successors, (1585), 1076 states have internal predecessors, (1585), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:04:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1819 transitions. [2025-03-08 15:04:13,452 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1819 transitions. Word has length 206 [2025-03-08 15:04:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1819 transitions. [2025-03-08 15:04:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1819 transitions. [2025-03-08 15:04:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 15:04:13,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:13,455 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:04:13,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1580374622, now seen corresponding path program 1 times [2025-03-08 15:04:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015398579] [2025-03-08 15:04:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:13,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 15:04:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 15:04:13,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015398579] [2025-03-08 15:04:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015398579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:04:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908282835] [2025-03-08 15:04:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:04:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:13,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:04:13,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:04:13,626 INFO L87 Difference]: Start difference. First operand 1198 states and 1819 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:13,971 INFO L93 Difference]: Finished difference Result 2808 states and 4265 transitions. [2025-03-08 15:04:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:04:13,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-08 15:04:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:13,979 INFO L225 Difference]: With dead ends: 2808 [2025-03-08 15:04:13,979 INFO L226 Difference]: Without dead ends: 1620 [2025-03-08 15:04:13,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:04:13,983 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 153 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:13,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 646 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:04:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-08 15:04:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1253. [2025-03-08 15:04:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1125 states have (on average 1.48) internal successors, (1665), 1131 states have internal predecessors, (1665), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:04:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1899 transitions. [2025-03-08 15:04:14,046 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1899 transitions. Word has length 207 [2025-03-08 15:04:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:14,046 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1899 transitions. [2025-03-08 15:04:14,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1899 transitions. [2025-03-08 15:04:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:14,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:14,051 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:14,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:04:14,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2052724903, now seen corresponding path program 1 times [2025-03-08 15:04:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353361483] [2025-03-08 15:04:14,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353361483] [2025-03-08 15:04:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353361483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:15,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:04:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620244114] [2025-03-08 15:04:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:04:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:15,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:04:15,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:04:15,557 INFO L87 Difference]: Start difference. First operand 1253 states and 1899 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:17,402 INFO L93 Difference]: Finished difference Result 2549 states and 3806 transitions. [2025-03-08 15:04:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:04:17,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 15:04:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:17,411 INFO L225 Difference]: With dead ends: 2549 [2025-03-08 15:04:17,411 INFO L226 Difference]: Without dead ends: 1919 [2025-03-08 15:04:17,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:04:17,413 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 533 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:17,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1231 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:04:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-03-08 15:04:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1160. [2025-03-08 15:04:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1069 states have (on average 1.4948550046772684) internal successors, (1598), 1073 states have internal predecessors, (1598), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:04:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1762 transitions. [2025-03-08 15:04:17,476 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1762 transitions. Word has length 208 [2025-03-08 15:04:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:17,477 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1762 transitions. [2025-03-08 15:04:17,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1762 transitions. [2025-03-08 15:04:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:17,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:17,479 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:04:17,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1736683768, now seen corresponding path program 1 times [2025-03-08 15:04:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233529693] [2025-03-08 15:04:17,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:17,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:17,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:17,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233529693] [2025-03-08 15:04:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233529693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:04:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493226662] [2025-03-08 15:04:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:18,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:04:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:18,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:04:18,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:04:18,447 INFO L87 Difference]: Start difference. First operand 1160 states and 1762 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:19,032 INFO L93 Difference]: Finished difference Result 2644 states and 3970 transitions. [2025-03-08 15:04:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:04:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 15:04:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:19,038 INFO L225 Difference]: With dead ends: 2644 [2025-03-08 15:04:19,038 INFO L226 Difference]: Without dead ends: 1941 [2025-03-08 15:04:19,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:04:19,040 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 368 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:19,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 444 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:04:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-08 15:04:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1370. [2025-03-08 15:04:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1279 states have (on average 1.4800625488663017) internal successors, (1893), 1283 states have internal predecessors, (1893), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:04:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2057 transitions. [2025-03-08 15:04:19,085 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2057 transitions. Word has length 208 [2025-03-08 15:04:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:19,085 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2057 transitions. [2025-03-08 15:04:19,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2057 transitions. [2025-03-08 15:04:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:19,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:19,087 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:04:19,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -512054673, now seen corresponding path program 1 times [2025-03-08 15:04:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425442990] [2025-03-08 15:04:19,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:19,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:19,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425442990] [2025-03-08 15:04:19,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425442990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:19,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:04:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442468931] [2025-03-08 15:04:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:19,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:04:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:19,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:04:19,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:19,193 INFO L87 Difference]: Start difference. First operand 1370 states and 2057 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:19,268 INFO L93 Difference]: Finished difference Result 1874 states and 2764 transitions. [2025-03-08 15:04:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:04:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 15:04:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:19,272 INFO L225 Difference]: With dead ends: 1874 [2025-03-08 15:04:19,272 INFO L226 Difference]: Without dead ends: 853 [2025-03-08 15:04:19,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:19,274 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:19,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:04:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-08 15:04:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2025-03-08 15:04:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 758 states have (on average 1.3443271767810026) internal successors, (1019), 762 states have internal predecessors, (1019), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:04:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1183 transitions. [2025-03-08 15:04:19,311 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1183 transitions. Word has length 208 [2025-03-08 15:04:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:19,312 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1183 transitions. [2025-03-08 15:04:19,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1183 transitions. [2025-03-08 15:04:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:19,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:19,314 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:19,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:04:19,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:19,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash -579061426, now seen corresponding path program 1 times [2025-03-08 15:04:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933012187] [2025-03-08 15:04:19,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:19,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:19,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:19,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:19,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933012187] [2025-03-08 15:04:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933012187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:20,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:04:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318907473] [2025-03-08 15:04:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:04:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:20,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:04:20,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:04:20,821 INFO L87 Difference]: Start difference. First operand 849 states and 1183 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:21,724 INFO L93 Difference]: Finished difference Result 1945 states and 2676 transitions. [2025-03-08 15:04:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:04:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 15:04:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:21,728 INFO L225 Difference]: With dead ends: 1945 [2025-03-08 15:04:21,728 INFO L226 Difference]: Without dead ends: 1099 [2025-03-08 15:04:21,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:04:21,730 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 278 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:21,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 858 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:04:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-08 15:04:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 850. [2025-03-08 15:04:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 759 states have (on average 1.3451910408432148) internal successors, (1021), 763 states have internal predecessors, (1021), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:04:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1185 transitions. [2025-03-08 15:04:21,770 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1185 transitions. Word has length 208 [2025-03-08 15:04:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:21,770 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1185 transitions. [2025-03-08 15:04:21,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1185 transitions. [2025-03-08 15:04:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:21,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:21,772 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:04:21,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1084620051, now seen corresponding path program 1 times [2025-03-08 15:04:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351514246] [2025-03-08 15:04:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:21,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351514246] [2025-03-08 15:04:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351514246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:04:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857444963] [2025-03-08 15:04:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:23,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:04:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:23,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:04:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:04:23,242 INFO L87 Difference]: Start difference. First operand 850 states and 1185 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:24,516 INFO L93 Difference]: Finished difference Result 2039 states and 2803 transitions. [2025-03-08 15:04:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:04:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 15:04:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:24,520 INFO L225 Difference]: With dead ends: 2039 [2025-03-08 15:04:24,521 INFO L226 Difference]: Without dead ends: 1192 [2025-03-08 15:04:24,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:04:24,522 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 348 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:24,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1186 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:04:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-08 15:04:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 855. [2025-03-08 15:04:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 764 states have (on average 1.3455497382198953) internal successors, (1028), 768 states have internal predecessors, (1028), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:04:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1192 transitions. [2025-03-08 15:04:24,561 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1192 transitions. Word has length 208 [2025-03-08 15:04:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:24,561 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1192 transitions. [2025-03-08 15:04:24,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1192 transitions. [2025-03-08 15:04:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:24,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:24,562 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:24,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:04:24,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:24,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1929091922, now seen corresponding path program 1 times [2025-03-08 15:04:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052236051] [2025-03-08 15:04:24,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:24,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:24,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:24,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:24,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052236051] [2025-03-08 15:04:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052236051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:04:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172041562] [2025-03-08 15:04:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:04:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:04:24,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:04:24,846 INFO L87 Difference]: Start difference. First operand 855 states and 1192 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:04:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:25,799 INFO L93 Difference]: Finished difference Result 2401 states and 3329 transitions. [2025-03-08 15:04:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:04:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 208 [2025-03-08 15:04:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:25,804 INFO L225 Difference]: With dead ends: 2401 [2025-03-08 15:04:25,805 INFO L226 Difference]: Without dead ends: 1549 [2025-03-08 15:04:25,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:04:25,807 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 317 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:25,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1419 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:04:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-08 15:04:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1222. [2025-03-08 15:04:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1056 states have (on average 1.3352272727272727) internal successors, (1410), 1062 states have internal predecessors, (1410), 150 states have call successors, (150), 15 states have call predecessors, (150), 15 states have return successors, (150), 144 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-08 15:04:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1710 transitions. [2025-03-08 15:04:25,874 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1710 transitions. Word has length 208 [2025-03-08 15:04:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:25,874 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1710 transitions. [2025-03-08 15:04:25,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:04:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1710 transitions. [2025-03-08 15:04:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 15:04:25,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:25,875 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:25,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:04:25,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:25,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash 498600186, now seen corresponding path program 1 times [2025-03-08 15:04:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133916171] [2025-03-08 15:04:25,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:25,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:25,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:25,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:25,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-08 15:04:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133916171] [2025-03-08 15:04:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133916171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647741251] [2025-03-08 15:04:26,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:26,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:26,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:04:26,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:04:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 15:04:26,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 15:04:26,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:26,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:04:26,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-08 15:04:26,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:04:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647741251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:27,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:04:27,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-08 15:04:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656662842] [2025-03-08 15:04:27,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:04:27,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:04:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:27,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:04:27,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:04:27,040 INFO L87 Difference]: Start difference. First operand 1222 states and 1710 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-08 15:04:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:29,233 INFO L93 Difference]: Finished difference Result 2107 states and 2908 transitions. [2025-03-08 15:04:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 15:04:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 208 [2025-03-08 15:04:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:29,237 INFO L225 Difference]: With dead ends: 2107 [2025-03-08 15:04:29,237 INFO L226 Difference]: Without dead ends: 888 [2025-03-08 15:04:29,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=2280, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 15:04:29,240 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 563 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:29,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1339 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:04:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-08 15:04:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 486. [2025-03-08 15:04:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 400 states have (on average 1.2725) internal successors, (509), 402 states have internal predecessors, (509), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 15:04:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2025-03-08 15:04:29,284 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 208 [2025-03-08 15:04:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:29,284 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2025-03-08 15:04:29,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-08 15:04:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2025-03-08 15:04:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:29,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:29,286 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:29,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:04:29,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:04:29,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1279400903, now seen corresponding path program 1 times [2025-03-08 15:04:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938147955] [2025-03-08 15:04:29,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:29,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938147955] [2025-03-08 15:04:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938147955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:04:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760793972] [2025-03-08 15:04:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:04:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:04:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:04:30,842 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:31,451 INFO L93 Difference]: Finished difference Result 1164 states and 1550 transitions. [2025-03-08 15:04:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:04:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:04:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:31,454 INFO L225 Difference]: With dead ends: 1164 [2025-03-08 15:04:31,455 INFO L226 Difference]: Without dead ends: 681 [2025-03-08 15:04:31,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:04:31,456 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 274 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:31,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1059 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:04:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-08 15:04:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 488. [2025-03-08 15:04:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 402 states have (on average 1.2736318407960199) internal successors, (512), 404 states have internal predecessors, (512), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 15:04:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 656 transitions. [2025-03-08 15:04:31,489 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 656 transitions. Word has length 210 [2025-03-08 15:04:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 656 transitions. [2025-03-08 15:04:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 656 transitions. [2025-03-08 15:04:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:31,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:31,490 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:04:31,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:31,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1784959528, now seen corresponding path program 1 times [2025-03-08 15:04:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027092470] [2025-03-08 15:04:31,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:31,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027092470] [2025-03-08 15:04:34,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027092470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:34,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 15:04:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211984800] [2025-03-08 15:04:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:34,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:04:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:34,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:04:34,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:04:34,489 INFO L87 Difference]: Start difference. First operand 488 states and 656 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:38,447 INFO L93 Difference]: Finished difference Result 1345 states and 1790 transitions. [2025-03-08 15:04:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 15:04:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:04:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:38,451 INFO L225 Difference]: With dead ends: 1345 [2025-03-08 15:04:38,451 INFO L226 Difference]: Without dead ends: 860 [2025-03-08 15:04:38,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2025-03-08 15:04:38,452 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 462 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1383 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 15:04:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-08 15:04:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 579. [2025-03-08 15:04:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 457 states have (on average 1.2560175054704594) internal successors, (574), 459 states have internal predecessors, (574), 103 states have call successors, (103), 18 states have call predecessors, (103), 18 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 15:04:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 780 transitions. [2025-03-08 15:04:38,502 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 780 transitions. Word has length 210 [2025-03-08 15:04:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:38,503 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 780 transitions. [2025-03-08 15:04:38,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 780 transitions. [2025-03-08 15:04:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:38,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:38,504 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:38,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:04:38,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1665535897, now seen corresponding path program 1 times [2025-03-08 15:04:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:38,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013650569] [2025-03-08 15:04:38,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:38,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:38,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:38,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013650569] [2025-03-08 15:04:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013650569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:04:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656190043] [2025-03-08 15:04:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:38,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:04:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:38,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:04:38,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:04:38,817 INFO L87 Difference]: Start difference. First operand 579 states and 780 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 15:04:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:39,331 INFO L93 Difference]: Finished difference Result 1358 states and 1829 transitions. [2025-03-08 15:04:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:04:39,336 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), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 210 [2025-03-08 15:04:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:39,340 INFO L225 Difference]: With dead ends: 1358 [2025-03-08 15:04:39,340 INFO L226 Difference]: Without dead ends: 873 [2025-03-08 15:04:39,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:04:39,341 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 304 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:39,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 885 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:04:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-08 15:04:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 722. [2025-03-08 15:04:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 564 states have (on average 1.25177304964539) internal successors, (706), 566 states have internal predecessors, (706), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:04:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 974 transitions. [2025-03-08 15:04:39,407 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 974 transitions. Word has length 210 [2025-03-08 15:04:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:39,407 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 974 transitions. [2025-03-08 15:04:39,408 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), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 15:04:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 974 transitions. [2025-03-08 15:04:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:39,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:39,409 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:39,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:04:39,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:39,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1488044281, now seen corresponding path program 1 times [2025-03-08 15:04:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233798716] [2025-03-08 15:04:39,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233798716] [2025-03-08 15:04:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233798716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:04:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798437515] [2025-03-08 15:04:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:41,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:04:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:41,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:04:41,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:04:41,814 INFO L87 Difference]: Start difference. First operand 722 states and 974 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:43,388 INFO L93 Difference]: Finished difference Result 1459 states and 1947 transitions. [2025-03-08 15:04:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:04:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:04:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:43,393 INFO L225 Difference]: With dead ends: 1459 [2025-03-08 15:04:43,393 INFO L226 Difference]: Without dead ends: 974 [2025-03-08 15:04:43,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:04:43,394 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 359 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:43,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1403 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:04:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-08 15:04:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 722. [2025-03-08 15:04:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 564 states have (on average 1.25177304964539) internal successors, (706), 566 states have internal predecessors, (706), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:04:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 974 transitions. [2025-03-08 15:04:43,461 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 974 transitions. Word has length 210 [2025-03-08 15:04:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:43,461 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 974 transitions. [2025-03-08 15:04:43,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 974 transitions. [2025-03-08 15:04:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:43,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:43,462 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:43,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 15:04:43,463 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:43,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 982485656, now seen corresponding path program 1 times [2025-03-08 15:04:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017775803] [2025-03-08 15:04:43,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:43,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:43,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:43,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:43,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:44,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017775803] [2025-03-08 15:04:44,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017775803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:44,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:44,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:04:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111595498] [2025-03-08 15:04:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:04:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:44,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:04:44,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:04:44,753 INFO L87 Difference]: Start difference. First operand 722 states and 974 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:45,681 INFO L93 Difference]: Finished difference Result 1494 states and 1999 transitions. [2025-03-08 15:04:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:04:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:04:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:45,685 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 15:04:45,685 INFO L226 Difference]: Without dead ends: 1009 [2025-03-08 15:04:45,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:04:45,687 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 335 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:45,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1181 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:04:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-08 15:04:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 743. [2025-03-08 15:04:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 585 states have (on average 1.2547008547008547) internal successors, (734), 587 states have internal predecessors, (734), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:04:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1002 transitions. [2025-03-08 15:04:45,756 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1002 transitions. Word has length 210 [2025-03-08 15:04:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:45,756 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1002 transitions. [2025-03-08 15:04:45,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:04:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1002 transitions. [2025-03-08 15:04:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:04:45,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:45,758 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:04:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:04:45,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 977510104, now seen corresponding path program 1 times [2025-03-08 15:04:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483149403] [2025-03-08 15:04:45,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:45,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:04:45,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:04:45,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:45,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:04:49,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483149403] [2025-03-08 15:04:49,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483149403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:49,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 15:04:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204958173] [2025-03-08 15:04:49,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:49,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:04:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:49,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:04:49,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:04:49,854 INFO L87 Difference]: Start difference. First operand 743 states and 1002 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:00,339 INFO L93 Difference]: Finished difference Result 1580 states and 2101 transitions. [2025-03-08 15:05:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:05:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:05:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:00,344 INFO L225 Difference]: With dead ends: 1580 [2025-03-08 15:05:00,344 INFO L226 Difference]: Without dead ends: 1074 [2025-03-08 15:05:00,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:05:00,347 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 494 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:00,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1845 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-08 15:05:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-03-08 15:05:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 748. [2025-03-08 15:05:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 590 states have (on average 1.2576271186440677) internal successors, (742), 592 states have internal predecessors, (742), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:05:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1010 transitions. [2025-03-08 15:05:00,414 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1010 transitions. Word has length 210 [2025-03-08 15:05:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1010 transitions. [2025-03-08 15:05:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1010 transitions. [2025-03-08 15:05:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:05:00,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:00,415 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:00,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 15:05:00,415 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 471951479, now seen corresponding path program 1 times [2025-03-08 15:05:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768981773] [2025-03-08 15:05:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:00,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:05:00,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:05:00,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:00,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768981773] [2025-03-08 15:05:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768981773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:05:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408022699] [2025-03-08 15:05:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:05:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:05:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:05:05,689 INFO L87 Difference]: Start difference. First operand 748 states and 1010 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:06,947 INFO L93 Difference]: Finished difference Result 1517 states and 2030 transitions. [2025-03-08 15:05:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:05:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:05:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:06,951 INFO L225 Difference]: With dead ends: 1517 [2025-03-08 15:05:06,951 INFO L226 Difference]: Without dead ends: 1006 [2025-03-08 15:05:06,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:05:06,953 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 278 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:06,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1447 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:05:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-08 15:05:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 748. [2025-03-08 15:05:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 590 states have (on average 1.2576271186440677) internal successors, (742), 592 states have internal predecessors, (742), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:05:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1010 transitions. [2025-03-08 15:05:07,021 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1010 transitions. Word has length 210 [2025-03-08 15:05:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:07,021 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1010 transitions. [2025-03-08 15:05:07,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1010 transitions. [2025-03-08 15:05:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 15:05:07,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:07,023 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:07,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 15:05:07,023 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 133038233, now seen corresponding path program 1 times [2025-03-08 15:05:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088747538] [2025-03-08 15:05:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 15:05:07,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 15:05:07,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:07,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:07,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088747538] [2025-03-08 15:05:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088747538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:07,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:05:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959782131] [2025-03-08 15:05:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:07,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:05:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:05:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:05:07,617 INFO L87 Difference]: Start difference. First operand 748 states and 1010 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:08,951 INFO L93 Difference]: Finished difference Result 1804 states and 2439 transitions. [2025-03-08 15:05:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:05:08,951 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-03-08 15:05:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:08,956 INFO L225 Difference]: With dead ends: 1804 [2025-03-08 15:05:08,956 INFO L226 Difference]: Without dead ends: 1293 [2025-03-08 15:05:08,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:05:08,958 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 360 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:08,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1285 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:05:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-08 15:05:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 903. [2025-03-08 15:05:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 709 states have (on average 1.2609308885754584) internal successors, (894), 711 states have internal predecessors, (894), 165 states have call successors, (165), 28 states have call predecessors, (165), 28 states have return successors, (165), 163 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-08 15:05:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2025-03-08 15:05:09,103 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 210 [2025-03-08 15:05:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:09,103 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2025-03-08 15:05:09,104 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2025-03-08 15:05:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 15:05:09,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:09,105 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 15:05:09,105 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -509329697, now seen corresponding path program 1 times [2025-03-08 15:05:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081842630] [2025-03-08 15:05:09,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:09,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 15:05:09,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 15:05:09,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:09,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081842630] [2025-03-08 15:05:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081842630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:05:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929895875] [2025-03-08 15:05:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:09,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:05:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:09,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:05:09,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:05:09,383 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:05:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:10,047 INFO L93 Difference]: Finished difference Result 2497 states and 3349 transitions. [2025-03-08 15:05:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:05:10,047 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), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 211 [2025-03-08 15:05:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:10,052 INFO L225 Difference]: With dead ends: 2497 [2025-03-08 15:05:10,052 INFO L226 Difference]: Without dead ends: 1688 [2025-03-08 15:05:10,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:05:10,053 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 477 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:10,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 733 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:05:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2025-03-08 15:05:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1400. [2025-03-08 15:05:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1121 states have (on average 1.2622658340767172) internal successors, (1415), 1125 states have internal predecessors, (1415), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-08 15:05:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1889 transitions. [2025-03-08 15:05:10,170 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1889 transitions. Word has length 211 [2025-03-08 15:05:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:10,170 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1889 transitions. [2025-03-08 15:05:10,170 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), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 15:05:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1889 transitions. [2025-03-08 15:05:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 15:05:10,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:10,171 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 15:05:10,171 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:10,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -802732704, now seen corresponding path program 1 times [2025-03-08 15:05:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:10,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496177014] [2025-03-08 15:05:10,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:10,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 15:05:10,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 15:05:10,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:10,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496177014] [2025-03-08 15:05:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496177014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:05:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733090511] [2025-03-08 15:05:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:11,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:05:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:11,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:05:11,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:05:11,845 INFO L87 Difference]: Start difference. First operand 1400 states and 1889 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:14,125 INFO L93 Difference]: Finished difference Result 3003 states and 4005 transitions. [2025-03-08 15:05:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:05:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 211 [2025-03-08 15:05:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:14,130 INFO L225 Difference]: With dead ends: 3003 [2025-03-08 15:05:14,130 INFO L226 Difference]: Without dead ends: 1995 [2025-03-08 15:05:14,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:05:14,132 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 342 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:14,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1841 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 15:05:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-08 15:05:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1409. [2025-03-08 15:05:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1130 states have (on average 1.263716814159292) internal successors, (1428), 1134 states have internal predecessors, (1428), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-08 15:05:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1902 transitions. [2025-03-08 15:05:14,252 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1902 transitions. Word has length 211 [2025-03-08 15:05:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1902 transitions. [2025-03-08 15:05:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1902 transitions. [2025-03-08 15:05:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 15:05:14,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:14,253 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 15:05:14,253 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -772117025, now seen corresponding path program 1 times [2025-03-08 15:05:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137442599] [2025-03-08 15:05:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:14,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 15:05:14,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 15:05:14,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:14,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:14,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137442599] [2025-03-08 15:05:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137442599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:05:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673963940] [2025-03-08 15:05:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:05:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:14,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:05:14,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:05:14,483 INFO L87 Difference]: Start difference. First operand 1409 states and 1902 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:15,244 INFO L93 Difference]: Finished difference Result 2925 states and 3885 transitions. [2025-03-08 15:05:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:05:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 211 [2025-03-08 15:05:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:15,250 INFO L225 Difference]: With dead ends: 2925 [2025-03-08 15:05:15,250 INFO L226 Difference]: Without dead ends: 2255 [2025-03-08 15:05:15,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:05:15,252 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 266 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:15,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 975 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:05:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2025-03-08 15:05:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1437. [2025-03-08 15:05:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1158 states have (on average 1.2677029360967185) internal successors, (1468), 1162 states have internal predecessors, (1468), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-08 15:05:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1942 transitions. [2025-03-08 15:05:15,383 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1942 transitions. Word has length 211 [2025-03-08 15:05:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:15,383 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1942 transitions. [2025-03-08 15:05:15,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1942 transitions. [2025-03-08 15:05:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 15:05:15,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:15,384 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:15,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 15:05:15,385 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:15,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1065520032, now seen corresponding path program 1 times [2025-03-08 15:05:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417286107] [2025-03-08 15:05:15,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:15,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 15:05:15,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 15:05:15,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:15,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 15:05:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:05:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417286107] [2025-03-08 15:05:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417286107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:05:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073558926] [2025-03-08 15:05:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:05:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:05:17,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:05:17,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:05:17,742 INFO L87 Difference]: Start difference. First operand 1437 states and 1942 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:19,224 INFO L93 Difference]: Finished difference Result 2704 states and 3614 transitions. [2025-03-08 15:05:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:05:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 211 [2025-03-08 15:05:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:19,231 INFO L225 Difference]: With dead ends: 2704 [2025-03-08 15:05:19,231 INFO L226 Difference]: Without dead ends: 2010 [2025-03-08 15:05:19,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:05:19,233 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 267 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:19,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1973 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:05:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-03-08 15:05:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1422. [2025-03-08 15:05:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1143 states have (on average 1.2642169728783903) internal successors, (1445), 1147 states have internal predecessors, (1445), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-08 15:05:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1919 transitions. [2025-03-08 15:05:19,360 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1919 transitions. Word has length 211 [2025-03-08 15:05:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:19,360 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 1919 transitions. [2025-03-08 15:05:19,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 15:05:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1919 transitions. [2025-03-08 15:05:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 15:05:19,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:19,361 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:05:19,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 15:05:19,361 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -79913828, now seen corresponding path program 1 times [2025-03-08 15:05:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:05:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770415848] [2025-03-08 15:05:19,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:05:19,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 15:05:19,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 15:05:19,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:19,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat