./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.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 fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:51:16,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:51:16,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:51:16,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:51:16,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:51:16,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:51:16,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:51:16,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:51:16,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:51:16,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:51:16,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:51:16,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:51:16,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:51:16,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:51:16,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:51:16,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:51:16,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:51:16,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:51:16,776 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 -> fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 [2025-03-08 12:51:16,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:51:17,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:51:17,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:51:17,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:51:17,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:51:17,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-03-08 12:51:18,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d6d0f8/72d899d939ca48fe8f98346f5c0c0de2/FLAGfc300f15e [2025-03-08 12:51:18,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:51:18,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-03-08 12:51:18,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d6d0f8/72d899d939ca48fe8f98346f5c0c0de2/FLAGfc300f15e [2025-03-08 12:51:18,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d6d0f8/72d899d939ca48fe8f98346f5c0c0de2 [2025-03-08 12:51:18,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:51:18,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:51:18,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:51:18,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:51:18,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:51:18,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:18,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e05c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18, skipping insertion in model container [2025-03-08 12:51:18,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:18,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:51:18,798 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_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2025-03-08 12:51:18,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:51:18,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:51:18,885 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_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2025-03-08 12:51:18,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:51:18,939 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:51:18,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18 WrapperNode [2025-03-08 12:51:18,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:51:18,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:51:18,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:51:18,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:51:18,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:18,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:18,993 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-08 12:51:18,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:51:18,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:51:18,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:51:18,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:51:18,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,025 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:51:19,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:51:19,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:51:19,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:51:19,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:51:19,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (1/1) ... [2025-03-08 12:51:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:51:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:51:19,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:51:19,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:51:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:51:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:51:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:51:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:51:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:51:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:51:19,149 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:51:19,150 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:51:19,429 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 12:51:19,430 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:51:19,446 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:51:19,446 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:51:19,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:51:19 BoogieIcfgContainer [2025-03-08 12:51:19,447 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:51:19,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:51:19,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:51:19,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:51:19,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:51:18" (1/3) ... [2025-03-08 12:51:19,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e22366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:51:19, skipping insertion in model container [2025-03-08 12:51:19,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:51:18" (2/3) ... [2025-03-08 12:51:19,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e22366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:51:19, skipping insertion in model container [2025-03-08 12:51:19,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:51:19" (3/3) ... [2025-03-08 12:51:19,456 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-03-08 12:51:19,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:51:19,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:51:19,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:51:19,507 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;@755975d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:51:19,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:51:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 12:51:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:51:19,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:19,521 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:19,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:19,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash 686547460, now seen corresponding path program 1 times [2025-03-08 12:51:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513836958] [2025-03-08 12:51:19,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:51:19,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:51:19,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 12:51:19,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:19,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513836958] [2025-03-08 12:51:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513836958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:51:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702624766] [2025-03-08 12:51:19,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:51:19,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:51:19,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:51:19,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:51:19,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:51:19,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:51:19,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:19,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:19,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:51:19,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:51:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 12:51:19,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:51:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702624766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:51:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:51:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86826579] [2025-03-08 12:51:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:19,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:51:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:19,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:51:19,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:51:19,957 INFO L87 Difference]: Start difference. First operand has 80 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:51:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:19,976 INFO L93 Difference]: Finished difference Result 154 states and 256 transitions. [2025-03-08 12:51:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:51:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-03-08 12:51:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:19,981 INFO L225 Difference]: With dead ends: 154 [2025-03-08 12:51:19,981 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 12:51:19,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:51:19,985 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:19,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:51:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 12:51:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 12:51:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 12:51:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-08 12:51:20,016 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 126 [2025-03-08 12:51:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-08 12:51:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:51:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-08 12:51:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:51:20,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:20,020 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:20,027 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-08 12:51:20,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:51:20,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:20,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1525375617, now seen corresponding path program 1 times [2025-03-08 12:51:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:20,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151929137] [2025-03-08 12:51:20,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:20,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:51:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:51:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151929137] [2025-03-08 12:51:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151929137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:51:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771502949] [2025-03-08 12:51:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:51:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:51:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:20,552 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:20,626 INFO L93 Difference]: Finished difference Result 206 states and 317 transitions. [2025-03-08 12:51:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 12:51:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:20,628 INFO L225 Difference]: With dead ends: 206 [2025-03-08 12:51:20,628 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 12:51:20,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:20,629 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:20,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 12:51:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-03-08 12:51:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:51:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-03-08 12:51:20,649 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 126 [2025-03-08 12:51:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:20,649 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-03-08 12:51:20,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-03-08 12:51:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 12:51:20,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:20,651 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:51:20,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1252582795, now seen corresponding path program 1 times [2025-03-08 12:51:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:20,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78453638] [2025-03-08 12:51:20,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:20,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 12:51:20,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 12:51:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:20,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78453638] [2025-03-08 12:51:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78453638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:20,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:20,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:51:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171169349] [2025-03-08 12:51:20,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:20,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:51:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:20,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:51:20,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:20,878 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:20,922 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2025-03-08 12:51:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-03-08 12:51:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:20,928 INFO L225 Difference]: With dead ends: 214 [2025-03-08 12:51:20,928 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 12:51:20,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:20,929 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:20,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:51:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 12:51:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-03-08 12:51:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:51:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2025-03-08 12:51:20,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 127 [2025-03-08 12:51:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2025-03-08 12:51:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2025-03-08 12:51:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:51:20,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:20,945 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:20,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:51:20,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:20,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1368175982, now seen corresponding path program 1 times [2025-03-08 12:51:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654104846] [2025-03-08 12:51:20,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:20,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:51:20,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:51:20,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:20,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654104846] [2025-03-08 12:51:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654104846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:51:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049375883] [2025-03-08 12:51:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:51:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:21,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:51:21,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:21,095 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:21,147 INFO L93 Difference]: Finished difference Result 271 states and 412 transitions. [2025-03-08 12:51:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-08 12:51:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:21,151 INFO L225 Difference]: With dead ends: 271 [2025-03-08 12:51:21,151 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 12:51:21,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:21,153 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:21,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 210 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:51:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 12:51:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-03-08 12:51:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 12:51:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2025-03-08 12:51:21,185 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 128 [2025-03-08 12:51:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2025-03-08 12:51:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2025-03-08 12:51:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:51:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:21,187 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:21,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:51:21,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:21,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1342921776, now seen corresponding path program 1 times [2025-03-08 12:51:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174612267] [2025-03-08 12:51:21,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:21,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:51:21,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:51:21,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:21,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174612267] [2025-03-08 12:51:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174612267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:51:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809207009] [2025-03-08 12:51:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:51:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:21,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:51:21,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:21,561 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:21,695 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2025-03-08 12:51:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:51:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-08 12:51:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:21,699 INFO L225 Difference]: With dead ends: 444 [2025-03-08 12:51:21,699 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 12:51:21,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:51:21,701 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 73 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:21,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 393 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 12:51:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 293. [2025-03-08 12:51:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.356164383561644) internal successors, (297), 221 states have internal predecessors, (297), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 431 transitions. [2025-03-08 12:51:21,732 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 431 transitions. Word has length 130 [2025-03-08 12:51:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:21,732 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 431 transitions. [2025-03-08 12:51:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 431 transitions. [2025-03-08 12:51:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:51:21,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:21,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:51:21,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1401656503, now seen corresponding path program 1 times [2025-03-08 12:51:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554936854] [2025-03-08 12:51:21,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:51:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:51:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554936854] [2025-03-08 12:51:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554936854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:22,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:22,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:51:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089026107] [2025-03-08 12:51:22,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:22,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:51:22,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:22,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:51:22,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:22,200 INFO L87 Difference]: Start difference. First operand 293 states and 431 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:22,278 INFO L93 Difference]: Finished difference Result 561 states and 831 transitions. [2025-03-08 12:51:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-08 12:51:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:22,282 INFO L225 Difference]: With dead ends: 561 [2025-03-08 12:51:22,282 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 12:51:22,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:22,286 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:22,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 193 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 12:51:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 293. [2025-03-08 12:51:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.3515981735159817) internal successors, (296), 221 states have internal predecessors, (296), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 430 transitions. [2025-03-08 12:51:22,319 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 430 transitions. Word has length 131 [2025-03-08 12:51:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:22,319 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 430 transitions. [2025-03-08 12:51:22,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 430 transitions. [2025-03-08 12:51:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:22,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:22,320 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:51:22,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash -555473017, now seen corresponding path program 1 times [2025-03-08 12:51:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882120495] [2025-03-08 12:51:22,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:22,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:22,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:22,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:22,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882120495] [2025-03-08 12:51:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882120495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:51:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512281717] [2025-03-08 12:51:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:22,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:51:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:22,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:51:22,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:51:22,533 INFO L87 Difference]: Start difference. First operand 293 states and 430 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:22,624 INFO L93 Difference]: Finished difference Result 777 states and 1154 transitions. [2025-03-08 12:51:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:51:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-08 12:51:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:22,628 INFO L225 Difference]: With dead ends: 777 [2025-03-08 12:51:22,630 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 12:51:22,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:22,631 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 80 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:22,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 368 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:51:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 12:51:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 524. [2025-03-08 12:51:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 396 states have (on average 1.3686868686868687) internal successors, (542), 400 states have internal predecessors, (542), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 12:51:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2025-03-08 12:51:22,681 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 133 [2025-03-08 12:51:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:22,682 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2025-03-08 12:51:22,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2025-03-08 12:51:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:22,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:22,684 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:22,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:51:22,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:22,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -810209562, now seen corresponding path program 1 times [2025-03-08 12:51:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346412022] [2025-03-08 12:51:22,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:22,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:22,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:22,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:22,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346412022] [2025-03-08 12:51:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346412022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:51:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208138021] [2025-03-08 12:51:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:26,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:51:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:26,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:51:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:51:26,360 INFO L87 Difference]: Start difference. First operand 524 states and 776 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:27,598 INFO L93 Difference]: Finished difference Result 837 states and 1212 transitions. [2025-03-08 12:51:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 12:51:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-03-08 12:51:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:27,604 INFO L225 Difference]: With dead ends: 837 [2025-03-08 12:51:27,605 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 12:51:27,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-08 12:51:27,607 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 525 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:27,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 705 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:51:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 12:51:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 547. [2025-03-08 12:51:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 419 states have (on average 1.369928400954654) internal successors, (574), 423 states have internal predecessors, (574), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 12:51:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 808 transitions. [2025-03-08 12:51:27,658 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 808 transitions. Word has length 133 [2025-03-08 12:51:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:27,658 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 808 transitions. [2025-03-08 12:51:27,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 808 transitions. [2025-03-08 12:51:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:27,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:27,660 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:27,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:51:27,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1103612569, now seen corresponding path program 1 times [2025-03-08 12:51:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614285859] [2025-03-08 12:51:27,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:27,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:27,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:27,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:27,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:27,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614285859] [2025-03-08 12:51:27,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614285859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:27,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:51:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724973355] [2025-03-08 12:51:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:51:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:27,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:51:27,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:51:27,807 INFO L87 Difference]: Start difference. First operand 547 states and 808 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:27,945 INFO L93 Difference]: Finished difference Result 1307 states and 1948 transitions. [2025-03-08 12:51:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:51:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-08 12:51:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:27,951 INFO L225 Difference]: With dead ends: 1307 [2025-03-08 12:51:27,951 INFO L226 Difference]: Without dead ends: 839 [2025-03-08 12:51:27,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:27,954 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:27,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 431 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-08 12:51:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 559. [2025-03-08 12:51:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.3665893271461718) internal successors, (589), 435 states have internal predecessors, (589), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 12:51:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 823 transitions. [2025-03-08 12:51:27,996 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 823 transitions. Word has length 133 [2025-03-08 12:51:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:27,996 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 823 transitions. [2025-03-08 12:51:27,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 823 transitions. [2025-03-08 12:51:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:27,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:27,998 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:51:27,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2098990088, now seen corresponding path program 1 times [2025-03-08 12:51:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585774648] [2025-03-08 12:51:27,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:28,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:28,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:28,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:28,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585774648] [2025-03-08 12:51:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585774648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 12:51:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330386828] [2025-03-08 12:51:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 12:51:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:29,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 12:51:29,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:51:29,973 INFO L87 Difference]: Start difference. First operand 559 states and 823 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:30,556 INFO L93 Difference]: Finished difference Result 929 states and 1357 transitions. [2025-03-08 12:51:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:51:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-03-08 12:51:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:30,560 INFO L225 Difference]: With dead ends: 929 [2025-03-08 12:51:30,560 INFO L226 Difference]: Without dead ends: 680 [2025-03-08 12:51:30,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:51:30,563 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 271 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:30,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 775 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:51:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-08 12:51:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 559. [2025-03-08 12:51:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.3642691415313226) internal successors, (588), 435 states have internal predecessors, (588), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 12:51:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 822 transitions. [2025-03-08 12:51:30,606 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 822 transitions. Word has length 133 [2025-03-08 12:51:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:30,606 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 822 transitions. [2025-03-08 12:51:30,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 822 transitions. [2025-03-08 12:51:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:30,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:30,608 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:30,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:51:30,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1320743739, now seen corresponding path program 1 times [2025-03-08 12:51:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793297444] [2025-03-08 12:51:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:30,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:30,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:30,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:30,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:30,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793297444] [2025-03-08 12:51:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793297444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:30,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:51:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724571146] [2025-03-08 12:51:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:51:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:30,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:51:30,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:30,691 INFO L87 Difference]: Start difference. First operand 559 states and 822 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:30,806 INFO L93 Difference]: Finished difference Result 804 states and 1187 transitions. [2025-03-08 12:51:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:51:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-08 12:51:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:30,809 INFO L225 Difference]: With dead ends: 804 [2025-03-08 12:51:30,809 INFO L226 Difference]: Without dead ends: 324 [2025-03-08 12:51:30,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:51:30,810 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 129 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:30,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 169 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-08 12:51:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2025-03-08 12:51:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 242 states have (on average 1.3057851239669422) internal successors, (316), 244 states have internal predecessors, (316), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 450 transitions. [2025-03-08 12:51:30,831 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 450 transitions. Word has length 133 [2025-03-08 12:51:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 450 transitions. [2025-03-08 12:51:30,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 450 transitions. [2025-03-08 12:51:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:30,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:30,833 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:30,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:51:30,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash -838636631, now seen corresponding path program 1 times [2025-03-08 12:51:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:30,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597347438] [2025-03-08 12:51:30,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:30,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:30,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597347438] [2025-03-08 12:51:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597347438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:51:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763715664] [2025-03-08 12:51:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:51:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:30,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:51:30,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:51:30,937 INFO L87 Difference]: Start difference. First operand 316 states and 450 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:51:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:31,049 INFO L93 Difference]: Finished difference Result 565 states and 814 transitions. [2025-03-08 12:51:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2025-03-08 12:51:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:31,051 INFO L225 Difference]: With dead ends: 565 [2025-03-08 12:51:31,051 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 12:51:31,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:31,053 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:31,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 299 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 12:51:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 316. [2025-03-08 12:51:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 244 states have internal predecessors, (315), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 449 transitions. [2025-03-08 12:51:31,071 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 449 transitions. Word has length 133 [2025-03-08 12:51:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:31,072 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 449 transitions. [2025-03-08 12:51:31,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:51:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 449 transitions. [2025-03-08 12:51:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:31,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:31,074 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:31,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:51:31,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:31,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -905643384, now seen corresponding path program 1 times [2025-03-08 12:51:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121720210] [2025-03-08 12:51:31,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:31,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:31,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:31,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:36,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121720210] [2025-03-08 12:51:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121720210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 12:51:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176226933] [2025-03-08 12:51:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 12:51:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:36,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 12:51:36,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:51:36,777 INFO L87 Difference]: Start difference. First operand 316 states and 449 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:39,700 INFO L93 Difference]: Finished difference Result 396 states and 555 transitions. [2025-03-08 12:51:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 12:51:39,700 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-03-08 12:51:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:39,702 INFO L225 Difference]: With dead ends: 396 [2025-03-08 12:51:39,702 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 12:51:39,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 12:51:39,703 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:39,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 813 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:51:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 12:51:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 352. [2025-03-08 12:51:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.3201438848920863) internal successors, (367), 280 states have internal predecessors, (367), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2025-03-08 12:51:39,723 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 133 [2025-03-08 12:51:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:39,723 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2025-03-08 12:51:39,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2025-03-08 12:51:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:51:39,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:39,724 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:39,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:51:39,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:39,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -940880953, now seen corresponding path program 1 times [2025-03-08 12:51:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705763958] [2025-03-08 12:51:39,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:39,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:51:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:51:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705763958] [2025-03-08 12:51:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705763958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 12:51:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143643465] [2025-03-08 12:51:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 12:51:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:44,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 12:51:44,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:51:44,265 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:45,873 INFO L93 Difference]: Finished difference Result 630 states and 902 transitions. [2025-03-08 12:51:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:51:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-03-08 12:51:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:45,876 INFO L225 Difference]: With dead ends: 630 [2025-03-08 12:51:45,876 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 12:51:45,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-03-08 12:51:45,877 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 280 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:45,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 725 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 12:51:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 12:51:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 352. [2025-03-08 12:51:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.3093525179856116) internal successors, (364), 280 states have internal predecessors, (364), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 498 transitions. [2025-03-08 12:51:45,896 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 498 transitions. Word has length 133 [2025-03-08 12:51:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 498 transitions. [2025-03-08 12:51:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 498 transitions. [2025-03-08 12:51:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 12:51:45,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:45,898 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 12:51:45,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 415613279, now seen corresponding path program 1 times [2025-03-08 12:51:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909887791] [2025-03-08 12:51:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:45,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:51:45,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:51:45,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:45,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:48,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:48,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909887791] [2025-03-08 12:51:48,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909887791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:48,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 12:51:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004967605] [2025-03-08 12:51:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 12:51:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 12:51:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:51:48,660 INFO L87 Difference]: Start difference. First operand 352 states and 498 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:50,410 INFO L93 Difference]: Finished difference Result 635 states and 905 transitions. [2025-03-08 12:51:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 12:51:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-03-08 12:51:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:50,413 INFO L225 Difference]: With dead ends: 635 [2025-03-08 12:51:50,413 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 12:51:50,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=998, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 12:51:50,416 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:50,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1028 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:51:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 12:51:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 360. [2025-03-08 12:51:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 286 states have (on average 1.3076923076923077) internal successors, (374), 288 states have internal predecessors, (374), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 508 transitions. [2025-03-08 12:51:50,436 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 508 transitions. Word has length 134 [2025-03-08 12:51:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:50,436 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 508 transitions. [2025-03-08 12:51:50,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 508 transitions. [2025-03-08 12:51:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 12:51:50,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:50,438 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:50,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 12:51:50,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:50,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1643586691, now seen corresponding path program 1 times [2025-03-08 12:51:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553254454] [2025-03-08 12:51:50,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:51:50,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:51:50,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:50,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:51:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553254454] [2025-03-08 12:51:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553254454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 12:51:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026690700] [2025-03-08 12:51:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 12:51:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:53,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 12:51:53,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:51:53,592 INFO L87 Difference]: Start difference. First operand 360 states and 508 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:54,388 INFO L93 Difference]: Finished difference Result 615 states and 876 transitions. [2025-03-08 12:51:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:51:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-03-08 12:51:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:54,391 INFO L225 Difference]: With dead ends: 615 [2025-03-08 12:51:54,391 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 12:51:54,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-08 12:51:54,394 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 220 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:54,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 843 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:51:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 12:51:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 351. [2025-03-08 12:51:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 277 states have (on average 1.3032490974729243) internal successors, (361), 279 states have internal predecessors, (361), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 495 transitions. [2025-03-08 12:51:54,412 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 495 transitions. Word has length 134 [2025-03-08 12:51:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 495 transitions. [2025-03-08 12:51:54,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:51:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 495 transitions. [2025-03-08 12:51:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 12:51:54,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:54,415 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:54,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 12:51:54,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:54,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 290612806, now seen corresponding path program 1 times [2025-03-08 12:51:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672888459] [2025-03-08 12:51:54,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:54,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 12:51:54,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 12:51:54,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:54,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 12:51:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672888459] [2025-03-08 12:51:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672888459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:54,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:54,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:51:54,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734917830] [2025-03-08 12:51:54,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:51:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:54,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:51:54,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:54,502 INFO L87 Difference]: Start difference. First operand 351 states and 495 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:54,546 INFO L93 Difference]: Finished difference Result 612 states and 879 transitions. [2025-03-08 12:51:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:51:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 257 [2025-03-08 12:51:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:54,548 INFO L225 Difference]: With dead ends: 612 [2025-03-08 12:51:54,548 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 12:51:54,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:51:54,549 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:51:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 12:51:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 357. [2025-03-08 12:51:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3003533568904593) internal successors, (368), 285 states have internal predecessors, (368), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 12:51:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 502 transitions. [2025-03-08 12:51:54,566 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 502 transitions. Word has length 257 [2025-03-08 12:51:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:54,566 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 502 transitions. [2025-03-08 12:51:54,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:51:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 502 transitions. [2025-03-08 12:51:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 12:51:54,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:54,568 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 12:51:54,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 568781508, now seen corresponding path program 1 times [2025-03-08 12:51:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22873200] [2025-03-08 12:51:54,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:54,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 12:51:54,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 12:51:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:51:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22873200] [2025-03-08 12:51:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22873200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:51:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383560556] [2025-03-08 12:51:54,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:54,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:51:54,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:51:54,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:51:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:51:54,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 12:51:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 12:51:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:54,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:51:54,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:51:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 1478 proven. 24 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2025-03-08 12:51:55,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:51:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 58 proven. 75 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2025-03-08 12:51:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383560556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:51:55,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:51:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2025-03-08 12:51:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32419923] [2025-03-08 12:51:55,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:51:55,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:51:55,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:55,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:51:55,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:51:55,274 INFO L87 Difference]: Start difference. First operand 357 states and 502 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) [2025-03-08 12:51:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:55,893 INFO L93 Difference]: Finished difference Result 651 states and 925 transitions. [2025-03-08 12:51:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 12:51:55,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) Word has length 258 [2025-03-08 12:51:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:55,895 INFO L225 Difference]: With dead ends: 651 [2025-03-08 12:51:55,895 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 12:51:55,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 12:51:55,897 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 448 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:55,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 830 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:51:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 12:51:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 348. [2025-03-08 12:51:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 251 states have (on average 1.247011952191235) internal successors, (313), 251 states have internal predecessors, (313), 85 states have call successors, (85), 11 states have call predecessors, (85), 11 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 12:51:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 483 transitions. [2025-03-08 12:51:55,925 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 483 transitions. Word has length 258 [2025-03-08 12:51:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:55,925 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 483 transitions. [2025-03-08 12:51:55,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) [2025-03-08 12:51:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 483 transitions. [2025-03-08 12:51:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 12:51:55,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:55,927 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:55,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:51:56,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 12:51:56,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:56,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1031216678, now seen corresponding path program 1 times [2025-03-08 12:51:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255105319] [2025-03-08 12:51:56,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:56,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 12:51:56,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 12:51:56,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-08 12:51:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255105319] [2025-03-08 12:51:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255105319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:51:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:51:56,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:51:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277952884] [2025-03-08 12:51:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:51:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:51:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:51:56,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:51:56,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:51:56,235 INFO L87 Difference]: Start difference. First operand 348 states and 483 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:51:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:51:56,384 INFO L93 Difference]: Finished difference Result 721 states and 1019 transitions. [2025-03-08 12:51:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:51:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 260 [2025-03-08 12:51:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:51:56,387 INFO L225 Difference]: With dead ends: 721 [2025-03-08 12:51:56,387 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 12:51:56,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:51:56,388 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 391 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:51:56,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 414 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:51:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 12:51:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 302. [2025-03-08 12:51:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 224 states have (on average 1.2633928571428572) internal successors, (283), 224 states have internal predecessors, (283), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:51:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 419 transitions. [2025-03-08 12:51:56,409 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 419 transitions. Word has length 260 [2025-03-08 12:51:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:51:56,409 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 419 transitions. [2025-03-08 12:51:56,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:51:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 419 transitions. [2025-03-08 12:51:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 12:51:56,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:51:56,410 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:51:56,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 12:51:56,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:51:56,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:51:56,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2028220708, now seen corresponding path program 1 times [2025-03-08 12:51:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:51:56,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886819505] [2025-03-08 12:51:56,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:51:56,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 12:51:56,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 12:51:56,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:56,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2302 backedges. 27 proven. 31 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:51:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:51:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886819505] [2025-03-08 12:51:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886819505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:51:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565241872] [2025-03-08 12:51:57,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:51:57,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:51:57,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:51:57,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:51:57,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:51:57,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 12:51:57,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 12:51:57,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:51:57,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:51:57,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:51:57,311 INFO L279 TraceCheckSpWp]: Computing forward predicates...