./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.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 bc1a39df1a1f90f10eb4303c02234273e4571ce0919d0ee86bacf184ad56a73f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:13:09,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:13:09,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:13:09,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:13:09,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:13:09,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:13:09,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:13:09,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:13:09,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:13:09,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:13:09,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:13:09,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:13:09,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:13:09,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:13:09,887 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:13:09,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:13:09,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:13:09,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:13:09,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:13:09,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:13:09,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:13:09,890 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 -> bc1a39df1a1f90f10eb4303c02234273e4571ce0919d0ee86bacf184ad56a73f [2025-03-03 20:13:10,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:13:10,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:13:10,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:13:10,122 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:13:10,122 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:13:10,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i [2025-03-03 20:13:11,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e291020/ed4552c6b6ed497680f876a7cb2785ea/FLAG947237fdc [2025-03-03 20:13:11,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:13:11,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i [2025-03-03 20:13:11,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e291020/ed4552c6b6ed497680f876a7cb2785ea/FLAG947237fdc [2025-03-03 20:13:11,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e291020/ed4552c6b6ed497680f876a7cb2785ea [2025-03-03 20:13:11,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:13:11,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:13:11,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:13:11,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:13:11,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:13:11,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:13:11" (1/1) ... [2025-03-03 20:13:11,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6882c088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:11, skipping insertion in model container [2025-03-03 20:13:11,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:13:11" (1/1) ... [2025-03-03 20:13:11,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:13:11,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i[916,929] [2025-03-03 20:13:12,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:13:12,032 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:13:12,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i[916,929] [2025-03-03 20:13:12,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:13:12,139 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:13:12,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12 WrapperNode [2025-03-03 20:13:12,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:13:12,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:13:12,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:13:12,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:13:12,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,241 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 819 [2025-03-03 20:13:12,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:13:12,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:13:12,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:13:12,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:13:12,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:13:12,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:13:12,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:13:12,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:13:12,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:13:12,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (1/1) ... [2025-03-03 20:13:12,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:13:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:13:12,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:13:12,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:13:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:13:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:13:12,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:13:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:13:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:13:12,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:13:12,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:13:12,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:13:13,395 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc property_#t~bitwise77#1; [2025-03-03 20:13:13,571 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 20:13:13,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:13:13,603 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:13:13,604 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-03 20:13:13,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:13:13 BoogieIcfgContainer [2025-03-03 20:13:13,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:13:13,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:13:13,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:13:13,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:13:13,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:13:11" (1/3) ... [2025-03-03 20:13:13,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee0e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:13:13, skipping insertion in model container [2025-03-03 20:13:13,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:13:12" (2/3) ... [2025-03-03 20:13:13,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee0e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:13:13, skipping insertion in model container [2025-03-03 20:13:13,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:13:13" (3/3) ... [2025-03-03 20:13:13,612 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-98.i [2025-03-03 20:13:13,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:13:13,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-98.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:13:13,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:13:13,693 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;@3ac2f33b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:13:13,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:13:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 242 states have internal predecessors, (384), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:13:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-03 20:13:13,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:13,726 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:13,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:13,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1322030211, now seen corresponding path program 1 times [2025-03-03 20:13:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632214961] [2025-03-03 20:13:13,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 20:13:13,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 20:13:13,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:13,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:13:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632214961] [2025-03-03 20:13:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632214961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:13:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554735623] [2025-03-03 20:13:14,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:14,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:13:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:13:14,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:13:14,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:13:14,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 20:13:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 20:13:14,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:14,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:13:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:13:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:13:14,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:13:14,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554735623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:14,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:13:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:13:14,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733057318] [2025-03-03 20:13:14,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:14,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:13:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:13:14,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:13:14,752 INFO L87 Difference]: Start difference. First operand has 346 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 242 states have internal predecessors, (384), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:13:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:14,826 INFO L93 Difference]: Finished difference Result 683 states and 1267 transitions. [2025-03-03 20:13:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:13:14,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 656 [2025-03-03 20:13:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:14,835 INFO L225 Difference]: With dead ends: 683 [2025-03-03 20:13:14,835 INFO L226 Difference]: Without dead ends: 340 [2025-03-03 20:13:14,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:13:14,842 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:14,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-03 20:13:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-03 20:13:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 236 states have (on average 1.555084745762712) internal successors, (367), 236 states have internal predecessors, (367), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:13:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2025-03-03 20:13:14,923 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 656 [2025-03-03 20:13:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:14,923 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2025-03-03 20:13:14,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:13:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2025-03-03 20:13:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:13:14,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:14,939 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:14,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:13:15,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:13:15,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2128474769, now seen corresponding path program 1 times [2025-03-03 20:13:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:15,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604590312] [2025-03-03 20:13:15,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:15,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:13:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:13:15,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:15,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604590312] [2025-03-03 20:13:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604590312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616784237] [2025-03-03 20:13:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:15,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:15,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:15,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:15,814 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:15,928 INFO L93 Difference]: Finished difference Result 885 states and 1484 transitions. [2025-03-03 20:13:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 658 [2025-03-03 20:13:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:15,934 INFO L225 Difference]: With dead ends: 885 [2025-03-03 20:13:15,934 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 20:13:15,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:15,936 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 345 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:15,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1260 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 20:13:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2025-03-03 20:13:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 375 states have (on average 1.544) internal successors, (579), 376 states have internal predecessors, (579), 167 states have call successors, (167), 2 states have call predecessors, (167), 2 states have return successors, (167), 166 states have call predecessors, (167), 167 states have call successors, (167) [2025-03-03 20:13:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 913 transitions. [2025-03-03 20:13:16,001 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 913 transitions. Word has length 658 [2025-03-03 20:13:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:16,002 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 913 transitions. [2025-03-03 20:13:16,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 913 transitions. [2025-03-03 20:13:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:13:16,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:16,016 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:16,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:13:16,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash -721351984, now seen corresponding path program 1 times [2025-03-03 20:13:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920890867] [2025-03-03 20:13:16,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:16,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:13:16,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:13:16,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920890867] [2025-03-03 20:13:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920890867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789789264] [2025-03-03 20:13:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:16,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:16,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:16,434 INFO L87 Difference]: Start difference. First operand 545 states and 913 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:16,583 INFO L93 Difference]: Finished difference Result 1627 states and 2729 transitions. [2025-03-03 20:13:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:16,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 658 [2025-03-03 20:13:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:16,601 INFO L225 Difference]: With dead ends: 1627 [2025-03-03 20:13:16,603 INFO L226 Difference]: Without dead ends: 1085 [2025-03-03 20:13:16,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:16,607 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 561 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:16,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1619 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-03 20:13:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2025-03-03 20:13:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 744 states have (on average 1.5403225806451613) internal successors, (1146), 746 states have internal predecessors, (1146), 334 states have call successors, (334), 4 states have call predecessors, (334), 4 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-03 20:13:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1814 transitions. [2025-03-03 20:13:16,766 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1814 transitions. Word has length 658 [2025-03-03 20:13:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:16,769 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1814 transitions. [2025-03-03 20:13:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1814 transitions. [2025-03-03 20:13:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-03 20:13:16,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:16,778 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:13:16,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 445457828, now seen corresponding path program 1 times [2025-03-03 20:13:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366215124] [2025-03-03 20:13:16,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:16,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-03 20:13:16,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-03 20:13:16,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:16,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366215124] [2025-03-03 20:13:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366215124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303977668] [2025-03-03 20:13:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:17,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:17,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:17,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:17,065 INFO L87 Difference]: Start difference. First operand 1083 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:17,196 INFO L93 Difference]: Finished difference Result 2927 states and 4904 transitions. [2025-03-03 20:13:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 659 [2025-03-03 20:13:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:17,208 INFO L225 Difference]: With dead ends: 2927 [2025-03-03 20:13:17,208 INFO L226 Difference]: Without dead ends: 1847 [2025-03-03 20:13:17,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:17,212 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 320 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:17,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1084 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-03-03 20:13:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1841. [2025-03-03 20:13:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1330 states have (on average 1.5548872180451128) internal successors, (2068), 1336 states have internal predecessors, (2068), 502 states have call successors, (502), 8 states have call predecessors, (502), 8 states have return successors, (502), 496 states have call predecessors, (502), 502 states have call successors, (502) [2025-03-03 20:13:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 3072 transitions. [2025-03-03 20:13:17,354 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 3072 transitions. Word has length 659 [2025-03-03 20:13:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 3072 transitions. [2025-03-03 20:13:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3072 transitions. [2025-03-03 20:13:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:17,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:17,362 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:17,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:13:17,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash -821833959, now seen corresponding path program 1 times [2025-03-03 20:13:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744022247] [2025-03-03 20:13:17,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:17,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:17,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744022247] [2025-03-03 20:13:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744022247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:17,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421291922] [2025-03-03 20:13:17,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:17,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:17,627 INFO L87 Difference]: Start difference. First operand 1841 states and 3072 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:17,810 INFO L93 Difference]: Finished difference Result 4981 states and 8244 transitions. [2025-03-03 20:13:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:17,836 INFO L225 Difference]: With dead ends: 4981 [2025-03-03 20:13:17,837 INFO L226 Difference]: Without dead ends: 3143 [2025-03-03 20:13:17,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:17,846 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 341 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:17,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1096 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-03-03 20:13:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3139. [2025-03-03 20:13:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 2130 states have (on average 1.4929577464788732) internal successors, (3180), 2144 states have internal predecessors, (3180), 992 states have call successors, (992), 16 states have call predecessors, (992), 16 states have return successors, (992), 978 states have call predecessors, (992), 992 states have call successors, (992) [2025-03-03 20:13:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 5164 transitions. [2025-03-03 20:13:18,117 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 5164 transitions. Word has length 660 [2025-03-03 20:13:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:18,119 INFO L471 AbstractCegarLoop]: Abstraction has 3139 states and 5164 transitions. [2025-03-03 20:13:18,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 5164 transitions. [2025-03-03 20:13:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:18,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:18,127 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:13:18,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 422930522, now seen corresponding path program 1 times [2025-03-03 20:13:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433706951] [2025-03-03 20:13:18,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:18,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:18,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:18,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:18,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433706951] [2025-03-03 20:13:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433706951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:18,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:18,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:13:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76735596] [2025-03-03 20:13:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:18,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:13:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:18,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:13:18,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:18,658 INFO L87 Difference]: Start difference. First operand 3139 states and 5164 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:19,282 INFO L93 Difference]: Finished difference Result 9251 states and 15202 transitions. [2025-03-03 20:13:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:13:19,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:19,318 INFO L225 Difference]: With dead ends: 9251 [2025-03-03 20:13:19,318 INFO L226 Difference]: Without dead ends: 6115 [2025-03-03 20:13:19,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:19,332 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 859 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:19,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1525 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:13:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6115 states. [2025-03-03 20:13:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6115 to 6041. [2025-03-03 20:13:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6041 states, 4024 states have (on average 1.4696819085487078) internal successors, (5914), 4052 states have internal predecessors, (5914), 1984 states have call successors, (1984), 32 states have call predecessors, (1984), 32 states have return successors, (1984), 1956 states have call predecessors, (1984), 1984 states have call successors, (1984) [2025-03-03 20:13:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6041 states to 6041 states and 9882 transitions. [2025-03-03 20:13:19,794 INFO L78 Accepts]: Start accepts. Automaton has 6041 states and 9882 transitions. Word has length 660 [2025-03-03 20:13:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 6041 states and 9882 transitions. [2025-03-03 20:13:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6041 states and 9882 transitions. [2025-03-03 20:13:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:19,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:19,802 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:19,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:13:19,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -930379175, now seen corresponding path program 1 times [2025-03-03 20:13:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135005084] [2025-03-03 20:13:19,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:19,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:19,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:19,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:19,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135005084] [2025-03-03 20:13:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135005084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14130252] [2025-03-03 20:13:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:20,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:20,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:20,544 INFO L87 Difference]: Start difference. First operand 6041 states and 9882 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:21,206 INFO L93 Difference]: Finished difference Result 16827 states and 27554 transitions. [2025-03-03 20:13:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:21,285 INFO L225 Difference]: With dead ends: 16827 [2025-03-03 20:13:21,285 INFO L226 Difference]: Without dead ends: 10789 [2025-03-03 20:13:21,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:21,315 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 344 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:21,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1094 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10789 states. [2025-03-03 20:13:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10789 to 10779. [2025-03-03 20:13:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10779 states, 7242 states have (on average 1.4656172328086163) internal successors, (10614), 7290 states have internal predecessors, (10614), 3478 states have call successors, (3478), 58 states have call predecessors, (3478), 58 states have return successors, (3478), 3430 states have call predecessors, (3478), 3478 states have call successors, (3478) [2025-03-03 20:13:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10779 states to 10779 states and 17570 transitions. [2025-03-03 20:13:22,183 INFO L78 Accepts]: Start accepts. Automaton has 10779 states and 17570 transitions. Word has length 660 [2025-03-03 20:13:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:22,184 INFO L471 AbstractCegarLoop]: Abstraction has 10779 states and 17570 transitions. [2025-03-03 20:13:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10779 states and 17570 transitions. [2025-03-03 20:13:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:22,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:22,200 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:22,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:13:22,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 424370713, now seen corresponding path program 1 times [2025-03-03 20:13:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415065347] [2025-03-03 20:13:22,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:22,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:22,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415065347] [2025-03-03 20:13:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415065347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345116771] [2025-03-03 20:13:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:22,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:22,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:22,830 INFO L87 Difference]: Start difference. First operand 10779 states and 17570 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:23,887 INFO L93 Difference]: Finished difference Result 32331 states and 52704 transitions. [2025-03-03 20:13:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:24,010 INFO L225 Difference]: With dead ends: 32331 [2025-03-03 20:13:24,010 INFO L226 Difference]: Without dead ends: 21555 [2025-03-03 20:13:24,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:24,058 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 341 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:24,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21555 states. [2025-03-03 20:13:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21555 to 21049. [2025-03-03 20:13:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21049 states, 13976 states have (on average 1.4625071551230682) internal successors, (20440), 14072 states have internal predecessors, (20440), 6956 states have call successors, (6956), 116 states have call predecessors, (6956), 116 states have return successors, (6956), 6860 states have call predecessors, (6956), 6956 states have call successors, (6956) [2025-03-03 20:13:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21049 states to 21049 states and 34352 transitions. [2025-03-03 20:13:25,658 INFO L78 Accepts]: Start accepts. Automaton has 21049 states and 34352 transitions. Word has length 660 [2025-03-03 20:13:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 21049 states and 34352 transitions. [2025-03-03 20:13:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21049 states and 34352 transitions. [2025-03-03 20:13:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:25,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:25,673 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:25,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:13:25,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:25,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1652838630, now seen corresponding path program 1 times [2025-03-03 20:13:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820568812] [2025-03-03 20:13:25,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:25,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:25,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:25,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:25,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820568812] [2025-03-03 20:13:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820568812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:13:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277174257] [2025-03-03 20:13:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:27,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:13:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:13:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:13:27,117 INFO L87 Difference]: Start difference. First operand 21049 states and 34352 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:36,191 INFO L93 Difference]: Finished difference Result 130721 states and 212578 transitions. [2025-03-03 20:13:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:13:36,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:36,748 INFO L225 Difference]: With dead ends: 130721 [2025-03-03 20:13:36,748 INFO L226 Difference]: Without dead ends: 109675 [2025-03-03 20:13:36,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:13:36,876 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2831 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 1085 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2831 SdHoareTripleChecker+Valid, 4458 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1085 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:36,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2831 Valid, 4458 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1085 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 20:13:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109675 states. [2025-03-03 20:13:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109675 to 57281. [2025-03-03 20:13:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57281 states, 39120 states have (on average 1.4738241308793456) internal successors, (57656), 39440 states have internal predecessors, (57656), 17820 states have call successors, (17820), 340 states have call predecessors, (17820), 340 states have return successors, (17820), 17500 states have call predecessors, (17820), 17820 states have call successors, (17820) [2025-03-03 20:13:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57281 states to 57281 states and 93296 transitions. [2025-03-03 20:13:42,865 INFO L78 Accepts]: Start accepts. Automaton has 57281 states and 93296 transitions. Word has length 660 [2025-03-03 20:13:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 57281 states and 93296 transitions. [2025-03-03 20:13:42,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 57281 states and 93296 transitions. [2025-03-03 20:13:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:42,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:42,902 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:13:42,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:42,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1861536933, now seen corresponding path program 1 times [2025-03-03 20:13:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818166907] [2025-03-03 20:13:42,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:42,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:43,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:43,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:43,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:13:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818166907] [2025-03-03 20:13:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818166907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:13:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360734145] [2025-03-03 20:13:43,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:43,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:13:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:43,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:13:43,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:43,670 INFO L87 Difference]: Start difference. First operand 57281 states and 93296 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:48,722 INFO L93 Difference]: Finished difference Result 150811 states and 246443 transitions. [2025-03-03 20:13:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:13:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-03 20:13:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:49,184 INFO L225 Difference]: With dead ends: 150811 [2025-03-03 20:13:49,184 INFO L226 Difference]: Without dead ends: 93533 [2025-03-03 20:13:49,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:13:49,394 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 942 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:49,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2652 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:13:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93533 states. [2025-03-03 20:13:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93533 to 57281. [2025-03-03 20:13:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57281 states, 39120 states have (on average 1.4695296523517383) internal successors, (57488), 39440 states have internal predecessors, (57488), 17820 states have call successors, (17820), 340 states have call predecessors, (17820), 340 states have return successors, (17820), 17500 states have call predecessors, (17820), 17820 states have call successors, (17820) [2025-03-03 20:13:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57281 states to 57281 states and 93128 transitions. [2025-03-03 20:13:54,989 INFO L78 Accepts]: Start accepts. Automaton has 57281 states and 93128 transitions. Word has length 660 [2025-03-03 20:13:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:54,991 INFO L471 AbstractCegarLoop]: Abstraction has 57281 states and 93128 transitions. [2025-03-03 20:13:54,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:13:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57281 states and 93128 transitions. [2025-03-03 20:13:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:13:55,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:55,029 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:13:55,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2024606138, now seen corresponding path program 1 times [2025-03-03 20:13:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620636633] [2025-03-03 20:13:55,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:55,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:13:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:13:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:55,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:14:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:14:01,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:14:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620636633] [2025-03-03 20:14:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620636633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:14:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:14:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 20:14:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640140356] [2025-03-03 20:14:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:14:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 20:14:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:14:01,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 20:14:01,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-03 20:14:01,678 INFO L87 Difference]: Start difference. First operand 57281 states and 93128 transitions. Second operand has 20 states, 20 states have (on average 7.65) internal successors, (153), 20 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102)