./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.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-pr-cn_file-86.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 56df4eb5f1ce718ca5531ff4f8afda450f18f02286533668c4676eba9d6cba09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:32:51,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:32:51,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:32:51,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:32:51,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:32:51,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:32:51,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:32:51,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:32:51,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:32:51,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:32:51,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:32:51,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:32:51,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:32:51,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:32:51,969 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:32:51,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:32:51,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:32:51,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:32:51,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:32:51,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:32:51,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:32:51,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:32:51,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:32:51,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:32:51,972 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 -> 56df4eb5f1ce718ca5531ff4f8afda450f18f02286533668c4676eba9d6cba09 [2025-03-08 12:32:52,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:32:52,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:32:52,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:32:52,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:32:52,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:32:52,212 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-pr-cn_file-86.i [2025-03-08 12:32:53,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d133658ed/cfad173543544223acea856caf850e8e/FLAGafd567801 [2025-03-08 12:32:53,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:32:53,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i [2025-03-08 12:32:53,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d133658ed/cfad173543544223acea856caf850e8e/FLAGafd567801 [2025-03-08 12:32:53,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d133658ed/cfad173543544223acea856caf850e8e [2025-03-08 12:32:53,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:32:53,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:32:53,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:32:53,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:32:53,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:32:53,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:53,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53, skipping insertion in model container [2025-03-08 12:32:53,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:53,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:32:53,818 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-pr-cn_file-86.i[919,932] [2025-03-08 12:32:53,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:32:53,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:32:53,919 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-pr-cn_file-86.i[919,932] [2025-03-08 12:32:53,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:32:53,970 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:32:53,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53 WrapperNode [2025-03-08 12:32:53,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:32:53,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:32:53,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:32:53,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:32:53,978 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:32:53" (1/1) ... [2025-03-08 12:32:53,986 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:32:53" (1/1) ... [2025-03-08 12:32:54,033 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-08 12:32:54,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:32:54,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:32:54,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:32:54,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:32:54,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,068 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:32:54,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:32:54,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:32:54,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:32:54,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:32:54,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (1/1) ... [2025-03-08 12:32:54,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:32:54,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:32:54,116 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:32:54,119 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:32:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:32:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:32:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:32:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:32:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:32:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:32:54,203 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:32:54,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:32:54,578 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 12:32:54,579 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:32:54,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:32:54,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:32:54,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:32:54 BoogieIcfgContainer [2025-03-08 12:32:54,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:32:54,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:32:54,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:32:54,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:32:54,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:32:53" (1/3) ... [2025-03-08 12:32:54,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66905c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:32:54, skipping insertion in model container [2025-03-08 12:32:54,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:32:53" (2/3) ... [2025-03-08 12:32:54,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66905c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:32:54, skipping insertion in model container [2025-03-08 12:32:54,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:32:54" (3/3) ... [2025-03-08 12:32:54,610 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i [2025-03-08 12:32:54,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:32:54,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:32:54,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:32:54,678 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;@51864aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:32:54,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:32:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 69 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 12:32:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:32:54,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:32:54,692 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:32:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:32:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 966090448, now seen corresponding path program 1 times [2025-03-08 12:32:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:32:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911697425] [2025-03-08 12:32:54,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:32:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:32:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:32:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:32:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:32:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:32:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 12:32:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:32:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911697425] [2025-03-08 12:32:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911697425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:32:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535023271] [2025-03-08 12:32:55,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:32:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:32:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:32:55,032 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:32:55,033 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:32:55,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:32:55,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:32:55,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:32:55,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:32:55,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:32:55,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:32:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 12:32:55,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:32:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535023271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:32:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:32:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:32:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715081197] [2025-03-08 12:32:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:32:55,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:32:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:32:55,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:32:55,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:32:55,261 INFO L87 Difference]: Start difference. First operand has 102 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 69 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:32:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:32:55,296 INFO L93 Difference]: Finished difference Result 198 states and 350 transitions. [2025-03-08 12:32:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:32:55,299 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2025-03-08 12:32:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:32:55,303 INFO L225 Difference]: With dead ends: 198 [2025-03-08 12:32:55,303 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 12:32:55,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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:32:55,308 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:32:55,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:32:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 12:32:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 12:32:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 12:32:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-03-08 12:32:55,346 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 196 [2025-03-08 12:32:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:32:55,347 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-03-08 12:32:55,347 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:32:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-03-08 12:32:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:32:55,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:32:55,351 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,359 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:32:55,552 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:32:55,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:32:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:32:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2058112719, now seen corresponding path program 1 times [2025-03-08 12:32:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:32:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065510218] [2025-03-08 12:32:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:32:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:32:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:32:55,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:32:55,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:32:55,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:32:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:32:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:32:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065510218] [2025-03-08 12:32:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065510218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:32:55,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:32:55,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:32:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255226355] [2025-03-08 12:32:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:32:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:32:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:32:55,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:32:55,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:32:55,867 INFO L87 Difference]: Start difference. First operand 99 states and 156 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:32:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:32:55,912 INFO L93 Difference]: Finished difference Result 196 states and 311 transitions. [2025-03-08 12:32:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:32:55,915 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-08 12:32:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:32:55,917 INFO L225 Difference]: With dead ends: 196 [2025-03-08 12:32:55,917 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 12:32:55,918 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:32:55,920 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:32:55,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:32:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 12:32:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 12:32:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 12:32:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2025-03-08 12:32:55,941 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 196 [2025-03-08 12:32:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:32:55,943 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2025-03-08 12:32:55,944 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:32:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2025-03-08 12:32:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:32:55,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:32:55,948 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:32:55,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:32:55,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:32:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash -729302768, now seen corresponding path program 1 times [2025-03-08 12:32:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:32:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726876062] [2025-03-08 12:32:55,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:32:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:32:55,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:32:55,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:32:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:32:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:32:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:32:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:32:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726876062] [2025-03-08 12:32:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726876062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:32:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:32:56,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:32:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419519828] [2025-03-08 12:32:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:32:56,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:32:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:32:56,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:32:56,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:32:56,238 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:32:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:32:56,491 INFO L93 Difference]: Finished difference Result 295 states and 466 transitions. [2025-03-08 12:32:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:32:56,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-08 12:32:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:32:56,495 INFO L225 Difference]: With dead ends: 295 [2025-03-08 12:32:56,496 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 12:32:56,499 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:32:56,500 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 153 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:32:56,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 516 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:32:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 12:32:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 153. [2025-03-08 12:32:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 12:32:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 240 transitions. [2025-03-08 12:32:56,531 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 240 transitions. Word has length 196 [2025-03-08 12:32:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:32:56,532 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 240 transitions. [2025-03-08 12:32:56,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:32:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 240 transitions. [2025-03-08 12:32:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:32:56,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:32:56,536 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:32:56,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:32:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:32:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash -517951855, now seen corresponding path program 1 times [2025-03-08 12:32:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:32:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737046404] [2025-03-08 12:32:56,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:32:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:32:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:32:56,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:32:56,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:32:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:01,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737046404] [2025-03-08 12:33:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737046404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:01,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:01,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 12:33:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834259914] [2025-03-08 12:33:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:01,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:33:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:01,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:33:01,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:33:01,034 INFO L87 Difference]: Start difference. First operand 153 states and 240 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:02,071 INFO L93 Difference]: Finished difference Result 395 states and 618 transitions. [2025-03-08 12:33:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 12:33:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-08 12:33:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:02,075 INFO L225 Difference]: With dead ends: 395 [2025-03-08 12:33:02,075 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 12:33:02,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2025-03-08 12:33:02,078 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 567 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:02,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1225 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:33:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 12:33:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 195. [2025-03-08 12:33:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 130 states have internal predecessors, (181), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 12:33:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 305 transitions. [2025-03-08 12:33:02,112 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 305 transitions. Word has length 196 [2025-03-08 12:33:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:02,112 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 305 transitions. [2025-03-08 12:33:02,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 305 transitions. [2025-03-08 12:33:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:33:02,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:02,116 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:33:02,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:02,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1023510480, now seen corresponding path program 1 times [2025-03-08 12:33:02,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-03-08 12:33:02,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:02,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:33:02,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:33:02,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:02,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:02,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-03-08 12:33:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314364760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:33:02,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426506774] [2025-03-08 12:33:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:02,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:33:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:02,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:33:02,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:33:02,194 INFO L87 Difference]: Start difference. First operand 195 states and 305 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:02,247 INFO L93 Difference]: Finished difference Result 388 states and 611 transitions. [2025-03-08 12:33:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:33:02,248 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-08 12:33:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:02,250 INFO L225 Difference]: With dead ends: 388 [2025-03-08 12:33:02,252 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 12:33:02,253 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:33:02,253 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 148 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:02,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 339 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:33:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 12:33:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-03-08 12:33:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 192 states have (on average 1.390625) internal successors, (267), 192 states have internal predecessors, (267), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 453 transitions. [2025-03-08 12:33:02,288 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 453 transitions. Word has length 196 [2025-03-08 12:33:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 453 transitions. [2025-03-08 12:33:02,291 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 453 transitions. [2025-03-08 12:33:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:33:02,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:02,292 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:33:02,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash -448080647, now seen corresponding path program 1 times [2025-03-08 12:33:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707072265] [2025-03-08 12:33:02,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:02,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:33:02,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:33:02,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:02,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707072265] [2025-03-08 12:33:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707072265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:05,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:05,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:33:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932743786] [2025-03-08 12:33:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:05,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:33:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:05,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:33:05,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:33:05,378 INFO L87 Difference]: Start difference. First operand 289 states and 453 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:06,302 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2025-03-08 12:33:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:33:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 12:33:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:06,306 INFO L225 Difference]: With dead ends: 376 [2025-03-08 12:33:06,306 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 12:33:06,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2025-03-08 12:33:06,309 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 513 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:06,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1251 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:33:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 12:33:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 290. [2025-03-08 12:33:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 193 states have (on average 1.38860103626943) internal successors, (268), 193 states have internal predecessors, (268), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 454 transitions. [2025-03-08 12:33:06,342 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 454 transitions. Word has length 197 [2025-03-08 12:33:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 454 transitions. [2025-03-08 12:33:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 454 transitions. [2025-03-08 12:33:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:33:06,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:06,345 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:06,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:33:06,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1525948836, now seen corresponding path program 1 times [2025-03-08 12:33:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650041295] [2025-03-08 12:33:06,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:06,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:33:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:33:06,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:06,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650041295] [2025-03-08 12:33:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650041295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:33:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745897957] [2025-03-08 12:33:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:33:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:06,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:33:06,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:33:06,512 INFO L87 Difference]: Start difference. First operand 290 states and 454 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:06,588 INFO L93 Difference]: Finished difference Result 504 states and 785 transitions. [2025-03-08 12:33:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:33:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 12:33:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:06,591 INFO L225 Difference]: With dead ends: 504 [2025-03-08 12:33:06,591 INFO L226 Difference]: Without dead ends: 310 [2025-03-08 12:33:06,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:33:06,592 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:06,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 422 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:33:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-08 12:33:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2025-03-08 12:33:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 199 states have (on average 1.3618090452261307) internal successors, (271), 199 states have internal predecessors, (271), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 457 transitions. [2025-03-08 12:33:06,615 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 457 transitions. Word has length 197 [2025-03-08 12:33:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 457 transitions. [2025-03-08 12:33:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2025-03-08 12:33:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:33:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:06,618 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:33:06,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 216861499, now seen corresponding path program 1 times [2025-03-08 12:33:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816900911] [2025-03-08 12:33:06,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:06,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:33:06,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:33:06,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:06,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816900911] [2025-03-08 12:33:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816900911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 12:33:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802648736] [2025-03-08 12:33:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 12:33:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 12:33:11,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:33:11,618 INFO L87 Difference]: Start difference. First operand 298 states and 457 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:33:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:14,478 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2025-03-08 12:33:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:33:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2025-03-08 12:33:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:14,482 INFO L225 Difference]: With dead ends: 384 [2025-03-08 12:33:14,482 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 12:33:14,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2025-03-08 12:33:14,483 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 759 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:14,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 12:33:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 12:33:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 298. [2025-03-08 12:33:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 199 states have (on average 1.3618090452261307) internal successors, (271), 199 states have internal predecessors, (271), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 457 transitions. [2025-03-08 12:33:14,504 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 457 transitions. Word has length 197 [2025-03-08 12:33:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 457 transitions. [2025-03-08 12:33:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:33:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2025-03-08 12:33:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:33:14,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:14,507 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:33:14,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 863697864, now seen corresponding path program 1 times [2025-03-08 12:33:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:14,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810521140] [2025-03-08 12:33:14,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:14,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:33:14,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:33:14,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810521140] [2025-03-08 12:33:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810521140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:33:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044312754] [2025-03-08 12:33:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:33:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:33:20,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:33:20,738 INFO L87 Difference]: Start difference. First operand 298 states and 457 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:25,999 INFO L93 Difference]: Finished difference Result 416 states and 620 transitions. [2025-03-08 12:33:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 12:33:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 12:33:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:26,002 INFO L225 Difference]: With dead ends: 416 [2025-03-08 12:33:26,002 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 12:33:26,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 12:33:26,006 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 518 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:26,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1247 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 12:33:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 12:33:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 317. [2025-03-08 12:33:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 218 states have internal predecessors, (300), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 486 transitions. [2025-03-08 12:33:26,030 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 486 transitions. Word has length 197 [2025-03-08 12:33:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 486 transitions. [2025-03-08 12:33:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 486 transitions. [2025-03-08 12:33:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:33:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:26,034 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:33:26,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 992780583, now seen corresponding path program 1 times [2025-03-08 12:33:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852377427] [2025-03-08 12:33:26,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:26,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:33:26,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:33:26,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:26,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852377427] [2025-03-08 12:33:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852377427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 12:33:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037069082] [2025-03-08 12:33:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 12:33:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:36,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 12:33:36,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:33:36,029 INFO L87 Difference]: Start difference. First operand 317 states and 486 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:47,730 INFO L93 Difference]: Finished difference Result 410 states and 614 transitions. [2025-03-08 12:33:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 12:33:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 12:33:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:47,734 INFO L225 Difference]: With dead ends: 410 [2025-03-08 12:33:47,734 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 12:33:47,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 12:33:47,735 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 523 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:47,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1292 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 12:33:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 12:33:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 317. [2025-03-08 12:33:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 218 states have internal predecessors, (300), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:33:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 486 transitions. [2025-03-08 12:33:47,760 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 486 transitions. Word has length 197 [2025-03-08 12:33:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:47,761 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 486 transitions. [2025-03-08 12:33:47,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:33:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 486 transitions. [2025-03-08 12:33:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:33:47,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:47,763 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:47,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:33:47,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 856296847, now seen corresponding path program 1 times [2025-03-08 12:33:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808079924] [2025-03-08 12:33:47,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:47,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:33:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:33:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:33:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:33:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:33:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808079924] [2025-03-08 12:33:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808079924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:33:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:33:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 12:33:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758700163] [2025-03-08 12:33:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:33:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 12:33:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:33:52,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 12:33:52,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:33:52,916 INFO L87 Difference]: Start difference. First operand 317 states and 486 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:33:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:33:58,137 INFO L93 Difference]: Finished difference Result 793 states and 1199 transitions. [2025-03-08 12:33:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 12:33:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-08 12:33:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:33:58,141 INFO L225 Difference]: With dead ends: 793 [2025-03-08 12:33:58,141 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 12:33:58,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=464, Invalid=1606, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 12:33:58,143 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 1045 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:33:58,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1985 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 12:33:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 12:33:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 416. [2025-03-08 12:33:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 284 states have (on average 1.369718309859155) internal successors, (389), 284 states have internal predecessors, (389), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 12:33:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 637 transitions. [2025-03-08 12:33:58,187 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 637 transitions. Word has length 198 [2025-03-08 12:33:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:33:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 637 transitions. [2025-03-08 12:33:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:33:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 637 transitions. [2025-03-08 12:33:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:33:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:33:58,189 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:33:58,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:33:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:33:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -537983167, now seen corresponding path program 1 times [2025-03-08 12:33:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:33:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954799897] [2025-03-08 12:33:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:33:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:33:58,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:33:58,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:33:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:33:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:34:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:34:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:34:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954799897] [2025-03-08 12:34:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954799897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:34:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:34:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 12:34:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111045009] [2025-03-08 12:34:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:34:02,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 12:34:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:34:02,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 12:34:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:34:02,176 INFO L87 Difference]: Start difference. First operand 416 states and 637 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:34:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:34:04,468 INFO L93 Difference]: Finished difference Result 521 states and 780 transitions. [2025-03-08 12:34:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 12:34:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-08 12:34:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:34:04,473 INFO L225 Difference]: With dead ends: 521 [2025-03-08 12:34:04,474 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 12:34:04,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=335, Invalid=855, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 12:34:04,475 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 573 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:34:04,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1262 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:34:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 12:34:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 428. [2025-03-08 12:34:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 296 states have (on average 1.3783783783783783) internal successors, (408), 296 states have internal predecessors, (408), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 12:34:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 656 transitions. [2025-03-08 12:34:04,519 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 656 transitions. Word has length 198 [2025-03-08 12:34:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:34:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 656 transitions. [2025-03-08 12:34:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 12:34:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 656 transitions. [2025-03-08 12:34:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:34:04,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:34:04,521 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:34:04,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:34:04,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:34:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash 98329828, now seen corresponding path program 1 times [2025-03-08 12:34:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:34:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982960190] [2025-03-08 12:34:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:34:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:34:04,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:34:04,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:34:04,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:34:04,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:34:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 12:34:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:34:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982960190] [2025-03-08 12:34:08,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982960190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:34:08,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:34:08,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 12:34:08,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449039668] [2025-03-08 12:34:08,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:34:08,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 12:34:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:34:08,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 12:34:08,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:34:08,880 INFO L87 Difference]: Start difference. First operand 428 states and 656 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:34:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:34:11,978 INFO L93 Difference]: Finished difference Result 521 states and 780 transitions. [2025-03-08 12:34:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 12:34:11,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-08 12:34:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:34:11,982 INFO L225 Difference]: With dead ends: 521 [2025-03-08 12:34:11,982 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 12:34:11,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 12:34:11,984 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 843 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:34:11,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1371 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 12:34:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 12:34:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 429. [2025-03-08 12:34:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 297 states have (on average 1.3771043771043772) internal successors, (409), 297 states have internal predecessors, (409), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 12:34:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 657 transitions. [2025-03-08 12:34:12,009 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 657 transitions. Word has length 198 [2025-03-08 12:34:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:34:12,010 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 657 transitions. [2025-03-08 12:34:12,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:34:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 657 transitions. [2025-03-08 12:34:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:34:12,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:34:12,011 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:12,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:34:12,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:34:12,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:34:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash -831386174, now seen corresponding path program 1 times [2025-03-08 12:34:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:34:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489702593] [2025-03-08 12:34:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:34:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:34:12,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:34:12,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:34:12,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:34:12,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat