./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.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_amount500_file-55.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 0e49f641837e2645381c1f8f53d3b9afa212dfe1d8bd986d5ccb7d6262feaded --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:45:25,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:45:25,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:45:25,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:45:25,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:45:25,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:45:25,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:45:25,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:45:25,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:45:25,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:45:25,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:45:25,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:45:25,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:45:25,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:45:25,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:45:25,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:45:25,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:45:25,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:25,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:45:25,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:45:25,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:45:25,895 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 -> 0e49f641837e2645381c1f8f53d3b9afa212dfe1d8bd986d5ccb7d6262feaded [2025-03-08 15:45:26,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:45:26,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:45:26,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:45:26,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:45:26,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:45:26,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i [2025-03-08 15:45:27,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a69d2fc/8d39e1e824d142d3b3e60eabec5395d1/FLAGe1cfde586 [2025-03-08 15:45:27,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:45:27,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-55.i [2025-03-08 15:45:27,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a69d2fc/8d39e1e824d142d3b3e60eabec5395d1/FLAGe1cfde586 [2025-03-08 15:45:27,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a69d2fc/8d39e1e824d142d3b3e60eabec5395d1 [2025-03-08 15:45:27,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:45:27,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:45:27,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:27,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:45:27,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:45:27,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:27" (1/1) ... [2025-03-08 15:45:27,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300cbcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:27, skipping insertion in model container [2025-03-08 15:45:27,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:27" (1/1) ... [2025-03-08 15:45:27,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:45:28,022 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_amount500_file-55.i[916,929] [2025-03-08 15:45:28,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:28,280 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:45:28,292 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_amount500_file-55.i[916,929] [2025-03-08 15:45:28,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:28,422 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:45:28,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28 WrapperNode [2025-03-08 15:45:28,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:28,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:28,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:45:28,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:45:28,428 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:45:28" (1/1) ... [2025-03-08 15:45:28,442 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:45:28" (1/1) ... [2025-03-08 15:45:28,525 INFO L138 Inliner]: procedures = 26, calls = 91, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 750 [2025-03-08 15:45:28,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:28,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:45:28,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:45:28,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:45:28,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,608 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:45:28,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:45:28,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:45:28,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:45:28,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:45:28,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (1/1) ... [2025-03-08 15:45:28,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:28,710 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:45:28,713 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:45:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:45:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:45:28,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:45:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:45:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:45:28,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:45:28,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:45:28,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:45:29,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1;havoc property_#t~ite65#1;havoc property_#t~bitwise62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~short66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~bitwise69#1;havoc property_#t~short70#1; [2025-03-08 15:45:29,981 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-08 15:45:29,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:45:30,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:45:30,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:45:30,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:30 BoogieIcfgContainer [2025-03-08 15:45:30,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:45:30,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:45:30,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:45:30,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:45:30,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:45:27" (1/3) ... [2025-03-08 15:45:30,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bfc5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:30, skipping insertion in model container [2025-03-08 15:45:30,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:28" (2/3) ... [2025-03-08 15:45:30,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bfc5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:30, skipping insertion in model container [2025-03-08 15:45:30,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:30" (3/3) ... [2025-03-08 15:45:30,022 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-55.i [2025-03-08 15:45:30,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:45:30,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-55.i that has 2 procedures, 297 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:45:30,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:45:30,107 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;@68055fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:45:30,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:45:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 217 states have internal predecessors, (326), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:45:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:30,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:30,128 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:30,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1901561129, now seen corresponding path program 1 times [2025-03-08 15:45:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:30,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264660085] [2025-03-08 15:45:30,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:30,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:30,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:30,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:30,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-08 15:45:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264660085] [2025-03-08 15:45:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264660085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453321536] [2025-03-08 15:45:30,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:30,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:30,782 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:45:30,784 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:45:30,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:31,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:31,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:31,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:45:31,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-08 15:45:31,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:45:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453321536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:31,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:45:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:45:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162116386] [2025-03-08 15:45:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:45:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:31,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:45:31,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:45:31,288 INFO L87 Difference]: Start difference. First operand has 297 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 217 states have internal predecessors, (326), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-08 15:45:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:31,373 INFO L93 Difference]: Finished difference Result 587 states and 1035 transitions. [2025-03-08 15:45:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:45:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) Word has length 541 [2025-03-08 15:45:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:31,388 INFO L225 Difference]: With dead ends: 587 [2025-03-08 15:45:31,389 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 15:45:31,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 542 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:45:31,397 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:31,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 15:45:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-08 15:45:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.4929577464788732) internal successors, (318), 213 states have internal predecessors, (318), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:45:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 474 transitions. [2025-03-08 15:45:31,474 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 474 transitions. Word has length 541 [2025-03-08 15:45:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:31,476 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 474 transitions. [2025-03-08 15:45:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-08 15:45:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 474 transitions. [2025-03-08 15:45:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:31,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:31,487 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:31,497 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:45:31,692 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:45:31,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:31,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 195491759, now seen corresponding path program 1 times [2025-03-08 15:45:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501838088] [2025-03-08 15:45:31,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:31,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:31,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:31,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501838088] [2025-03-08 15:45:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501838088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825182974] [2025-03-08 15:45:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:32,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:32,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:32,371 INFO L87 Difference]: Start difference. First operand 293 states and 474 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:32,624 INFO L93 Difference]: Finished difference Result 785 states and 1272 transitions. [2025-03-08 15:45:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:32,631 INFO L225 Difference]: With dead ends: 785 [2025-03-08 15:45:32,632 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 15:45:32,633 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:45:32,635 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 289 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:32,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1030 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 15:45:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2025-03-08 15:45:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 382 states have (on average 1.5183246073298429) internal successors, (580), 383 states have internal predecessors, (580), 107 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-08 15:45:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 794 transitions. [2025-03-08 15:45:32,687 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 794 transitions. Word has length 541 [2025-03-08 15:45:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:32,688 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 794 transitions. [2025-03-08 15:45:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 794 transitions. [2025-03-08 15:45:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:32,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:32,694 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:45:32,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1451657525, now seen corresponding path program 1 times [2025-03-08 15:45:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:32,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129401114] [2025-03-08 15:45:32,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:32,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:32,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:32,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:32,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129401114] [2025-03-08 15:45:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129401114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:33,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:33,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437761147] [2025-03-08 15:45:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:33,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:33,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:33,167 INFO L87 Difference]: Start difference. First operand 492 states and 794 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:33,336 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2025-03-08 15:45:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:33,343 INFO L225 Difference]: With dead ends: 988 [2025-03-08 15:45:33,345 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 15:45:33,346 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:45:33,347 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 241 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:33,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 929 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 15:45:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 394. [2025-03-08 15:45:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 313 states have (on average 1.5271565495207668) internal successors, (478), 313 states have internal predecessors, (478), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:45:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 634 transitions. [2025-03-08 15:45:33,373 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 634 transitions. Word has length 541 [2025-03-08 15:45:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 634 transitions. [2025-03-08 15:45:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 634 transitions. [2025-03-08 15:45:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:33,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:33,378 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:45:33,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 970864684, now seen corresponding path program 1 times [2025-03-08 15:45:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349948763] [2025-03-08 15:45:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:33,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349948763] [2025-03-08 15:45:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349948763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293651943] [2025-03-08 15:45:33,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:33,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:33,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:33,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:33,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:33,683 INFO L87 Difference]: Start difference. First operand 394 states and 634 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:33,810 INFO L93 Difference]: Finished difference Result 1173 states and 1890 transitions. [2025-03-08 15:45:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:33,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:33,816 INFO L225 Difference]: With dead ends: 1173 [2025-03-08 15:45:33,816 INFO L226 Difference]: Without dead ends: 782 [2025-03-08 15:45:33,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:33,822 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 431 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:33,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 954 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-08 15:45:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 780. [2025-03-08 15:45:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 619 states have (on average 1.5105008077544426) internal successors, (935), 619 states have internal predecessors, (935), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:45:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1247 transitions. [2025-03-08 15:45:33,870 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1247 transitions. Word has length 541 [2025-03-08 15:45:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:33,871 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1247 transitions. [2025-03-08 15:45:33,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1247 transitions. [2025-03-08 15:45:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:33,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:33,874 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:45:33,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:33,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash 356019116, now seen corresponding path program 1 times [2025-03-08 15:45:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55980449] [2025-03-08 15:45:33,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:33,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:34,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:34,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:34,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55980449] [2025-03-08 15:45:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55980449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:45:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574880460] [2025-03-08 15:45:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:45:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:45:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:35,366 INFO L87 Difference]: Start difference. First operand 780 states and 1247 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:36,559 INFO L93 Difference]: Finished difference Result 3594 states and 5750 transitions. [2025-03-08 15:45:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:45:36,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:36,574 INFO L225 Difference]: With dead ends: 3594 [2025-03-08 15:45:36,574 INFO L226 Difference]: Without dead ends: 2817 [2025-03-08 15:45:36,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:45:36,580 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 2010 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:36,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 2929 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:45:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-03-08 15:45:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 1577. [2025-03-08 15:45:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1330 states have (on average 1.556390977443609) internal successors, (2070), 1332 states have internal predecessors, (2070), 238 states have call successors, (238), 8 states have call predecessors, (238), 8 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 15:45:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2546 transitions. [2025-03-08 15:45:36,675 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2546 transitions. Word has length 541 [2025-03-08 15:45:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:36,677 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2546 transitions. [2025-03-08 15:45:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2546 transitions. [2025-03-08 15:45:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:36,684 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:36,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:45:36,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1311540395, now seen corresponding path program 1 times [2025-03-08 15:45:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507686364] [2025-03-08 15:45:36,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:36,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:36,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507686364] [2025-03-08 15:45:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507686364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:38,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168409052] [2025-03-08 15:45:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:38,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:38,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:38,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:38,193 INFO L87 Difference]: Start difference. First operand 1577 states and 2546 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:40,109 INFO L93 Difference]: Finished difference Result 6081 states and 9802 transitions. [2025-03-08 15:45:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:45:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:40,132 INFO L225 Difference]: With dead ends: 6081 [2025-03-08 15:45:40,132 INFO L226 Difference]: Without dead ends: 4507 [2025-03-08 15:45:40,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:45:40,140 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 2093 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:40,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 2834 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:45:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-03-08 15:45:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3530. [2025-03-08 15:45:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 3037 states have (on average 1.5696410931840632) internal successors, (4767), 3041 states have internal predecessors, (4767), 476 states have call successors, (476), 16 states have call predecessors, (476), 16 states have return successors, (476), 472 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-08 15:45:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 5719 transitions. [2025-03-08 15:45:40,311 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 5719 transitions. Word has length 541 [2025-03-08 15:45:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 5719 transitions. [2025-03-08 15:45:40,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 5719 transitions. [2025-03-08 15:45:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:40,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:40,319 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:45:40,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash 782621356, now seen corresponding path program 1 times [2025-03-08 15:45:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087508436] [2025-03-08 15:45:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:40,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:40,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087508436] [2025-03-08 15:45:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087508436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:40,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780385028] [2025-03-08 15:45:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:40,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:40,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:40,580 INFO L87 Difference]: Start difference. First operand 3530 states and 5719 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:40,761 INFO L93 Difference]: Finished difference Result 9531 states and 15428 transitions. [2025-03-08 15:45:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:40,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:40,792 INFO L225 Difference]: With dead ends: 9531 [2025-03-08 15:45:40,792 INFO L226 Difference]: Without dead ends: 6004 [2025-03-08 15:45:40,802 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:45:40,802 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 264 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:40,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1061 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2025-03-08 15:45:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5994. [2025-03-08 15:45:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5173 states have (on average 1.5694954571815194) internal successors, (8119), 5185 states have internal predecessors, (8119), 788 states have call successors, (788), 32 states have call predecessors, (788), 32 states have return successors, (788), 776 states have call predecessors, (788), 788 states have call successors, (788) [2025-03-08 15:45:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 9695 transitions. [2025-03-08 15:45:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 9695 transitions. Word has length 541 [2025-03-08 15:45:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:41,018 INFO L471 AbstractCegarLoop]: Abstraction has 5994 states and 9695 transitions. [2025-03-08 15:45:41,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 9695 transitions. [2025-03-08 15:45:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:41,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:41,025 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:45:41,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 272087179, now seen corresponding path program 1 times [2025-03-08 15:45:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870506418] [2025-03-08 15:45:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:41,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:41,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870506418] [2025-03-08 15:45:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870506418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:41,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829295526] [2025-03-08 15:45:41,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:41,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:41,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:41,344 INFO L87 Difference]: Start difference. First operand 5994 states and 9695 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:41,590 INFO L93 Difference]: Finished difference Result 12043 states and 19451 transitions. [2025-03-08 15:45:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:41,630 INFO L225 Difference]: With dead ends: 12043 [2025-03-08 15:45:41,630 INFO L226 Difference]: Without dead ends: 6052 [2025-03-08 15:45:41,647 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:45:41,647 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 100 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:41,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 985 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2025-03-08 15:45:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6049. [2025-03-08 15:45:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 5205 states have (on average 1.5640730067243036) internal successors, (8141), 5218 states have internal predecessors, (8141), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-03-08 15:45:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 9747 transitions. [2025-03-08 15:45:41,903 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 9747 transitions. Word has length 541 [2025-03-08 15:45:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 6049 states and 9747 transitions. [2025-03-08 15:45:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 9747 transitions. [2025-03-08 15:45:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:41,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:41,911 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:45:41,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -85735379, now seen corresponding path program 1 times [2025-03-08 15:45:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347166648] [2025-03-08 15:45:41,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:41,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:41,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:41,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:41,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347166648] [2025-03-08 15:45:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347166648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:42,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:45:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797332526] [2025-03-08 15:45:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:45:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:42,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:45:42,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:42,678 INFO L87 Difference]: Start difference. First operand 6049 states and 9747 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:43,368 INFO L93 Difference]: Finished difference Result 24214 states and 38989 transitions. [2025-03-08 15:45:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:45:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:43,418 INFO L225 Difference]: With dead ends: 24214 [2025-03-08 15:45:43,418 INFO L226 Difference]: Without dead ends: 18191 [2025-03-08 15:45:43,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:43,432 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1423 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:43,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2207 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:45:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18191 states. [2025-03-08 15:45:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18191 to 6601. [2025-03-08 15:45:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 5757 states have (on average 1.583637311099531) internal successors, (9117), 5770 states have internal predecessors, (9117), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-03-08 15:45:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 10723 transitions. [2025-03-08 15:45:43,698 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 10723 transitions. Word has length 541 [2025-03-08 15:45:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 6601 states and 10723 transitions. [2025-03-08 15:45:43,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 10723 transitions. [2025-03-08 15:45:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:43,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:43,712 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:45:43,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 869785900, now seen corresponding path program 1 times [2025-03-08 15:45:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147488074] [2025-03-08 15:45:43,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:43,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:43,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:43,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:44,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147488074] [2025-03-08 15:45:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147488074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:44,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:44,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:45:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126057860] [2025-03-08 15:45:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:44,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:45:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:44,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:45:44,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:44,905 INFO L87 Difference]: Start difference. First operand 6601 states and 10723 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:45,926 INFO L93 Difference]: Finished difference Result 16703 states and 26993 transitions. [2025-03-08 15:45:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:45:45,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:45,958 INFO L225 Difference]: With dead ends: 16703 [2025-03-08 15:45:45,958 INFO L226 Difference]: Without dead ends: 10128 [2025-03-08 15:45:45,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:45:45,973 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1348 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:45,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2348 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:45:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10128 states. [2025-03-08 15:45:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10128 to 6934. [2025-03-08 15:45:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6934 states, 6090 states have (on average 1.5852216748768473) internal successors, (9654), 6103 states have internal predecessors, (9654), 803 states have call successors, (803), 40 states have call predecessors, (803), 40 states have return successors, (803), 790 states have call predecessors, (803), 803 states have call successors, (803) [2025-03-08 15:45:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 11260 transitions. [2025-03-08 15:45:46,216 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 11260 transitions. Word has length 541 [2025-03-08 15:45:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:46,216 INFO L471 AbstractCegarLoop]: Abstraction has 6934 states and 11260 transitions. [2025-03-08 15:45:46,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 11260 transitions. [2025-03-08 15:45:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:46,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:46,225 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:46,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:45:46,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1082460876, now seen corresponding path program 1 times [2025-03-08 15:45:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:46,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138321499] [2025-03-08 15:45:46,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:46,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:46,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:46,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:46,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:46,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138321499] [2025-03-08 15:45:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138321499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:46,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:46,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474988165] [2025-03-08 15:45:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:46,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:46,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:46,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:46,900 INFO L87 Difference]: Start difference. First operand 6934 states and 11260 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:47,122 INFO L93 Difference]: Finished difference Result 20750 states and 33698 transitions. [2025-03-08 15:45:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:47,159 INFO L225 Difference]: With dead ends: 20750 [2025-03-08 15:45:47,159 INFO L226 Difference]: Without dead ends: 13842 [2025-03-08 15:45:47,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:47,173 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 456 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:47,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1176 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13842 states. [2025-03-08 15:45:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13842 to 13840. [2025-03-08 15:45:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13840 states, 12168 states have (on average 1.5782380013149244) internal successors, (19204), 12193 states have internal predecessors, (19204), 1591 states have call successors, (1591), 80 states have call predecessors, (1591), 80 states have return successors, (1591), 1566 states have call predecessors, (1591), 1591 states have call successors, (1591) [2025-03-08 15:45:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13840 states to 13840 states and 22386 transitions. [2025-03-08 15:45:47,593 INFO L78 Accepts]: Start accepts. Automaton has 13840 states and 22386 transitions. Word has length 541 [2025-03-08 15:45:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 13840 states and 22386 transitions. [2025-03-08 15:45:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13840 states and 22386 transitions. [2025-03-08 15:45:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 15:45:47,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:47,606 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:47,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:45:47,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:47,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash -848158229, now seen corresponding path program 1 times [2025-03-08 15:45:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926923754] [2025-03-08 15:45:47,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:47,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 15:45:47,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 15:45:47,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:47,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:48,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926923754] [2025-03-08 15:45:48,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926923754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:48,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:48,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:45:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487843344] [2025-03-08 15:45:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:45:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:48,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:45:48,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:48,504 INFO L87 Difference]: Start difference. First operand 13840 states and 22386 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:49,413 INFO L93 Difference]: Finished difference Result 31744 states and 50874 transitions. [2025-03-08 15:45:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:45:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 541 [2025-03-08 15:45:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:49,477 INFO L225 Difference]: With dead ends: 31744 [2025-03-08 15:45:49,477 INFO L226 Difference]: Without dead ends: 17930 [2025-03-08 15:45:49,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:49,508 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1100 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:49,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2344 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17930 states. [2025-03-08 15:45:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17930 to 13999. [2025-03-08 15:45:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13999 states, 12296 states have (on average 1.5765289525048796) internal successors, (19385), 12322 states have internal predecessors, (19385), 1620 states have call successors, (1620), 82 states have call predecessors, (1620), 82 states have return successors, (1620), 1594 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-03-08 15:45:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13999 states to 13999 states and 22625 transitions. [2025-03-08 15:45:50,032 INFO L78 Accepts]: Start accepts. Automaton has 13999 states and 22625 transitions. Word has length 541 [2025-03-08 15:45:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:50,033 INFO L471 AbstractCegarLoop]: Abstraction has 13999 states and 22625 transitions. [2025-03-08 15:45:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13999 states and 22625 transitions. [2025-03-08 15:45:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-08 15:45:50,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:50,045 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:45:50,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:50,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -581073601, now seen corresponding path program 1 times [2025-03-08 15:45:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920280357] [2025-03-08 15:45:50,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-08 15:45:50,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-08 15:45:50,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:50,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920280357] [2025-03-08 15:45:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920280357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524648553] [2025-03-08 15:45:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:50,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:50,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:50,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:50,535 INFO L87 Difference]: Start difference. First operand 13999 states and 22625 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:51,398 INFO L93 Difference]: Finished difference Result 33373 states and 53348 transitions. [2025-03-08 15:45:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-03-08 15:45:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:51,458 INFO L225 Difference]: With dead ends: 33373 [2025-03-08 15:45:51,459 INFO L226 Difference]: Without dead ends: 19400 [2025-03-08 15:45:51,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:51,480 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 626 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:51,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1623 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19400 states. [2025-03-08 15:45:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19400 to 12317. [2025-03-08 15:45:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12317 states, 10614 states have (on average 1.5546448087431695) internal successors, (16501), 10640 states have internal predecessors, (16501), 1620 states have call successors, (1620), 82 states have call predecessors, (1620), 82 states have return successors, (1620), 1594 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-03-08 15:45:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12317 states to 12317 states and 19741 transitions. [2025-03-08 15:45:51,934 INFO L78 Accepts]: Start accepts. Automaton has 12317 states and 19741 transitions. Word has length 542 [2025-03-08 15:45:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:51,935 INFO L471 AbstractCegarLoop]: Abstraction has 12317 states and 19741 transitions. [2025-03-08 15:45:51,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12317 states and 19741 transitions. [2025-03-08 15:45:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-08 15:45:51,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:51,946 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:45:51,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:51,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash -807846869, now seen corresponding path program 1 times [2025-03-08 15:45:51,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:51,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186003053] [2025-03-08 15:45:51,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:51,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-08 15:45:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-08 15:45:52,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:52,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186003053] [2025-03-08 15:45:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186003053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:53,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:53,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:45:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339689191] [2025-03-08 15:45:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:53,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:53,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:53,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:53,004 INFO L87 Difference]: Start difference. First operand 12317 states and 19741 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:55,162 INFO L93 Difference]: Finished difference Result 30088 states and 48025 transitions. [2025-03-08 15:45:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:45:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-03-08 15:45:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:55,206 INFO L225 Difference]: With dead ends: 30088 [2025-03-08 15:45:55,206 INFO L226 Difference]: Without dead ends: 17797 [2025-03-08 15:45:55,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:45:55,224 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 3549 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3549 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:55,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3549 Valid, 2453 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 15:45:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2025-03-08 15:45:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 14045. [2025-03-08 15:45:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14045 states, 12270 states have (on average 1.5598207008964955) internal successors, (19139), 12300 states have internal predecessors, (19139), 1680 states have call successors, (1680), 94 states have call predecessors, (1680), 94 states have return successors, (1680), 1650 states have call predecessors, (1680), 1680 states have call successors, (1680) [2025-03-08 15:45:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14045 states to 14045 states and 22499 transitions. [2025-03-08 15:45:55,801 INFO L78 Accepts]: Start accepts. Automaton has 14045 states and 22499 transitions. Word has length 542 [2025-03-08 15:45:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 14045 states and 22499 transitions. [2025-03-08 15:45:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 14045 states and 22499 transitions. [2025-03-08 15:45:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-08 15:45:55,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:55,812 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:45:55,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1251458292, now seen corresponding path program 1 times [2025-03-08 15:45:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922326256] [2025-03-08 15:45:55,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:55,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-08 15:45:56,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-08 15:45:56,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:56,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:45:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922326256] [2025-03-08 15:45:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922326256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:56,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:56,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:45:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580293041] [2025-03-08 15:45:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:56,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:45:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:56,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:45:56,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:56,869 INFO L87 Difference]: Start difference. First operand 14045 states and 22499 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:58,116 INFO L93 Difference]: Finished difference Result 43103 states and 68417 transitions. [2025-03-08 15:45:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:45:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-03-08 15:45:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:58,191 INFO L225 Difference]: With dead ends: 43103 [2025-03-08 15:45:58,191 INFO L226 Difference]: Without dead ends: 29084 [2025-03-08 15:45:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:58,215 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 870 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:58,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2360 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:45:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29084 states. [2025-03-08 15:45:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29084 to 17555. [2025-03-08 15:45:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17555 states, 15780 states have (on average 1.5804816223067173) internal successors, (24940), 15810 states have internal predecessors, (24940), 1680 states have call successors, (1680), 94 states have call predecessors, (1680), 94 states have return successors, (1680), 1650 states have call predecessors, (1680), 1680 states have call successors, (1680) [2025-03-08 15:45:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17555 states to 17555 states and 28300 transitions. [2025-03-08 15:45:59,031 INFO L78 Accepts]: Start accepts. Automaton has 17555 states and 28300 transitions. Word has length 542 [2025-03-08 15:45:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:59,032 INFO L471 AbstractCegarLoop]: Abstraction has 17555 states and 28300 transitions. [2025-03-08 15:45:59,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:45:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 17555 states and 28300 transitions. [2025-03-08 15:45:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-08 15:45:59,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:59,047 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:59,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:45:59,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:59,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2120825421, now seen corresponding path program 1 times [2025-03-08 15:45:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:59,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848354675] [2025-03-08 15:45:59,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:59,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-08 15:45:59,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-08 15:45:59,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:59,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:00,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848354675] [2025-03-08 15:46:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848354675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:00,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704297414] [2025-03-08 15:46:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:00,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:00,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:00,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:00,014 INFO L87 Difference]: Start difference. First operand 17555 states and 28300 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:00,532 INFO L93 Difference]: Finished difference Result 34968 states and 56327 transitions. [2025-03-08 15:46:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 542 [2025-03-08 15:46:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:00,576 INFO L225 Difference]: With dead ends: 34968 [2025-03-08 15:46:00,576 INFO L226 Difference]: Without dead ends: 17439 [2025-03-08 15:46:00,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:00,603 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 618 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:00,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1124 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17439 states. [2025-03-08 15:46:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17439 to 16860. [2025-03-08 15:46:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16860 states, 15279 states have (on average 1.578375548137967) internal successors, (24116), 15308 states have internal predecessors, (24116), 1491 states have call successors, (1491), 89 states have call predecessors, (1491), 89 states have return successors, (1491), 1462 states have call predecessors, (1491), 1491 states have call successors, (1491) [2025-03-08 15:46:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16860 states to 16860 states and 27098 transitions. [2025-03-08 15:46:01,222 INFO L78 Accepts]: Start accepts. Automaton has 16860 states and 27098 transitions. Word has length 542 [2025-03-08 15:46:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:01,223 INFO L471 AbstractCegarLoop]: Abstraction has 16860 states and 27098 transitions. [2025-03-08 15:46:01,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16860 states and 27098 transitions. [2025-03-08 15:46:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 15:46:01,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:01,239 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:46:01,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1606657559, now seen corresponding path program 1 times [2025-03-08 15:46:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273219941] [2025-03-08 15:46:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:01,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 15:46:02,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 15:46:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 63 proven. 168 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:04,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273219941] [2025-03-08 15:46:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273219941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390485965] [2025-03-08 15:46:04,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:04,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:04,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:04,240 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:46:04,241 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:46:04,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 15:46:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 15:46:04,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:04,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:46:04,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 5703 proven. 144 refuted. 0 times theorem prover too weak. 6165 trivial. 0 not checked. [2025-03-08 15:46:04,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 87 proven. 144 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390485965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:05,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 16 [2025-03-08 15:46:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905641507] [2025-03-08 15:46:05,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:05,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:46:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:05,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:46:05,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:46:05,323 INFO L87 Difference]: Start difference. First operand 16860 states and 27098 transitions. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-03-08 15:46:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:07,268 INFO L93 Difference]: Finished difference Result 25682 states and 40669 transitions. [2025-03-08 15:46:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:46:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) Word has length 543 [2025-03-08 15:46:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:07,305 INFO L225 Difference]: With dead ends: 25682 [2025-03-08 15:46:07,305 INFO L226 Difference]: Without dead ends: 8825 [2025-03-08 15:46:07,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1088 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:46:07,329 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 832 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:07,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 2191 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:46:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2025-03-08 15:46:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8454. [2025-03-08 15:46:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8454 states, 6809 states have (on average 1.4746658833896313) internal successors, (10041), 6838 states have internal predecessors, (10041), 1505 states have call successors, (1505), 139 states have call predecessors, (1505), 139 states have return successors, (1505), 1476 states have call predecessors, (1505), 1505 states have call successors, (1505) [2025-03-08 15:46:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 13051 transitions. [2025-03-08 15:46:08,096 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 13051 transitions. Word has length 543 [2025-03-08 15:46:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:08,097 INFO L471 AbstractCegarLoop]: Abstraction has 8454 states and 13051 transitions. [2025-03-08 15:46:08,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-03-08 15:46:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 13051 transitions. [2025-03-08 15:46:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-08 15:46:08,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:08,109 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:08,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:46:08,310 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,SelfDestructingSolverStorable16 [2025-03-08 15:46:08,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:08,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash -405815604, now seen corresponding path program 1 times [2025-03-08 15:46:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282269135] [2025-03-08 15:46:08,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:08,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 15:46:08,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 15:46:08,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:08,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:08,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282269135] [2025-03-08 15:46:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282269135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:46:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731349321] [2025-03-08 15:46:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:08,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:46:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:46:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:46:08,946 INFO L87 Difference]: Start difference. First operand 8454 states and 13051 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:10,718 INFO L93 Difference]: Finished difference Result 36727 states and 56756 transitions. [2025-03-08 15:46:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:46:10,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-03-08 15:46:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:10,784 INFO L225 Difference]: With dead ends: 36727 [2025-03-08 15:46:10,784 INFO L226 Difference]: Without dead ends: 28333 [2025-03-08 15:46:10,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:46:10,801 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 1523 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:10,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1973 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:46:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28333 states. [2025-03-08 15:46:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28333 to 10590. [2025-03-08 15:46:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 8945 states have (on average 1.5245388485187255) internal successors, (13637), 8974 states have internal predecessors, (13637), 1505 states have call successors, (1505), 139 states have call predecessors, (1505), 139 states have return successors, (1505), 1476 states have call predecessors, (1505), 1505 states have call successors, (1505) [2025-03-08 15:46:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 16647 transitions. [2025-03-08 15:46:11,528 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 16647 transitions. Word has length 544 [2025-03-08 15:46:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:11,529 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 16647 transitions. [2025-03-08 15:46:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 16647 transitions. [2025-03-08 15:46:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-08 15:46:11,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:11,537 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:46:11,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:11,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1615057843, now seen corresponding path program 1 times [2025-03-08 15:46:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684071190] [2025-03-08 15:46:11,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:11,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 15:46:11,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 15:46:11,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:11,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684071190] [2025-03-08 15:46:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684071190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:46:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751252024] [2025-03-08 15:46:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:46:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:12,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:46:12,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:46:12,289 INFO L87 Difference]: Start difference. First operand 10590 states and 16647 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:14,674 INFO L93 Difference]: Finished difference Result 41834 states and 64887 transitions. [2025-03-08 15:46:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:46:14,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-03-08 15:46:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:14,748 INFO L225 Difference]: With dead ends: 41834 [2025-03-08 15:46:14,748 INFO L226 Difference]: Without dead ends: 31304 [2025-03-08 15:46:14,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:14,768 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1202 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:14,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 2619 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:46:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31304 states. [2025-03-08 15:46:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31304 to 26306. [2025-03-08 15:46:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26306 states, 21977 states have (on average 1.4972471219911725) internal successors, (32905), 22078 states have internal predecessors, (32905), 3937 states have call successors, (3937), 391 states have call predecessors, (3937), 391 states have return successors, (3937), 3836 states have call predecessors, (3937), 3937 states have call successors, (3937) [2025-03-08 15:46:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26306 states to 26306 states and 40779 transitions. [2025-03-08 15:46:16,360 INFO L78 Accepts]: Start accepts. Automaton has 26306 states and 40779 transitions. Word has length 544 [2025-03-08 15:46:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:16,361 INFO L471 AbstractCegarLoop]: Abstraction has 26306 states and 40779 transitions. [2025-03-08 15:46:16,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26306 states and 40779 transitions. [2025-03-08 15:46:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-08 15:46:16,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:16,379 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:46:16,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1757225870, now seen corresponding path program 1 times [2025-03-08 15:46:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331492208] [2025-03-08 15:46:16,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:16,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 15:46:17,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 15:46:17,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:17,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 93 proven. 138 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331492208] [2025-03-08 15:46:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331492208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811172905] [2025-03-08 15:46:17,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:17,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:17,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:17,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:46:17,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 15:46:17,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 15:46:17,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:17,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:17,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:46:17,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6077 proven. 111 refuted. 0 times theorem prover too weak. 5824 trivial. 0 not checked. [2025-03-08 15:46:18,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 120 proven. 111 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811172905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:18,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:18,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:46:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111295378] [2025-03-08 15:46:18,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:18,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:46:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:18,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:46:18,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:18,560 INFO L87 Difference]: Start difference. First operand 26306 states and 40779 transitions. Second operand has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-03-08 15:46:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:19,798 INFO L93 Difference]: Finished difference Result 35950 states and 55354 transitions. [2025-03-08 15:46:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:46:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) Word has length 544 [2025-03-08 15:46:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:19,840 INFO L225 Difference]: With dead ends: 35950 [2025-03-08 15:46:19,840 INFO L226 Difference]: Without dead ends: 9704 [2025-03-08 15:46:19,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:46:19,870 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1039 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:19,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 900 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:46:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2025-03-08 15:46:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7298. [2025-03-08 15:46:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7298 states, 5585 states have (on average 1.4254252461951655) internal successors, (7961), 5602 states have internal predecessors, (7961), 1525 states have call successors, (1525), 187 states have call predecessors, (1525), 187 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-03-08 15:46:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 11011 transitions. [2025-03-08 15:46:20,456 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 11011 transitions. Word has length 544 [2025-03-08 15:46:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:20,458 INFO L471 AbstractCegarLoop]: Abstraction has 7298 states and 11011 transitions. [2025-03-08 15:46:20,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 3 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-03-08 15:46:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 11011 transitions. [2025-03-08 15:46:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-08 15:46:20,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:20,464 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:46:20,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:20,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -362838628, now seen corresponding path program 1 times [2025-03-08 15:46:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446027094] [2025-03-08 15:46:20,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:20,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 15:46:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 15:46:20,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446027094] [2025-03-08 15:46:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446027094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581753330] [2025-03-08 15:46:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:21,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:21,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:21,195 INFO L87 Difference]: Start difference. First operand 7298 states and 11011 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:22,173 INFO L93 Difference]: Finished difference Result 18854 states and 28177 transitions. [2025-03-08 15:46:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:22,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 544 [2025-03-08 15:46:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:22,211 INFO L225 Difference]: With dead ends: 18854 [2025-03-08 15:46:22,211 INFO L226 Difference]: Without dead ends: 11616 [2025-03-08 15:46:22,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:46:22,227 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 613 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:22,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1075 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11616 states. [2025-03-08 15:46:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11616 to 7118. [2025-03-08 15:46:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7118 states, 5381 states have (on average 1.4081025831629808) internal successors, (7577), 5398 states have internal predecessors, (7577), 1525 states have call successors, (1525), 211 states have call predecessors, (1525), 211 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-03-08 15:46:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7118 states to 7118 states and 10627 transitions. [2025-03-08 15:46:22,869 INFO L78 Accepts]: Start accepts. Automaton has 7118 states and 10627 transitions. Word has length 544 [2025-03-08 15:46:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:22,869 INFO L471 AbstractCegarLoop]: Abstraction has 7118 states and 10627 transitions. [2025-03-08 15:46:22,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7118 states and 10627 transitions. [2025-03-08 15:46:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-08 15:46:22,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:22,874 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:46:22,874 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -824694261, now seen corresponding path program 1 times [2025-03-08 15:46:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271541379] [2025-03-08 15:46:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:22,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-08 15:46:23,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-08 15:46:23,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:23,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271541379] [2025-03-08 15:46:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271541379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:23,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:23,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:46:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44517765] [2025-03-08 15:46:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:23,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:46:23,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:23,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:46:23,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:46:23,613 INFO L87 Difference]: Start difference. First operand 7118 states and 10627 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:25,906 INFO L93 Difference]: Finished difference Result 26434 states and 40209 transitions. [2025-03-08 15:46:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:46:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 545 [2025-03-08 15:46:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:25,950 INFO L225 Difference]: With dead ends: 26434 [2025-03-08 15:46:25,950 INFO L226 Difference]: Without dead ends: 19376 [2025-03-08 15:46:25,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:46:25,964 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 3337 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:25,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 3624 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:46:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19376 states. [2025-03-08 15:46:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19376 to 12126. [2025-03-08 15:46:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 10021 states have (on average 1.4678175830755413) internal successors, (14709), 10054 states have internal predecessors, (14709), 1861 states have call successors, (1861), 243 states have call predecessors, (1861), 243 states have return successors, (1861), 1828 states have call predecessors, (1861), 1861 states have call successors, (1861) [2025-03-08 15:46:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 18431 transitions. [2025-03-08 15:46:26,788 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 18431 transitions. Word has length 545 [2025-03-08 15:46:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:26,788 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 18431 transitions. [2025-03-08 15:46:26,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 18431 transitions. [2025-03-08 15:46:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-08 15:46:26,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:26,798 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 15:46:26,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:26,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1308369588, now seen corresponding path program 1 times [2025-03-08 15:46:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59587142] [2025-03-08 15:46:26,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-08 15:46:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-08 15:46:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59587142] [2025-03-08 15:46:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59587142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:27,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:27,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:46:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192680641] [2025-03-08 15:46:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:46:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:46:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:46:27,513 INFO L87 Difference]: Start difference. First operand 12126 states and 18431 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:29,170 INFO L93 Difference]: Finished difference Result 34331 states and 52478 transitions. [2025-03-08 15:46:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:46:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 545 [2025-03-08 15:46:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:29,224 INFO L225 Difference]: With dead ends: 34331 [2025-03-08 15:46:29,225 INFO L226 Difference]: Without dead ends: 22265 [2025-03-08 15:46:29,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:46:29,252 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1023 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:29,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1173 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:46:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22265 states. [2025-03-08 15:46:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22265 to 16030. [2025-03-08 15:46:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16030 states, 13925 states have (on average 1.5084380610412926) internal successors, (21005), 13958 states have internal predecessors, (21005), 1861 states have call successors, (1861), 243 states have call predecessors, (1861), 243 states have return successors, (1861), 1828 states have call predecessors, (1861), 1861 states have call successors, (1861) [2025-03-08 15:46:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16030 states to 16030 states and 24727 transitions. [2025-03-08 15:46:30,229 INFO L78 Accepts]: Start accepts. Automaton has 16030 states and 24727 transitions. Word has length 545 [2025-03-08 15:46:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 16030 states and 24727 transitions. [2025-03-08 15:46:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-08 15:46:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16030 states and 24727 transitions. [2025-03-08 15:46:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-08 15:46:30,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:30,241 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:30,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 15:46:30,242 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:30,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash -93102676, now seen corresponding path program 1 times [2025-03-08 15:46:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641566242] [2025-03-08 15:46:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:30,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-08 15:46:31,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-08 15:46:31,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:31,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 63 proven. 168 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:31,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641566242] [2025-03-08 15:46:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641566242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294062884] [2025-03-08 15:46:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:31,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:31,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:46:32,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-08 15:46:32,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-08 15:46:32,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:32,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:32,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:46:32,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6063 proven. 108 refuted. 0 times theorem prover too weak. 5841 trivial. 0 not checked. [2025-03-08 15:46:32,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 123 proven. 108 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-08 15:46:33,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294062884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:33,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-03-08 15:46:33,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873586394] [2025-03-08 15:46:33,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:33,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 15:46:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:33,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 15:46:33,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:46:33,307 INFO L87 Difference]: Start difference. First operand 16030 states and 24727 transitions. Second operand has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) [2025-03-08 15:46:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:36,389 INFO L93 Difference]: Finished difference Result 28932 states and 44131 transitions. [2025-03-08 15:46:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 15:46:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) Word has length 545 [2025-03-08 15:46:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:36,438 INFO L225 Difference]: With dead ends: 28932 [2025-03-08 15:46:36,438 INFO L226 Difference]: Without dead ends: 12962 [2025-03-08 15:46:36,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1086 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 15:46:36,462 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1896 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:36,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 3982 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:46:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2025-03-08 15:46:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 9014. [2025-03-08 15:46:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9014 states, 7261 states have (on average 1.4572372951384107) internal successors, (10581), 7278 states have internal predecessors, (10581), 1525 states have call successors, (1525), 227 states have call predecessors, (1525), 227 states have return successors, (1525), 1508 states have call predecessors, (1525), 1525 states have call successors, (1525) [2025-03-08 15:46:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 13631 transitions. [2025-03-08 15:46:37,256 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 13631 transitions. Word has length 545 [2025-03-08 15:46:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 9014 states and 13631 transitions. [2025-03-08 15:46:37,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.285714285714286) internal successors, (279), 21 states have internal predecessors, (279), 5 states have call successors, (234), 3 states have call predecessors, (234), 6 states have return successors, (234), 5 states have call predecessors, (234), 5 states have call successors, (234) [2025-03-08 15:46:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 13631 transitions. [2025-03-08 15:46:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-08 15:46:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:37,275 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:46:37,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:37,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:37,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1191108204, now seen corresponding path program 1 times [2025-03-08 15:46:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282940813] [2025-03-08 15:46:37,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:37,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-08 15:46:37,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-08 15:46:37,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:37,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-08 15:46:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282940813] [2025-03-08 15:46:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282940813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:46:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767608324] [2025-03-08 15:46:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:46:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:38,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:46:38,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:38,179 INFO L87 Difference]: Start difference. First operand 9014 states and 13631 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78)