./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-18.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 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:26:08,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:26:08,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:26:08,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:26:08,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:26:08,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:26:08,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:26:08,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:26:08,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:26:08,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:26:08,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:26:08,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:26:08,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:26:08,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:26:08,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:26:08,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:26:08,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:26:08,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:26:08,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:26:08,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:26:08,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:26:08,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:26:08,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:26:08,157 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 -> 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 [2025-03-17 04:26:08,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:26:08,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:26:08,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:26:08,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:26:08,419 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:26:08,420 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-18.i [2025-03-17 04:26:09,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9f9ef7e/02162f32fb664237ab31a0cb7f6dda2a/FLAGd34a2eba4 [2025-03-17 04:26:09,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:26:09,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i [2025-03-17 04:26:09,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9f9ef7e/02162f32fb664237ab31a0cb7f6dda2a/FLAGd34a2eba4 [2025-03-17 04:26:10,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9f9ef7e/02162f32fb664237ab31a0cb7f6dda2a [2025-03-17 04:26:10,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:26:10,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:26:10,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:26:10,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:26:10,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:26:10,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fa92b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10, skipping insertion in model container [2025-03-17 04:26:10,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:26:10,277 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-18.i[916,929] [2025-03-17 04:26:10,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:26:10,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:26:10,414 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-18.i[916,929] [2025-03-17 04:26:10,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:26:10,497 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:26:10,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10 WrapperNode [2025-03-17 04:26:10,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:26:10,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:26:10,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:26:10,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:26:10,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,570 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-03-17 04:26:10,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:26:10,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:26:10,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:26:10,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:26:10,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,623 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-17 04:26:10,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:26:10,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:26:10,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:26:10,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:26:10,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (1/1) ... [2025-03-17 04:26:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:26:10,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:26:10,697 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-17 04:26:10,699 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-17 04:26:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:26:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:26:10,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:26:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:26:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:26:10,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:26:10,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:26:10,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:26:11,546 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L400: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short41#1;havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1; [2025-03-17 04:26:11,617 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-17 04:26:11,618 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:26:11,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:26:11,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:26:11,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:26:11 BoogieIcfgContainer [2025-03-17 04:26:11,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:26:11,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:26:11,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:26:11,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:26:11,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:26:10" (1/3) ... [2025-03-17 04:26:11,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e968419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:26:11, skipping insertion in model container [2025-03-17 04:26:11,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:10" (2/3) ... [2025-03-17 04:26:11,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e968419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:26:11, skipping insertion in model container [2025-03-17 04:26:11,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:26:11" (3/3) ... [2025-03-17 04:26:11,651 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-18.i [2025-03-17 04:26:11,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:26:11,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-18.i that has 2 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:26:11,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:26:11,723 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;@6ba0c9e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:26:11,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:26:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 145 states have internal predecessors, (223), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 04:26:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 04:26:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:11,751 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:11,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:11,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -198787591, now seen corresponding path program 1 times [2025-03-17 04:26:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:11,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918835386] [2025-03-17 04:26:11,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 04:26:11,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 04:26:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-17 04:26:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918835386] [2025-03-17 04:26:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918835386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:26:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771611981] [2025-03-17 04:26:12,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:26:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:26:12,187 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-17 04:26:12,188 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-17 04:26:12,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 04:26:12,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 04:26:12,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:12,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:12,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:26:12,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:26:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-17 04:26:12,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:26:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771611981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:26:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:26:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838505170] [2025-03-17 04:26:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:26:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:12,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:26:12,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:26:12,499 INFO L87 Difference]: Start difference. First operand has 198 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 145 states have internal predecessors, (223), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:26:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:12,552 INFO L93 Difference]: Finished difference Result 393 states and 699 transitions. [2025-03-17 04:26:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:26:12,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 339 [2025-03-17 04:26:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:12,561 INFO L225 Difference]: With dead ends: 393 [2025-03-17 04:26:12,561 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 04:26:12,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 340 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-17 04:26:12,566 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:12,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:26:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 04:26:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-17 04:26:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 04:26:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2025-03-17 04:26:12,627 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 339 [2025-03-17 04:26:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:12,628 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2025-03-17 04:26:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:26:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2025-03-17 04:26:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 04:26:12,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:12,637 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:12,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:26:12,838 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-17 04:26:12,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:12,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1582682308, now seen corresponding path program 1 times [2025-03-17 04:26:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860484731] [2025-03-17 04:26:12,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:12,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 04:26:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 04:26:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860484731] [2025-03-17 04:26:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860484731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:13,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:26:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7015187] [2025-03-17 04:26:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:26:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:13,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:26:13,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:26:13,186 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:13,324 INFO L93 Difference]: Finished difference Result 580 states and 945 transitions. [2025-03-17 04:26:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:26:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 339 [2025-03-17 04:26:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:13,329 INFO L225 Difference]: With dead ends: 580 [2025-03-17 04:26:13,329 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 04:26:13,330 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-17 04:26:13,331 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 286 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:13,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 647 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:26:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 04:26:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 381. [2025-03-17 04:26:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 276 states have (on average 1.4963768115942029) internal successors, (413), 276 states have internal predecessors, (413), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 04:26:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 617 transitions. [2025-03-17 04:26:13,413 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 617 transitions. Word has length 339 [2025-03-17 04:26:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 617 transitions. [2025-03-17 04:26:13,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 617 transitions. [2025-03-17 04:26:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 04:26:13,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:13,420 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:13,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:26:13,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:13,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -613101285, now seen corresponding path program 1 times [2025-03-17 04:26:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753216665] [2025-03-17 04:26:13,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:13,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:13,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 04:26:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 04:26:13,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:13,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753216665] [2025-03-17 04:26:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753216665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:13,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:26:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957265265] [2025-03-17 04:26:13,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:13,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:26:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:13,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:26:13,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:26:13,702 INFO L87 Difference]: Start difference. First operand 381 states and 617 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:13,840 INFO L93 Difference]: Finished difference Result 1135 states and 1837 transitions. [2025-03-17 04:26:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:26:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 339 [2025-03-17 04:26:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:13,850 INFO L225 Difference]: With dead ends: 1135 [2025-03-17 04:26:13,851 INFO L226 Difference]: Without dead ends: 755 [2025-03-17 04:26:13,852 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-17 04:26:13,853 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 310 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:13,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 904 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:26:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-03-17 04:26:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 383. [2025-03-17 04:26:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 278 states have (on average 1.4928057553956835) internal successors, (415), 278 states have internal predecessors, (415), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 04:26:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2025-03-17 04:26:13,913 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 339 [2025-03-17 04:26:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:13,914 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2025-03-17 04:26:13,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2025-03-17 04:26:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 04:26:13,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:13,917 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:13,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:26:13,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:13,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1096445756, now seen corresponding path program 1 times [2025-03-17 04:26:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719894961] [2025-03-17 04:26:13,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:13,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 04:26:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 04:26:14,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:14,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719894961] [2025-03-17 04:26:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719894961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:26:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960487435] [2025-03-17 04:26:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:26:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:14,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:26:14,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:26:14,322 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 04:26:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:14,385 INFO L93 Difference]: Finished difference Result 765 states and 1237 transitions. [2025-03-17 04:26:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:26:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 339 [2025-03-17 04:26:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:14,388 INFO L225 Difference]: With dead ends: 765 [2025-03-17 04:26:14,388 INFO L226 Difference]: Without dead ends: 383 [2025-03-17 04:26:14,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:26:14,393 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 280 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:14,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 299 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:26:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-17 04:26:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2025-03-17 04:26:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 276 states have (on average 1.4891304347826086) internal successors, (411), 276 states have internal predecessors, (411), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 04:26:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 615 transitions. [2025-03-17 04:26:14,436 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 615 transitions. Word has length 339 [2025-03-17 04:26:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 615 transitions. [2025-03-17 04:26:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 04:26:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 615 transitions. [2025-03-17 04:26:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:14,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:14,440 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:26:14,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1075351501, now seen corresponding path program 1 times [2025-03-17 04:26:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832113015] [2025-03-17 04:26:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:14,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:14,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832113015] [2025-03-17 04:26:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832113015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:26:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892684012] [2025-03-17 04:26:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:26:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:15,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:26:15,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:26:15,205 INFO L87 Difference]: Start difference. First operand 381 states and 615 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:26:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:15,624 INFO L93 Difference]: Finished difference Result 1049 states and 1692 transitions. [2025-03-17 04:26:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:26:15,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 340 [2025-03-17 04:26:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:15,629 INFO L225 Difference]: With dead ends: 1049 [2025-03-17 04:26:15,629 INFO L226 Difference]: Without dead ends: 669 [2025-03-17 04:26:15,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:26:15,632 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 353 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:15,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1193 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:26:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-17 04:26:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 466. [2025-03-17 04:26:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 309 states have (on average 1.4401294498381878) internal successors, (445), 309 states have internal predecessors, (445), 153 states have call successors, (153), 3 states have call predecessors, (153), 3 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-17 04:26:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 751 transitions. [2025-03-17 04:26:15,694 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 751 transitions. Word has length 340 [2025-03-17 04:26:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:15,695 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 751 transitions. [2025-03-17 04:26:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:26:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 751 transitions. [2025-03-17 04:26:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:15,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:15,700 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:26:15,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1718556694, now seen corresponding path program 1 times [2025-03-17 04:26:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990317507] [2025-03-17 04:26:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:15,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990317507] [2025-03-17 04:26:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990317507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:26:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622176805] [2025-03-17 04:26:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:26:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:16,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:26:16,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:26:16,404 INFO L87 Difference]: Start difference. First operand 466 states and 751 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:16,626 INFO L93 Difference]: Finished difference Result 1141 states and 1810 transitions. [2025-03-17 04:26:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:26:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:16,632 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 04:26:16,632 INFO L226 Difference]: Without dead ends: 761 [2025-03-17 04:26:16,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:26:16,634 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 295 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:16,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 721 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:26:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-17 04:26:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 624. [2025-03-17 04:26:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 433 states have (on average 1.4341801385681294) internal successors, (621), 435 states have internal predecessors, (621), 185 states have call successors, (185), 5 states have call predecessors, (185), 5 states have return successors, (185), 183 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-17 04:26:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 991 transitions. [2025-03-17 04:26:16,717 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 991 transitions. Word has length 340 [2025-03-17 04:26:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 991 transitions. [2025-03-17 04:26:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 991 transitions. [2025-03-17 04:26:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:16,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:16,723 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:16,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:26:16,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:16,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1120059883, now seen corresponding path program 1 times [2025-03-17 04:26:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:16,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713919262] [2025-03-17 04:26:16,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:16,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:16,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:17,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713919262] [2025-03-17 04:26:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713919262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:26:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396209040] [2025-03-17 04:26:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:35,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:26:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:35,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:26:35,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:26:35,298 INFO L87 Difference]: Start difference. First operand 624 states and 991 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:35,954 INFO L93 Difference]: Finished difference Result 1866 states and 2926 transitions. [2025-03-17 04:26:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:26:35,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:35,975 INFO L225 Difference]: With dead ends: 1866 [2025-03-17 04:26:35,975 INFO L226 Difference]: Without dead ends: 1328 [2025-03-17 04:26:35,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:26:35,977 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 388 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:35,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 991 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:26:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-03-17 04:26:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 798. [2025-03-17 04:26:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 595 states have (on average 1.4201680672268908) internal successors, (845), 601 states have internal predecessors, (845), 193 states have call successors, (193), 9 states have call predecessors, (193), 9 states have return successors, (193), 187 states have call predecessors, (193), 193 states have call successors, (193) [2025-03-17 04:26:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1231 transitions. [2025-03-17 04:26:36,058 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1231 transitions. Word has length 340 [2025-03-17 04:26:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1231 transitions. [2025-03-17 04:26:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1231 transitions. [2025-03-17 04:26:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:36,065 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:36,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:26:36,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2117132236, now seen corresponding path program 1 times [2025-03-17 04:26:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:36,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643661423] [2025-03-17 04:26:36,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:36,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:36,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:36,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643661423] [2025-03-17 04:26:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643661423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:36,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:36,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:26:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700513793] [2025-03-17 04:26:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:26:36,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:36,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:26:36,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:26:36,188 INFO L87 Difference]: Start difference. First operand 798 states and 1231 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:36,278 INFO L93 Difference]: Finished difference Result 2048 states and 3179 transitions. [2025-03-17 04:26:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:26:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:36,288 INFO L225 Difference]: With dead ends: 2048 [2025-03-17 04:26:36,288 INFO L226 Difference]: Without dead ends: 1336 [2025-03-17 04:26:36,290 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-17 04:26:36,291 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 312 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:36,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 701 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:26:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-03-17 04:26:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1334. [2025-03-17 04:26:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 993 states have (on average 1.43202416918429) internal successors, (1422), 1001 states have internal predecessors, (1422), 327 states have call successors, (327), 13 states have call predecessors, (327), 13 states have return successors, (327), 319 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-17 04:26:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 2076 transitions. [2025-03-17 04:26:36,372 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 2076 transitions. Word has length 340 [2025-03-17 04:26:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:36,373 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 2076 transitions. [2025-03-17 04:26:36,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 2076 transitions. [2025-03-17 04:26:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:36,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:36,377 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:36,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:26:36,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1667300883, now seen corresponding path program 1 times [2025-03-17 04:26:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992167721] [2025-03-17 04:26:36,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:36,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:36,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992167721] [2025-03-17 04:26:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992167721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:26:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879845199] [2025-03-17 04:26:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:26:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:52,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:26:52,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:26:52,275 INFO L87 Difference]: Start difference. First operand 1334 states and 2076 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:53,424 INFO L93 Difference]: Finished difference Result 3488 states and 5443 transitions. [2025-03-17 04:26:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:26:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:53,438 INFO L225 Difference]: With dead ends: 3488 [2025-03-17 04:26:53,438 INFO L226 Difference]: Without dead ends: 2240 [2025-03-17 04:26:53,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:26:53,443 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 672 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:53,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1307 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:26:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2025-03-17 04:26:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1928. [2025-03-17 04:26:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1315 states have (on average 1.373384030418251) internal successors, (1806), 1327 states have internal predecessors, (1806), 587 states have call successors, (587), 25 states have call predecessors, (587), 25 states have return successors, (587), 575 states have call predecessors, (587), 587 states have call successors, (587) [2025-03-17 04:26:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2980 transitions. [2025-03-17 04:26:53,569 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2980 transitions. Word has length 340 [2025-03-17 04:26:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2980 transitions. [2025-03-17 04:26:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2980 transitions. [2025-03-17 04:26:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:53,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:53,574 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:53,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:26:53,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2127380919, now seen corresponding path program 1 times [2025-03-17 04:26:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155310132] [2025-03-17 04:26:53,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:53,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:53,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:53,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155310132] [2025-03-17 04:26:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155310132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:26:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936055199] [2025-03-17 04:26:54,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:26:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:54,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:26:54,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:26:54,140 INFO L87 Difference]: Start difference. First operand 1928 states and 2980 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:55,070 INFO L93 Difference]: Finished difference Result 9188 states and 14166 transitions. [2025-03-17 04:26:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:26:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:55,109 INFO L225 Difference]: With dead ends: 9188 [2025-03-17 04:26:55,110 INFO L226 Difference]: Without dead ends: 7346 [2025-03-17 04:26:55,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:26:55,120 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 845 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:55,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1138 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:26:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2025-03-17 04:26:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 4396. [2025-03-17 04:26:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4396 states, 3223 states have (on average 1.4011790257524046) internal successors, (4516), 3247 states have internal predecessors, (4516), 1123 states have call successors, (1123), 49 states have call predecessors, (1123), 49 states have return successors, (1123), 1099 states have call predecessors, (1123), 1123 states have call successors, (1123) [2025-03-17 04:26:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 6762 transitions. [2025-03-17 04:26:55,506 INFO L78 Accepts]: Start accepts. Automaton has 4396 states and 6762 transitions. Word has length 340 [2025-03-17 04:26:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 4396 states and 6762 transitions. [2025-03-17 04:26:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4396 states and 6762 transitions. [2025-03-17 04:26:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:55,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:55,511 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:26:55,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:55,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1130308566, now seen corresponding path program 1 times [2025-03-17 04:26:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413268529] [2025-03-17 04:26:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:55,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:26:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413268529] [2025-03-17 04:26:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413268529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:26:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:26:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:26:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10285290] [2025-03-17 04:26:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:26:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:26:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:26:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:26:56,201 INFO L87 Difference]: Start difference. First operand 4396 states and 6762 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:56,821 INFO L93 Difference]: Finished difference Result 13280 states and 20042 transitions. [2025-03-17 04:26:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:26:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:26:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:56,875 INFO L225 Difference]: With dead ends: 13280 [2025-03-17 04:26:56,875 INFO L226 Difference]: Without dead ends: 8970 [2025-03-17 04:26:56,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:26:56,893 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 469 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:56,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 888 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:26:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2025-03-17 04:26:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 7128. [2025-03-17 04:26:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 5459 states have (on average 1.3998900897600293) internal successors, (7642), 5515 states have internal predecessors, (7642), 1571 states have call successors, (1571), 97 states have call predecessors, (1571), 97 states have return successors, (1571), 1515 states have call predecessors, (1571), 1571 states have call successors, (1571) [2025-03-17 04:26:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 10784 transitions. [2025-03-17 04:26:57,345 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 10784 transitions. Word has length 340 [2025-03-17 04:26:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:57,346 INFO L471 AbstractCegarLoop]: Abstraction has 7128 states and 10784 transitions. [2025-03-17 04:26:57,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:26:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 10784 transitions. [2025-03-17 04:26:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:26:57,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:57,356 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:26:57,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:26:57,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:57,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash 619774389, now seen corresponding path program 1 times [2025-03-17 04:26:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44644229] [2025-03-17 04:26:57,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:26:57,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:26:57,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:27:11,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:11,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44644229] [2025-03-17 04:27:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44644229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:11,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:11,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:27:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827491866] [2025-03-17 04:27:11,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:11,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:27:11,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:11,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:27:11,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:27:11,952 INFO L87 Difference]: Start difference. First operand 7128 states and 10784 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:27:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:13,443 INFO L93 Difference]: Finished difference Result 16306 states and 24741 transitions. [2025-03-17 04:27:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:27:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 340 [2025-03-17 04:27:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:13,475 INFO L225 Difference]: With dead ends: 16306 [2025-03-17 04:27:13,475 INFO L226 Difference]: Without dead ends: 9264 [2025-03-17 04:27:13,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:27:13,495 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 367 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:13,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1593 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:27:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9264 states. [2025-03-17 04:27:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9264 to 7380. [2025-03-17 04:27:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7380 states, 5711 states have (on average 1.401505865872877) internal successors, (8004), 5767 states have internal predecessors, (8004), 1571 states have call successors, (1571), 97 states have call predecessors, (1571), 97 states have return successors, (1571), 1515 states have call predecessors, (1571), 1571 states have call successors, (1571) [2025-03-17 04:27:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7380 states to 7380 states and 11146 transitions. [2025-03-17 04:27:13,944 INFO L78 Accepts]: Start accepts. Automaton has 7380 states and 11146 transitions. Word has length 340 [2025-03-17 04:27:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:13,945 INFO L471 AbstractCegarLoop]: Abstraction has 7380 states and 11146 transitions. [2025-03-17 04:27:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-17 04:27:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7380 states and 11146 transitions. [2025-03-17 04:27:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-17 04:27:13,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:13,952 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:27:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:27:13,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:13,953 INFO L85 PathProgramCache]: Analyzing trace with hash -393257099, now seen corresponding path program 1 times [2025-03-17 04:27:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:13,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468836062] [2025-03-17 04:27:13,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:13,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:13,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-17 04:27:14,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-17 04:27:14,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:14,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-17 04:27:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468836062] [2025-03-17 04:27:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468836062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:28,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:28,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:27:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378485100] [2025-03-17 04:27:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:28,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:27:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:28,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:27:28,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:27:28,913 INFO L87 Difference]: Start difference. First operand 7380 states and 11146 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51)