./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-24.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 11fbe230916924754384b4d5f209e2f8e8933dc585a70287035d014e0032f60d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:08:53,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:08:53,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:08:53,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:08:53,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:08:53,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:08:53,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:08:53,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:08:53,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:08:53,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:08:53,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:08:53,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:08:53,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:08:53,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:08:53,747 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:08:53,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:08:53,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:08:53,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:08:53,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:08:53,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:08:53,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:08:53,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:08:53,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:08:53,751 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 -> 11fbe230916924754384b4d5f209e2f8e8933dc585a70287035d014e0032f60d [2025-03-04 00:08:53,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:08:53,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:08:53,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:08:53,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:08:53,992 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:08:53,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-24.i [2025-03-04 00:08:55,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17988c12/5765f4ff3f0e4e20890b0a780a103fc9/FLAG3d1731ebf [2025-03-04 00:08:55,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:08:55,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-24.i [2025-03-04 00:08:55,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17988c12/5765f4ff3f0e4e20890b0a780a103fc9/FLAG3d1731ebf [2025-03-04 00:08:55,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17988c12/5765f4ff3f0e4e20890b0a780a103fc9 [2025-03-04 00:08:55,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:08:55,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:08:55,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:08:55,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:08:55,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:08:55,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:08:55" (1/1) ... [2025-03-04 00:08:55,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:55, skipping insertion in model container [2025-03-04 00:08:55,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:08:55" (1/1) ... [2025-03-04 00:08:55,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:08:55,891 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_amount250_file-24.i[916,929] [2025-03-04 00:08:56,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:08:56,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:08:56,017 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_amount250_file-24.i[916,929] [2025-03-04 00:08:56,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:08:56,119 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:08:56,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56 WrapperNode [2025-03-04 00:08:56,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:08:56,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:08:56,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:08:56,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:08:56,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,181 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2025-03-04 00:08:56,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:08:56,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:08:56,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:08:56,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:08:56,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,221 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-04 00:08:56,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:08:56,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:08:56,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:08:56,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:08:56,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (1/1) ... [2025-03-04 00:08:56,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:08:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:56,296 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-04 00:08:56,299 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-04 00:08:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:08:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:08:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:08:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:08:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:08:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:08:56,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:08:56,424 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:08:56,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc property_#t~ite35#1;havoc property_#t~bitwise34#1;havoc property_#t~short36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1; [2025-03-04 00:08:56,993 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-04 00:08:56,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:08:57,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:08:57,016 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:08:57,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:08:57 BoogieIcfgContainer [2025-03-04 00:08:57,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:08:57,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:08:57,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:08:57,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:08:57,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:08:55" (1/3) ... [2025-03-04 00:08:57,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43babc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:08:57, skipping insertion in model container [2025-03-04 00:08:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:56" (2/3) ... [2025-03-04 00:08:57,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43babc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:08:57, skipping insertion in model container [2025-03-04 00:08:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:08:57" (3/3) ... [2025-03-04 00:08:57,024 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-24.i [2025-03-04 00:08:57,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:08:57,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-24.i that has 2 procedures, 181 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:08:57,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:08:57,102 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;@3f4913a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:08:57,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:08:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 135 states have internal predecessors, (203), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 00:08:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-04 00:08:57,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:57,120 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:57,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:57,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash 396823663, now seen corresponding path program 1 times [2025-03-04 00:08:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665094223] [2025-03-04 00:08:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:57,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:08:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:08:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-04 00:08:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665094223] [2025-03-04 00:08:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665094223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197615860] [2025-03-04 00:08:57,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:57,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:57,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:57,514 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-04 00:08:57,516 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-04 00:08:57,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:08:57,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:08:57,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:57,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:08:57,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-04 00:08:57,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:08:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197615860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:08:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:08:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772828532] [2025-03-04 00:08:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:57,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:08:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:57,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:08:57,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:08:57,873 INFO L87 Difference]: Start difference. First operand has 181 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 135 states have internal predecessors, (203), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:08:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:57,913 INFO L93 Difference]: Finished difference Result 356 states and 621 transitions. [2025-03-04 00:08:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:08:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 298 [2025-03-04 00:08:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:57,921 INFO L225 Difference]: With dead ends: 356 [2025-03-04 00:08:57,921 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 00:08:57,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 299 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-04 00:08:57,927 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:57,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:08:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 00:08:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-04 00:08:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 132 states have (on average 1.5) internal successors, (198), 132 states have internal predecessors, (198), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 00:08:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 286 transitions. [2025-03-04 00:08:57,976 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 286 transitions. Word has length 298 [2025-03-04 00:08:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 286 transitions. [2025-03-04 00:08:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:08:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 286 transitions. [2025-03-04 00:08:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-04 00:08:57,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:57,986 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:57,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:08:58,191 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-04 00:08:58,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 24568551, now seen corresponding path program 1 times [2025-03-04 00:08:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582941268] [2025-03-04 00:08:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:58,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:08:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:08:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:08:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:58,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582941268] [2025-03-04 00:08:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582941268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:58,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:58,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:08:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401911689] [2025-03-04 00:08:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:58,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:08:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:58,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:08:58,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:08:58,693 INFO L87 Difference]: Start difference. First operand 178 states and 286 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:58,974 INFO L93 Difference]: Finished difference Result 529 states and 853 transitions. [2025-03-04 00:08:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:08:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 298 [2025-03-04 00:08:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:58,981 INFO L225 Difference]: With dead ends: 529 [2025-03-04 00:08:58,982 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 00:08:58,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:08:58,985 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 219 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 809 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 00:08:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 263. [2025-03-04 00:08:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 172 states have internal predecessors, (243), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 00:08:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 419 transitions. [2025-03-04 00:08:59,021 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 419 transitions. Word has length 298 [2025-03-04 00:08:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:59,021 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 419 transitions. [2025-03-04 00:08:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 419 transitions. [2025-03-04 00:08:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:08:59,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:59,027 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:59,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:08:59,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1587446251, now seen corresponding path program 1 times [2025-03-04 00:08:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221647317] [2025-03-04 00:08:59,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:59,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:08:59,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:08:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:08:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221647317] [2025-03-04 00:08:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221647317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342067302] [2025-03-04 00:08:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:59,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:59,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:59,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:59,265 INFO L87 Difference]: Start difference. First operand 263 states and 419 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:59,415 INFO L93 Difference]: Finished difference Result 597 states and 955 transitions. [2025-03-04 00:08:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 299 [2025-03-04 00:08:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:59,420 INFO L225 Difference]: With dead ends: 597 [2025-03-04 00:08:59,420 INFO L226 Difference]: Without dead ends: 422 [2025-03-04 00:08:59,421 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-04 00:08:59,423 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 250 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:59,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 663 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:08:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-04 00:08:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 318. [2025-03-04 00:08:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 227 states have internal predecessors, (326), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 00:08:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2025-03-04 00:08:59,461 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 502 transitions. Word has length 299 [2025-03-04 00:08:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:59,466 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 502 transitions. [2025-03-04 00:08:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 502 transitions. [2025-03-04 00:08:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:08:59,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:59,472 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:08:59,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1971233418, now seen corresponding path program 1 times [2025-03-04 00:08:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74382886] [2025-03-04 00:08:59,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:59,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:08:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:08:59,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:59,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:08:59,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74382886] [2025-03-04 00:08:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74382886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533617507] [2025-03-04 00:08:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:59,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:59,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:59,662 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:59,772 INFO L93 Difference]: Finished difference Result 652 states and 1028 transitions. [2025-03-04 00:08:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 299 [2025-03-04 00:08:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:59,777 INFO L225 Difference]: With dead ends: 652 [2025-03-04 00:08:59,777 INFO L226 Difference]: Without dead ends: 422 [2025-03-04 00:08:59,778 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-04 00:08:59,778 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 248 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:59,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 488 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:08:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-04 00:08:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 318. [2025-03-04 00:08:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 00:08:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 492 transitions. [2025-03-04 00:08:59,823 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 492 transitions. Word has length 299 [2025-03-04 00:08:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:59,823 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 492 transitions. [2025-03-04 00:08:59,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:08:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 492 transitions. [2025-03-04 00:08:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:08:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:59,827 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:08:59,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:59,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 369026821, now seen corresponding path program 1 times [2025-03-04 00:08:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827157367] [2025-03-04 00:08:59,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:59,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:08:59,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:08:59,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827157367] [2025-03-04 00:09:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827157367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:00,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:00,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140325541] [2025-03-04 00:09:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:00,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:00,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:00,129 INFO L87 Difference]: Start difference. First operand 318 states and 492 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:00,199 INFO L93 Difference]: Finished difference Result 779 states and 1205 transitions. [2025-03-04 00:09:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 300 [2025-03-04 00:09:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:00,208 INFO L225 Difference]: With dead ends: 779 [2025-03-04 00:09:00,208 INFO L226 Difference]: Without dead ends: 549 [2025-03-04 00:09:00,209 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-04 00:09:00,210 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 187 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:00,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 523 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-04 00:09:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2025-03-04 00:09:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 409 states have (on average 1.41320293398533) internal successors, (578), 409 states have internal predecessors, (578), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-04 00:09:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2025-03-04 00:09:00,253 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 300 [2025-03-04 00:09:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:00,255 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2025-03-04 00:09:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2025-03-04 00:09:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:09:00,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:00,260 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:00,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:09:00,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1394518820, now seen corresponding path program 1 times [2025-03-04 00:09:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045898609] [2025-03-04 00:09:00,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:00,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:00,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:00,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:00,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045898609] [2025-03-04 00:09:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045898609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008418162] [2025-03-04 00:09:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:01,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:01,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:01,488 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:01,774 INFO L93 Difference]: Finished difference Result 1457 states and 2252 transitions. [2025-03-04 00:09:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 300 [2025-03-04 00:09:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:01,781 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 00:09:01,781 INFO L226 Difference]: Without dead ends: 1001 [2025-03-04 00:09:01,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:01,787 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 228 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:01,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 946 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-04 00:09:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 997. [2025-03-04 00:09:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 771 states have (on average 1.4215304798962387) internal successors, (1096), 771 states have internal predecessors, (1096), 220 states have call successors, (220), 5 states have call predecessors, (220), 5 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-04 00:09:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1536 transitions. [2025-03-04 00:09:01,881 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1536 transitions. Word has length 300 [2025-03-04 00:09:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:01,882 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1536 transitions. [2025-03-04 00:09:01,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1536 transitions. [2025-03-04 00:09:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:09:01,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:01,886 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:09:01,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1425538627, now seen corresponding path program 1 times [2025-03-04 00:09:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693914536] [2025-03-04 00:09:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:01,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:02,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:02,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 39 proven. 90 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693914536] [2025-03-04 00:09:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693914536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455131921] [2025-03-04 00:09:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:02,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:02,705 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-04 00:09:02,707 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-04 00:09:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:02,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:09:02,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1629 proven. 90 refuted. 0 times theorem prover too weak. 2065 trivial. 0 not checked. [2025-03-04 00:09:03,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 39 proven. 90 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:03,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455131921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:03,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2025-03-04 00:09:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569558697] [2025-03-04 00:09:03,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:09:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:09:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:09:03,933 INFO L87 Difference]: Start difference. First operand 997 states and 1536 transitions. Second operand has 16 states, 15 states have (on average 11.2) internal successors, (168), 16 states have internal predecessors, (168), 6 states have call successors, (132), 3 states have call predecessors, (132), 6 states have return successors, (132), 5 states have call predecessors, (132), 6 states have call successors, (132) [2025-03-04 00:09:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:04,978 INFO L93 Difference]: Finished difference Result 2845 states and 4346 transitions. [2025-03-04 00:09:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:09:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 11.2) internal successors, (168), 16 states have internal predecessors, (168), 6 states have call successors, (132), 3 states have call predecessors, (132), 6 states have return successors, (132), 5 states have call predecessors, (132), 6 states have call successors, (132) Word has length 300 [2025-03-04 00:09:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:04,988 INFO L225 Difference]: With dead ends: 2845 [2025-03-04 00:09:04,988 INFO L226 Difference]: Without dead ends: 1937 [2025-03-04 00:09:04,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:09:04,991 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 885 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:04,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2106 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:09:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2025-03-04 00:09:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1013. [2025-03-04 00:09:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 786 states have (on average 1.4236641221374047) internal successors, (1119), 786 states have internal predecessors, (1119), 220 states have call successors, (220), 6 states have call predecessors, (220), 6 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-04 00:09:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1559 transitions. [2025-03-04 00:09:05,079 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1559 transitions. Word has length 300 [2025-03-04 00:09:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:05,079 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1559 transitions. [2025-03-04 00:09:05,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 11.2) internal successors, (168), 16 states have internal predecessors, (168), 6 states have call successors, (132), 3 states have call predecessors, (132), 6 states have return successors, (132), 5 states have call predecessors, (132), 6 states have call successors, (132) [2025-03-04 00:09:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1559 transitions. [2025-03-04 00:09:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:09:05,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:05,084 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:05,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:05,284 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,SelfDestructingSolverStorable6 [2025-03-04 00:09:05,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:05,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:05,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1407848670, now seen corresponding path program 1 times [2025-03-04 00:09:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114778524] [2025-03-04 00:09:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:05,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 51 proven. 78 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114778524] [2025-03-04 00:09:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114778524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171865262] [2025-03-04 00:09:06,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:06,448 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-04 00:09:06,450 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-04 00:09:06,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:06,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:06,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:06,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:06,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:09:06,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2056 proven. 174 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2025-03-04 00:09:07,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 306 proven. 192 refuted. 0 times theorem prover too weak. 3286 trivial. 0 not checked. [2025-03-04 00:09:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171865262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:08,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:08,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 17] total 38 [2025-03-04 00:09:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923818328] [2025-03-04 00:09:08,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 00:09:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:08,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 00:09:08,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:09:08,870 INFO L87 Difference]: Start difference. First operand 1013 states and 1559 transitions. Second operand has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 13 states have call successors, (118), 5 states have call predecessors, (118), 11 states have return successors, (119), 12 states have call predecessors, (119), 13 states have call successors, (119) [2025-03-04 00:09:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:16,754 INFO L93 Difference]: Finished difference Result 6125 states and 8981 transitions. [2025-03-04 00:09:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2025-03-04 00:09:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 13 states have call successors, (118), 5 states have call predecessors, (118), 11 states have return successors, (119), 12 states have call predecessors, (119), 13 states have call successors, (119) Word has length 300 [2025-03-04 00:09:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:16,778 INFO L225 Difference]: With dead ends: 6125 [2025-03-04 00:09:16,778 INFO L226 Difference]: Without dead ends: 5217 [2025-03-04 00:09:16,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12522 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4921, Invalid=29119, Unknown=0, NotChecked=0, Total=34040 [2025-03-04 00:09:16,789 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 5084 mSDsluCounter, 4128 mSDsCounter, 0 mSdLazyCounter, 4992 mSolverCounterSat, 1512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5097 SdHoareTripleChecker+Valid, 4548 SdHoareTripleChecker+Invalid, 6504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1512 IncrementalHoareTripleChecker+Valid, 4992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:16,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5097 Valid, 4548 Invalid, 6504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1512 Valid, 4992 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 00:09:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2025-03-04 00:09:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 2711. [2025-03-04 00:09:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2184 states have (on average 1.3896520146520146) internal successors, (3035), 2188 states have internal predecessors, (3035), 464 states have call successors, (464), 62 states have call predecessors, (464), 62 states have return successors, (464), 460 states have call predecessors, (464), 464 states have call successors, (464) [2025-03-04 00:09:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3963 transitions. [2025-03-04 00:09:17,003 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3963 transitions. Word has length 300 [2025-03-04 00:09:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:17,004 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3963 transitions. [2025-03-04 00:09:17,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 13 states have call successors, (118), 5 states have call predecessors, (118), 11 states have return successors, (119), 12 states have call predecessors, (119), 13 states have call successors, (119) [2025-03-04 00:09:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3963 transitions. [2025-03-04 00:09:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:09:17,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:17,008 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:17,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:17,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:17,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:17,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1232975686, now seen corresponding path program 1 times [2025-03-04 00:09:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397689897] [2025-03-04 00:09:17,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:17,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:09:17,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:09:17,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:17,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397689897] [2025-03-04 00:09:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397689897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:17,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034237677] [2025-03-04 00:09:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:17,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:17,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:17,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:17,380 INFO L87 Difference]: Start difference. First operand 2711 states and 3963 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:17,517 INFO L93 Difference]: Finished difference Result 5411 states and 7934 transitions. [2025-03-04 00:09:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 300 [2025-03-04 00:09:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:17,531 INFO L225 Difference]: With dead ends: 5411 [2025-03-04 00:09:17,531 INFO L226 Difference]: Without dead ends: 3139 [2025-03-04 00:09:17,536 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-04 00:09:17,537 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 58 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:17,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 525 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2025-03-04 00:09:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2711. [2025-03-04 00:09:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2184 states have (on average 1.3823260073260073) internal successors, (3019), 2188 states have internal predecessors, (3019), 464 states have call successors, (464), 62 states have call predecessors, (464), 62 states have return successors, (464), 460 states have call predecessors, (464), 464 states have call successors, (464) [2025-03-04 00:09:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3947 transitions. [2025-03-04 00:09:17,698 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3947 transitions. Word has length 300 [2025-03-04 00:09:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:17,699 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3947 transitions. [2025-03-04 00:09:17,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3947 transitions. [2025-03-04 00:09:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-04 00:09:17,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:17,702 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:17,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:09:17,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:17,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1985785321, now seen corresponding path program 1 times [2025-03-04 00:09:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:17,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446352130] [2025-03-04 00:09:17,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:17,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 00:09:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 00:09:17,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:17,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446352130] [2025-03-04 00:09:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446352130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903661631] [2025-03-04 00:09:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:18,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:18,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:18,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:18,145 INFO L87 Difference]: Start difference. First operand 2711 states and 3947 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:18,369 INFO L93 Difference]: Finished difference Result 4963 states and 7210 transitions. [2025-03-04 00:09:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 301 [2025-03-04 00:09:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:18,381 INFO L225 Difference]: With dead ends: 4963 [2025-03-04 00:09:18,382 INFO L226 Difference]: Without dead ends: 2783 [2025-03-04 00:09:18,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:18,387 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:18,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2025-03-04 00:09:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2735. [2025-03-04 00:09:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2208 states have (on average 1.3781702898550725) internal successors, (3043), 2212 states have internal predecessors, (3043), 464 states have call successors, (464), 62 states have call predecessors, (464), 62 states have return successors, (464), 460 states have call predecessors, (464), 464 states have call successors, (464) [2025-03-04 00:09:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3971 transitions. [2025-03-04 00:09:18,653 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3971 transitions. Word has length 301 [2025-03-04 00:09:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:18,653 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 3971 transitions. [2025-03-04 00:09:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3971 transitions. [2025-03-04 00:09:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-04 00:09:18,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:18,657 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:18,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:09:18,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:18,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash 512230616, now seen corresponding path program 1 times [2025-03-04 00:09:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692381822] [2025-03-04 00:09:18,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:18,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 00:09:18,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 00:09:18,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:18,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692381822] [2025-03-04 00:09:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692381822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449623097] [2025-03-04 00:09:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:19,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:19,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:19,174 INFO L87 Difference]: Start difference. First operand 2735 states and 3971 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:19,532 INFO L93 Difference]: Finished difference Result 6233 states and 9038 transitions. [2025-03-04 00:09:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 301 [2025-03-04 00:09:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:19,548 INFO L225 Difference]: With dead ends: 6233 [2025-03-04 00:09:19,549 INFO L226 Difference]: Without dead ends: 3881 [2025-03-04 00:09:19,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:19,556 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 93 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:19,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1050 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2025-03-04 00:09:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3739. [2025-03-04 00:09:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3139 states have (on average 1.3787830519273654) internal successors, (4328), 3155 states have internal predecessors, (4328), 524 states have call successors, (524), 75 states have call predecessors, (524), 75 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5376 transitions. [2025-03-04 00:09:19,793 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5376 transitions. Word has length 301 [2025-03-04 00:09:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:19,794 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 5376 transitions. [2025-03-04 00:09:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-04 00:09:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5376 transitions. [2025-03-04 00:09:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:19,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:19,804 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:19,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:09:19,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:19,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -487503666, now seen corresponding path program 1 times [2025-03-04 00:09:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664338130] [2025-03-04 00:09:19,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:19,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:19,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664338130] [2025-03-04 00:09:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664338130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74354161] [2025-03-04 00:09:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:20,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:20,471 INFO L87 Difference]: Start difference. First operand 3739 states and 5376 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:21,045 INFO L93 Difference]: Finished difference Result 7421 states and 10719 transitions. [2025-03-04 00:09:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:09:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 302 [2025-03-04 00:09:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:21,070 INFO L225 Difference]: With dead ends: 7421 [2025-03-04 00:09:21,070 INFO L226 Difference]: Without dead ends: 4897 [2025-03-04 00:09:21,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:09:21,081 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 526 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:21,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1340 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2025-03-04 00:09:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 3739. [2025-03-04 00:09:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3139 states have (on average 1.3781459063395987) internal successors, (4326), 3155 states have internal predecessors, (4326), 524 states have call successors, (524), 75 states have call predecessors, (524), 75 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5374 transitions. [2025-03-04 00:09:21,452 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5374 transitions. Word has length 302 [2025-03-04 00:09:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:21,453 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 5374 transitions. [2025-03-04 00:09:21,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5374 transitions. [2025-03-04 00:09:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:21,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:21,459 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:21,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:09:21,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:21,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2106723151, now seen corresponding path program 1 times [2025-03-04 00:09:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962941187] [2025-03-04 00:09:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:21,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962941187] [2025-03-04 00:09:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962941187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:09:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843733412] [2025-03-04 00:09:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:22,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:09:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:09:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:09:22,690 INFO L87 Difference]: Start difference. First operand 3739 states and 5374 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-04 00:09:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:24,223 INFO L93 Difference]: Finished difference Result 8297 states and 11989 transitions. [2025-03-04 00:09:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:09:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 302 [2025-03-04 00:09:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:24,239 INFO L225 Difference]: With dead ends: 8297 [2025-03-04 00:09:24,239 INFO L226 Difference]: Without dead ends: 5781 [2025-03-04 00:09:24,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:09:24,245 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1184 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:24,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1789 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:09:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5781 states. [2025-03-04 00:09:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5781 to 4145. [2025-03-04 00:09:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 3542 states have (on average 1.3893280632411067) internal successors, (4921), 3558 states have internal predecessors, (4921), 524 states have call successors, (524), 78 states have call predecessors, (524), 78 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 5969 transitions. [2025-03-04 00:09:24,497 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 5969 transitions. Word has length 302 [2025-03-04 00:09:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:24,528 INFO L471 AbstractCegarLoop]: Abstraction has 4145 states and 5969 transitions. [2025-03-04 00:09:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-04 00:09:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 5969 transitions. [2025-03-04 00:09:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:24,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:24,537 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:24,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:09:24,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:24,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1658026512, now seen corresponding path program 1 times [2025-03-04 00:09:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162797284] [2025-03-04 00:09:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:24,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:24,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-04 00:09:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162797284] [2025-03-04 00:09:25,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162797284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:25,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:25,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266270401] [2025-03-04 00:09:25,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:25,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:25,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:25,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:25,531 INFO L87 Difference]: Start difference. First operand 4145 states and 5969 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:26,174 INFO L93 Difference]: Finished difference Result 7531 states and 10900 transitions. [2025-03-04 00:09:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:09:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 302 [2025-03-04 00:09:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:26,187 INFO L225 Difference]: With dead ends: 7531 [2025-03-04 00:09:26,187 INFO L226 Difference]: Without dead ends: 5015 [2025-03-04 00:09:26,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:26,192 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 532 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:26,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1368 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2025-03-04 00:09:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 4141. [2025-03-04 00:09:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 3538 states have (on average 1.3892029395138497) internal successors, (4915), 3554 states have internal predecessors, (4915), 524 states have call successors, (524), 78 states have call predecessors, (524), 78 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 5963 transitions. [2025-03-04 00:09:26,411 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 5963 transitions. Word has length 302 [2025-03-04 00:09:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:26,412 INFO L471 AbstractCegarLoop]: Abstraction has 4141 states and 5963 transitions. [2025-03-04 00:09:26,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:09:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 5963 transitions. [2025-03-04 00:09:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:26,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:26,416 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:09:26,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1009912967, now seen corresponding path program 1 times [2025-03-04 00:09:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209093119] [2025-03-04 00:09:26,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 99 proven. 30 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209093119] [2025-03-04 00:09:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209093119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638150134] [2025-03-04 00:09:27,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:27,120 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-04 00:09:27,122 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-04 00:09:27,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:27,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:27,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:27,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:27,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:09:27,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1429 proven. 30 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2025-03-04 00:09:27,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 99 proven. 30 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:27,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638150134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:27,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:27,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 00:09:27,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100033700] [2025-03-04 00:09:27,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:27,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:09:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:27,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:09:27,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:27,650 INFO L87 Difference]: Start difference. First operand 4141 states and 5963 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:28,536 INFO L93 Difference]: Finished difference Result 10122 states and 14453 transitions. [2025-03-04 00:09:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:09:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 302 [2025-03-04 00:09:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:28,555 INFO L225 Difference]: With dead ends: 10122 [2025-03-04 00:09:28,555 INFO L226 Difference]: Without dead ends: 6303 [2025-03-04 00:09:28,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 602 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:09:28,563 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1166 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:28,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 735 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6303 states. [2025-03-04 00:09:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6303 to 3155. [2025-03-04 00:09:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 2543 states have (on average 1.3389697208022022) internal successors, (3405), 2559 states have internal predecessors, (3405), 524 states have call successors, (524), 87 states have call predecessors, (524), 87 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 4453 transitions. [2025-03-04 00:09:28,854 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 4453 transitions. Word has length 302 [2025-03-04 00:09:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:28,854 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 4453 transitions. [2025-03-04 00:09:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 4453 transitions. [2025-03-04 00:09:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:28,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:28,857 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:28,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:09:29,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 499941334, now seen corresponding path program 1 times [2025-03-04 00:09:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414755814] [2025-03-04 00:09:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:29,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:29,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:29,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:29,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-04 00:09:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414755814] [2025-03-04 00:09:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414755814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450957270] [2025-03-04 00:09:29,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:29,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:29,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:29,805 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:29,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:09:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:30,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:30,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 00:09:30,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2508 proven. 183 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-03-04 00:09:31,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 186 proven. 192 refuted. 0 times theorem prover too weak. 3406 trivial. 0 not checked. [2025-03-04 00:09:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450957270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:32,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 36 [2025-03-04 00:09:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409960091] [2025-03-04 00:09:32,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:32,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 00:09:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:32,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 00:09:32,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1003, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 00:09:32,119 INFO L87 Difference]: Start difference. First operand 3155 states and 4453 transitions. Second operand has 36 states, 33 states have (on average 5.848484848484849) internal successors, (193), 34 states have internal predecessors, (193), 14 states have call successors, (132), 6 states have call predecessors, (132), 11 states have return successors, (132), 11 states have call predecessors, (132), 14 states have call successors, (132) [2025-03-04 00:09:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:33,699 INFO L93 Difference]: Finished difference Result 6727 states and 9467 transitions. [2025-03-04 00:09:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:09:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 5.848484848484849) internal successors, (193), 34 states have internal predecessors, (193), 14 states have call successors, (132), 6 states have call predecessors, (132), 11 states have return successors, (132), 11 states have call predecessors, (132), 14 states have call successors, (132) Word has length 302 [2025-03-04 00:09:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:33,710 INFO L225 Difference]: With dead ends: 6727 [2025-03-04 00:09:33,710 INFO L226 Difference]: Without dead ends: 3713 [2025-03-04 00:09:33,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=865, Invalid=2557, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 00:09:33,716 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1430 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:33,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 1653 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:09:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2025-03-04 00:09:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3163. [2025-03-04 00:09:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 2549 states have (on average 1.3366025892506865) internal successors, (3407), 2565 states have internal predecessors, (3407), 524 states have call successors, (524), 89 states have call predecessors, (524), 89 states have return successors, (524), 508 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 00:09:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4455 transitions. [2025-03-04 00:09:34,021 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4455 transitions. Word has length 302 [2025-03-04 00:09:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:34,021 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 4455 transitions. [2025-03-04 00:09:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 5.848484848484849) internal successors, (193), 34 states have internal predecessors, (193), 14 states have call successors, (132), 6 states have call predecessors, (132), 11 states have return successors, (132), 11 states have call predecessors, (132), 14 states have call successors, (132) [2025-03-04 00:09:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4455 transitions. [2025-03-04 00:09:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:34,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:34,024 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:34,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:09:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:09:34,225 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -524752587, now seen corresponding path program 1 times [2025-03-04 00:09:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347682789] [2025-03-04 00:09:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:34,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:34,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:34,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:34,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 81 proven. 171 refuted. 0 times theorem prover too weak. 3532 trivial. 0 not checked. [2025-03-04 00:09:35,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347682789] [2025-03-04 00:09:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347682789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336689433] [2025-03-04 00:09:35,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:35,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:35,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:09:35,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:35,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:35,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:09:35,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1695 proven. 252 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2025-03-04 00:09:36,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336689433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:37,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:09:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2025-03-04 00:09:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421671460] [2025-03-04 00:09:37,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:37,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:09:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:37,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:09:37,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:09:37,305 INFO L87 Difference]: Start difference. First operand 3163 states and 4455 transitions. Second operand has 23 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 7 states have call successors, (88), 5 states have call predecessors, (88), 7 states have return successors, (88), 6 states have call predecessors, (88), 7 states have call successors, (88) [2025-03-04 00:09:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:39,059 INFO L93 Difference]: Finished difference Result 10079 states and 14023 transitions. [2025-03-04 00:09:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:09:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 7 states have call successors, (88), 5 states have call predecessors, (88), 7 states have return successors, (88), 6 states have call predecessors, (88), 7 states have call successors, (88) Word has length 302 [2025-03-04 00:09:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:39,084 INFO L225 Difference]: With dead ends: 10079 [2025-03-04 00:09:39,085 INFO L226 Difference]: Without dead ends: 7521 [2025-03-04 00:09:39,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=662, Invalid=2200, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 00:09:39,091 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 766 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:39,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 2487 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:09:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2025-03-04 00:09:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 6699. [2025-03-04 00:09:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 5356 states have (on average 1.315160567587752) internal successors, (7044), 5404 states have internal predecessors, (7044), 1148 states have call successors, (1148), 194 states have call predecessors, (1148), 194 states have return successors, (1148), 1100 states have call predecessors, (1148), 1148 states have call successors, (1148) [2025-03-04 00:09:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9340 transitions. [2025-03-04 00:09:39,832 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9340 transitions. Word has length 302 [2025-03-04 00:09:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:39,833 INFO L471 AbstractCegarLoop]: Abstraction has 6699 states and 9340 transitions. [2025-03-04 00:09:39,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 7 states have call successors, (88), 5 states have call predecessors, (88), 7 states have return successors, (88), 6 states have call predecessors, (88), 7 states have call successors, (88) [2025-03-04 00:09:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9340 transitions. [2025-03-04 00:09:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:39,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:39,836 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:39,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:09:40,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 00:09:40,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1973263350, now seen corresponding path program 1 times [2025-03-04 00:09:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033962527] [2025-03-04 00:09:40,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:40,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:40,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:40,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:40,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 225 proven. 255 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-03-04 00:09:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033962527] [2025-03-04 00:09:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033962527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633180017] [2025-03-04 00:09:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:43,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:43,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:43,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:43,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:09:43,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:43,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:43,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:43,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:43,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-04 00:09:43,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2180 proven. 507 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2025-03-04 00:09:48,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633180017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:50,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:09:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 38] total 56 [2025-03-04 00:09:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391071623] [2025-03-04 00:09:50,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:50,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 00:09:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:50,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 00:09:50,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=3837, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 00:09:50,923 INFO L87 Difference]: Start difference. First operand 6699 states and 9340 transitions. Second operand has 56 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 50 states have internal predecessors, (193), 20 states have call successors, (88), 11 states have call predecessors, (88), 15 states have return successors, (88), 16 states have call predecessors, (88), 20 states have call successors, (88) [2025-03-04 00:09:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:56,821 INFO L93 Difference]: Finished difference Result 13647 states and 18924 transitions. [2025-03-04 00:09:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 00:09:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 50 states have internal predecessors, (193), 20 states have call successors, (88), 11 states have call predecessors, (88), 15 states have return successors, (88), 16 states have call predecessors, (88), 20 states have call successors, (88) Word has length 302 [2025-03-04 00:09:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:56,843 INFO L225 Difference]: With dead ends: 13647 [2025-03-04 00:09:56,843 INFO L226 Difference]: Without dead ends: 7481 [2025-03-04 00:09:56,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2488, Invalid=13514, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 00:09:56,857 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2974 mSDsluCounter, 3762 mSDsCounter, 0 mSdLazyCounter, 4600 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 4600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:56,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 3930 Invalid, 5096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 4600 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 00:09:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2025-03-04 00:09:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 6647. [2025-03-04 00:09:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6647 states, 5301 states have (on average 1.309375589511413) internal successors, (6941), 5349 states have internal predecessors, (6941), 1148 states have call successors, (1148), 197 states have call predecessors, (1148), 197 states have return successors, (1148), 1100 states have call predecessors, (1148), 1148 states have call successors, (1148) [2025-03-04 00:09:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6647 states to 6647 states and 9237 transitions. [2025-03-04 00:09:57,565 INFO L78 Accepts]: Start accepts. Automaton has 6647 states and 9237 transitions. Word has length 302 [2025-03-04 00:09:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 6647 states and 9237 transitions. [2025-03-04 00:09:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 50 states have internal predecessors, (193), 20 states have call successors, (88), 11 states have call predecessors, (88), 15 states have return successors, (88), 16 states have call predecessors, (88), 20 states have call successors, (88) [2025-03-04 00:09:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6647 states and 9237 transitions. [2025-03-04 00:09:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:09:57,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:57,569 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:57,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:09:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:57,770 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:57,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 828557110, now seen corresponding path program 1 times [2025-03-04 00:09:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45037591] [2025-03-04 00:09:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:58,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:58,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:58,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:09:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513087130] [2025-03-04 00:09:58,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:58,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:58,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:58,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:09:58,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:09:58,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:09:58,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:58,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:58,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 00:09:58,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2056 proven. 174 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2025-03-04 00:09:59,109 INFO L312 TraceCheckSpWp]: Computing backward predicates...