./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.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 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:12:19,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:12:19,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:12:19,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:12:19,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:12:19,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:12:19,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:12:19,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:12:19,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:12:19,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:12:19,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:12:19,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:12:19,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:12:19,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:12:19,536 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:12:19,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:12:19,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:12:19,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:12:19,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:12:19,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:12:19,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:12:19,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:12:19,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:12:19,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:12:19,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:19,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:12:19,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:12:19,540 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 -> 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 [2025-03-03 20:12:19,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:12:19,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:12:19,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:12:19,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:12:19,841 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:12:19,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-03 20:12:21,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5c8e1f/821b70d511804955a3a18b41ba71ff5f/FLAGc28614c1f [2025-03-03 20:12:21,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:12:21,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-03 20:12:21,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5c8e1f/821b70d511804955a3a18b41ba71ff5f/FLAGc28614c1f [2025-03-03 20:12:21,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5c8e1f/821b70d511804955a3a18b41ba71ff5f [2025-03-03 20:12:21,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:12:21,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:12:21,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:21,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:12:21,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:12:21,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:21,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f50b427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21, skipping insertion in model container [2025-03-03 20:12:21,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:21,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:12:21,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-03-03 20:12:21,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:21,804 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:12:21,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-03-03 20:12:21,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:21,907 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:12:21,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21 WrapperNode [2025-03-03 20:12:21,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:21,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:21,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:12:21,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:12:21,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:21,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:21,999 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-03-03 20:12:22,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:22,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:12:22,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:12:22,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:12:22,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:12:22,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:12:22,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:12:22,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:12:22,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:12:22,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (1/1) ... [2025-03-03 20:12:22,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:22,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:12:22,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:12:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:12:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:12:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:12:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:12:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:12:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:12:22,295 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:12:22,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:12:23,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc property_#t~bitwise67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~bitwise70#1;havoc property_#t~short71#1; [2025-03-03 20:12:23,344 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 20:12:23,344 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:12:23,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:12:23,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:12:23,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:23 BoogieIcfgContainer [2025-03-03 20:12:23,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:12:23,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:12:23,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:12:23,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:12:23,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:12:21" (1/3) ... [2025-03-03 20:12:23,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d29330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:23, skipping insertion in model container [2025-03-03 20:12:23,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:21" (2/3) ... [2025-03-03 20:12:23,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d29330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:23, skipping insertion in model container [2025-03-03 20:12:23,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:23" (3/3) ... [2025-03-03 20:12:23,389 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-03 20:12:23,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:12:23,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i that has 2 procedures, 336 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:12:23,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:12:23,478 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;@73c24a69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:12:23,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:12:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 20:12:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-03 20:12:23,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:23,504 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:23,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2062739904, now seen corresponding path program 1 times [2025-03-03 20:12:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:23,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350070302] [2025-03-03 20:12:23,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:23,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-03 20:12:23,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-03 20:12:23,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:23,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-03 20:12:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350070302] [2025-03-03 20:12:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350070302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062203549] [2025-03-03 20:12:24,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:24,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:24,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:24,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:12:24,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-03 20:12:24,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-03 20:12:24,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:24,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:24,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:12:24,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-03 20:12:24,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:12:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062203549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:12:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:12:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792033780] [2025-03-03 20:12:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:24,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:12:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:24,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:12:24,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:24,495 INFO L87 Difference]: Start difference. First operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-03 20:12:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:24,587 INFO L93 Difference]: Finished difference Result 662 states and 1221 transitions. [2025-03-03 20:12:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:12:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 587 [2025-03-03 20:12:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:24,598 INFO L225 Difference]: With dead ends: 662 [2025-03-03 20:12:24,598 INFO L226 Difference]: Without dead ends: 329 [2025-03-03 20:12:24,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:24,606 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:24,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-03 20:12:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-03 20:12:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 238 states have (on average 1.5924369747899159) internal successors, (379), 238 states have internal predecessors, (379), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 20:12:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 557 transitions. [2025-03-03 20:12:24,689 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 557 transitions. Word has length 587 [2025-03-03 20:12:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 557 transitions. [2025-03-03 20:12:24,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-03 20:12:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 557 transitions. [2025-03-03 20:12:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-03 20:12:24,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:24,705 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:24,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:12:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:12:24,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:24,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1544642467, now seen corresponding path program 1 times [2025-03-03 20:12:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244796233] [2025-03-03 20:12:24,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:24,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-03 20:12:25,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-03 20:12:25,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:25,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:25,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244796233] [2025-03-03 20:12:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244796233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:25,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052288159] [2025-03-03 20:12:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:25,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:25,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:25,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:25,588 INFO L87 Difference]: Start difference. First operand 329 states and 557 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:25,683 INFO L93 Difference]: Finished difference Result 862 states and 1465 transitions. [2025-03-03 20:12:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-03-03 20:12:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:25,688 INFO L225 Difference]: With dead ends: 862 [2025-03-03 20:12:25,688 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 20:12:25,689 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-03 20:12:25,690 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 362 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:25,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1291 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 20:12:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-03-03 20:12:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 412 states have internal predecessors, (669), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 20:12:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 907 transitions. [2025-03-03 20:12:25,756 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 907 transitions. Word has length 587 [2025-03-03 20:12:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 907 transitions. [2025-03-03 20:12:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 907 transitions. [2025-03-03 20:12:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-03 20:12:25,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:25,767 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:25,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:12:25,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:25,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash 59586916, now seen corresponding path program 1 times [2025-03-03 20:12:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:25,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320771933] [2025-03-03 20:12:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:25,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-03 20:12:25,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-03 20:12:25,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:25,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320771933] [2025-03-03 20:12:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320771933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:26,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:26,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641688152] [2025-03-03 20:12:26,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:26,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:26,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:26,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:26,185 INFO L87 Difference]: Start difference. First operand 533 states and 907 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:26,239 INFO L93 Difference]: Finished difference Result 1065 states and 1815 transitions. [2025-03-03 20:12:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-03-03 20:12:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:26,247 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 20:12:26,247 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 20:12:26,250 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-03 20:12:26,250 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:26,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1074 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 20:12:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-03 20:12:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 413 states have (on average 1.6246973365617434) internal successors, (671), 414 states have internal predecessors, (671), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 20:12:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 909 transitions. [2025-03-03 20:12:26,283 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 909 transitions. Word has length 587 [2025-03-03 20:12:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:26,284 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 909 transitions. [2025-03-03 20:12:26,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 909 transitions. [2025-03-03 20:12:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-03 20:12:26,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:26,291 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:12:26,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:26,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 956932387, now seen corresponding path program 1 times [2025-03-03 20:12:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302030012] [2025-03-03 20:12:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:26,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-03 20:12:26,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-03 20:12:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302030012] [2025-03-03 20:12:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302030012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:26,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:26,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039802799] [2025-03-03 20:12:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:26,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:26,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:26,953 INFO L87 Difference]: Start difference. First operand 535 states and 909 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:27,056 INFO L93 Difference]: Finished difference Result 1597 states and 2717 transitions. [2025-03-03 20:12:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-03-03 20:12:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:27,063 INFO L225 Difference]: With dead ends: 1597 [2025-03-03 20:12:27,065 INFO L226 Difference]: Without dead ends: 1065 [2025-03-03 20:12:27,066 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-03 20:12:27,068 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 345 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:27,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1068 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-03 20:12:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1063. [2025-03-03 20:12:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 820 states have (on average 1.6219512195121952) internal successors, (1330), 822 states have internal predecessors, (1330), 238 states have call successors, (238), 4 states have call predecessors, (238), 4 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-03 20:12:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1806 transitions. [2025-03-03 20:12:27,159 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1806 transitions. Word has length 588 [2025-03-03 20:12:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:27,160 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1806 transitions. [2025-03-03 20:12:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1806 transitions. [2025-03-03 20:12:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-03 20:12:27,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:27,168 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:27,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:12:27,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:27,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1918546404, now seen corresponding path program 1 times [2025-03-03 20:12:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263040869] [2025-03-03 20:12:27,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:27,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-03 20:12:27,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-03 20:12:27,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:27,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263040869] [2025-03-03 20:12:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263040869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936164627] [2025-03-03 20:12:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:27,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:27,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:27,729 INFO L87 Difference]: Start difference. First operand 1063 states and 1806 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:28,277 INFO L93 Difference]: Finished difference Result 3293 states and 5495 transitions. [2025-03-03 20:12:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:28,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-03-03 20:12:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:28,292 INFO L225 Difference]: With dead ends: 3293 [2025-03-03 20:12:28,292 INFO L226 Difference]: Without dead ends: 2233 [2025-03-03 20:12:28,297 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-03 20:12:28,298 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 577 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:28,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 2024 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2025-03-03 20:12:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2225. [2025-03-03 20:12:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1592 states have (on average 1.5339195979899498) internal successors, (2442), 1602 states have internal predecessors, (2442), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 610 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-03 20:12:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3682 transitions. [2025-03-03 20:12:28,511 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3682 transitions. Word has length 588 [2025-03-03 20:12:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3682 transitions. [2025-03-03 20:12:28,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3682 transitions. [2025-03-03 20:12:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:12:28,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:28,522 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:12:28,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:28,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1860873528, now seen corresponding path program 1 times [2025-03-03 20:12:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930002008] [2025-03-03 20:12:28,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:28,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:12:28,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:12:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930002008] [2025-03-03 20:12:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930002008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709461893] [2025-03-03 20:12:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:28,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:28,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:28,709 INFO L87 Difference]: Start difference. First operand 2225 states and 3682 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:28,995 INFO L93 Difference]: Finished difference Result 5985 states and 9806 transitions. [2025-03-03 20:12:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-03 20:12:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:29,026 INFO L225 Difference]: With dead ends: 5985 [2025-03-03 20:12:29,027 INFO L226 Difference]: Without dead ends: 3763 [2025-03-03 20:12:29,033 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-03 20:12:29,034 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 304 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:29,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1086 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-03 20:12:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3757. [2025-03-03 20:12:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3757 states, 2532 states have (on average 1.4684044233807267) internal successors, (3718), 2554 states have internal predecessors, (3718), 1200 states have call successors, (1200), 24 states have call predecessors, (1200), 24 states have return successors, (1200), 1178 states have call predecessors, (1200), 1200 states have call successors, (1200) [2025-03-03 20:12:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 6118 transitions. [2025-03-03 20:12:29,409 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 6118 transitions. Word has length 589 [2025-03-03 20:12:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:29,411 INFO L471 AbstractCegarLoop]: Abstraction has 3757 states and 6118 transitions. [2025-03-03 20:12:29,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 6118 transitions. [2025-03-03 20:12:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:12:29,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:29,417 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:29,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:29,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:29,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1793866775, now seen corresponding path program 1 times [2025-03-03 20:12:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:29,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877334775] [2025-03-03 20:12:29,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:29,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:12:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:12:29,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:29,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877334775] [2025-03-03 20:12:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877334775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:12:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643491159] [2025-03-03 20:12:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:12:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:12:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:12:30,573 INFO L87 Difference]: Start difference. First operand 3757 states and 6118 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-03 20:12:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:33,332 INFO L93 Difference]: Finished difference Result 22076 states and 35777 transitions. [2025-03-03 20:12:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:12:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 589 [2025-03-03 20:12:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:33,484 INFO L225 Difference]: With dead ends: 22076 [2025-03-03 20:12:33,484 INFO L226 Difference]: Without dead ends: 18322 [2025-03-03 20:12:33,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:12:33,520 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 5021 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5021 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:33,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5021 Valid, 2414 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:12:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2025-03-03 20:12:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 16037. [2025-03-03 20:12:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16037 states, 12004 states have (on average 1.5254915028323892) internal successors, (18312), 12120 states have internal predecessors, (18312), 3912 states have call successors, (3912), 120 states have call predecessors, (3912), 120 states have return successors, (3912), 3796 states have call predecessors, (3912), 3912 states have call successors, (3912) [2025-03-03 20:12:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 26136 transitions. [2025-03-03 20:12:34,629 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 26136 transitions. Word has length 589 [2025-03-03 20:12:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 16037 states and 26136 transitions. [2025-03-03 20:12:34,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-03 20:12:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 26136 transitions. [2025-03-03 20:12:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:12:34,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:34,645 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:34,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:34,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:34,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:34,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1345170136, now seen corresponding path program 1 times [2025-03-03 20:12:34,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:34,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73440392] [2025-03-03 20:12:34,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:34,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:34,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:12:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:12:34,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73440392] [2025-03-03 20:12:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73440392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751924851] [2025-03-03 20:12:35,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:35,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:35,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:35,481 INFO L87 Difference]: Start difference. First operand 16037 states and 26136 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:36,543 INFO L93 Difference]: Finished difference Result 35308 states and 57697 transitions. [2025-03-03 20:12:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-03 20:12:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:36,627 INFO L225 Difference]: With dead ends: 35308 [2025-03-03 20:12:36,627 INFO L226 Difference]: Without dead ends: 19274 [2025-03-03 20:12:36,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:36,673 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 964 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:36,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1676 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:12:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-03-03 20:12:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 10955. [2025-03-03 20:12:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10955 states, 8402 states have (on average 1.5615329683408712) internal successors, (13120), 8459 states have internal predecessors, (13120), 2466 states have call successors, (2466), 86 states have call predecessors, (2466), 86 states have return successors, (2466), 2409 states have call predecessors, (2466), 2466 states have call successors, (2466) [2025-03-03 20:12:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10955 states to 10955 states and 18052 transitions. [2025-03-03 20:12:37,589 INFO L78 Accepts]: Start accepts. Automaton has 10955 states and 18052 transitions. Word has length 589 [2025-03-03 20:12:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:37,590 INFO L471 AbstractCegarLoop]: Abstraction has 10955 states and 18052 transitions. [2025-03-03 20:12:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10955 states and 18052 transitions. [2025-03-03 20:12:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:12:37,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:37,602 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:37,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:37,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:37,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash -999496905, now seen corresponding path program 1 times [2025-03-03 20:12:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006482124] [2025-03-03 20:12:37,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:37,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:12:37,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:12:37,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006482124] [2025-03-03 20:12:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006482124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:12:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848325415] [2025-03-03 20:12:39,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:39,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:12:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:39,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:12:39,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:39,205 INFO L87 Difference]: Start difference. First operand 10955 states and 18052 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:44,954 INFO L93 Difference]: Finished difference Result 81343 states and 133591 transitions. [2025-03-03 20:12:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:12:44,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-03 20:12:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:45,205 INFO L225 Difference]: With dead ends: 81343 [2025-03-03 20:12:45,205 INFO L226 Difference]: Without dead ends: 70445 [2025-03-03 20:12:45,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:12:45,244 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 3221 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3221 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:45,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3221 Valid, 2741 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:12:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70445 states. [2025-03-03 20:12:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70445 to 30955. [2025-03-03 20:12:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30955 states, 25305 states have (on average 1.5985378383718634) internal successors, (40451), 25482 states have internal predecessors, (40451), 5418 states have call successors, (5418), 231 states have call predecessors, (5418), 231 states have return successors, (5418), 5241 states have call predecessors, (5418), 5418 states have call successors, (5418) [2025-03-03 20:12:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 51287 transitions. [2025-03-03 20:12:47,837 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 51287 transitions. Word has length 589 [2025-03-03 20:12:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:47,838 INFO L471 AbstractCegarLoop]: Abstraction has 30955 states and 51287 transitions. [2025-03-03 20:12:47,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 51287 transitions. [2025-03-03 20:12:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:12:47,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:47,869 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:47,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:47,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:47,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -369038280, now seen corresponding path program 1 times [2025-03-03 20:12:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:47,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396422617] [2025-03-03 20:12:47,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:47,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:12:48,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:12:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:12:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396422617] [2025-03-03 20:12:49,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396422617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:49,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:49,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:12:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800464642] [2025-03-03 20:12:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:49,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:12:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:49,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:12:49,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:49,233 INFO L87 Difference]: Start difference. First operand 30955 states and 51287 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:12:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:59,224 INFO L93 Difference]: Finished difference Result 161459 states and 266613 transitions. [2025-03-03 20:12:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:12:59,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-03 20:12:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:59,653 INFO L225 Difference]: With dead ends: 161459 [2025-03-03 20:12:59,654 INFO L226 Difference]: Without dead ends: 130565 [2025-03-03 20:12:59,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:12:59,738 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 3530 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3530 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:59,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3530 Valid, 2226 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:12:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130565 states. [2025-03-03 20:13:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130565 to 74823. [2025-03-03 20:13:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74823 states, 62069 states have (on average 1.6102563276353736) internal successors, (99947), 62482 states have internal predecessors, (99947), 12234 states have call successors, (12234), 519 states have call predecessors, (12234), 519 states have return successors, (12234), 11821 states have call predecessors, (12234), 12234 states have call successors, (12234) [2025-03-03 20:13:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74823 states to 74823 states and 124415 transitions. [2025-03-03 20:13:05,959 INFO L78 Accepts]: Start accepts. Automaton has 74823 states and 124415 transitions. Word has length 589 [2025-03-03 20:13:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:05,960 INFO L471 AbstractCegarLoop]: Abstraction has 74823 states and 124415 transitions. [2025-03-03 20:13:05,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:13:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 74823 states and 124415 transitions. [2025-03-03 20:13:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 20:13:06,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:06,014 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:13:06,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 511546746, now seen corresponding path program 1 times [2025-03-03 20:13:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441313525] [2025-03-03 20:13:06,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:06,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 20:13:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 20:13:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:06,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-03 20:13:07,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441313525] [2025-03-03 20:13:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441313525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:07,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:13:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923229499] [2025-03-03 20:13:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:13:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:13:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:13:07,618 INFO L87 Difference]: Start difference. First operand 74823 states and 124415 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-03 20:13:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:26,379 INFO L93 Difference]: Finished difference Result 283037 states and 466556 transitions. [2025-03-03 20:13:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:13:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-03 20:13:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:27,314 INFO L225 Difference]: With dead ends: 283037 [2025-03-03 20:13:27,315 INFO L226 Difference]: Without dead ends: 208275 [2025-03-03 20:13:27,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:13:27,490 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2911 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:27,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2911 Valid, 3348 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:13:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208275 states.