./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label49.c -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 dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:03:31,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:03:31,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:03:31,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:03:31,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:03:31,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:03:31,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:03:31,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:03:31,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:03:31,234 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:03:31,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:03:31,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:03:31,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:03:31,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:03:31,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:03:31,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:03:31,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:03:31,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:03:31,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:03:31,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:03:31,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:03:31,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:03:31,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:03:31,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:03:31,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:03:31,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:03:31,238 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 -> dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd [2025-03-16 15:03:31,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:03:31,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:03:31,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:03:31,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:03:31,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:03:31,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2025-03-16 15:03:32,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ded191ee/b347b0d018f948abb3d1a201fd99cef9/FLAG91671cb79 [2025-03-16 15:03:33,030 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:03:33,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2025-03-16 15:03:33,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ded191ee/b347b0d018f948abb3d1a201fd99cef9/FLAG91671cb79 [2025-03-16 15:03:33,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ded191ee/b347b0d018f948abb3d1a201fd99cef9 [2025-03-16 15:03:33,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:03:33,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:03:33,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:03:33,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:03:33,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:03:33,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:03:33" (1/1) ... [2025-03-16 15:03:33,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e881c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:33, skipping insertion in model container [2025-03-16 15:03:33,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:03:33" (1/1) ... [2025-03-16 15:03:33,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:03:33,464 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/eca-rers2012/Problem13_label49.c[8258,8271] [2025-03-16 15:03:33,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:03:33,948 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:03:33,967 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/eca-rers2012/Problem13_label49.c[8258,8271] [2025-03-16 15:03:34,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:03:34,288 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:03:34,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34 WrapperNode [2025-03-16 15:03:34,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:03:34,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:03:34,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:03:34,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:03:34,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,654 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:03:34,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:03:34,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:03:34,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:03:34,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:03:34,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,971 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-16 15:03:34,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:34,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:03:35,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:03:35,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:03:35,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:03:35,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (1/1) ... [2025-03-16 15:03:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:03:35,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:35,231 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-16 15:03:35,236 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-16 15:03:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:03:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:03:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:03:35,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:03:35,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:03:35,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:03:38,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:03:38,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:03:38,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:03:39,050 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:03:39,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:03:39,079 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:03:39,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:03:39,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:03:39 BoogieIcfgContainer [2025-03-16 15:03:39,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:03:39,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:03:39,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:03:39,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:03:39,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:03:33" (1/3) ... [2025-03-16 15:03:39,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d41c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:03:39, skipping insertion in model container [2025-03-16 15:03:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:34" (2/3) ... [2025-03-16 15:03:39,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d41c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:03:39, skipping insertion in model container [2025-03-16 15:03:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:03:39" (3/3) ... [2025-03-16 15:03:39,094 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label49.c [2025-03-16 15:03:39,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:03:39,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label49.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:03:39,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:03:39,192 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;@48c1fb91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:03:39,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:03:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:03:39,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:39,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:03:39,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:39,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash 24724478, now seen corresponding path program 1 times [2025-03-16 15:03:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55255508] [2025-03-16 15:03:39,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:39,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:03:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:03:39,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:39,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55255508] [2025-03-16 15:03:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55255508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:39,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563047760] [2025-03-16 15:03:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:39,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:03:39,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:39,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:03:39,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:03:39,360 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:39,435 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:03:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:03:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 15:03:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:39,457 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:03:39,459 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:03:39,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 15:03:39,469 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:39,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:03:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:03:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:03:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:03:39,547 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 57 [2025-03-16 15:03:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:39,548 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:03:39,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:03:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:03:39,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:39,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:03:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:03:39,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1622658878, now seen corresponding path program 1 times [2025-03-16 15:03:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038762612] [2025-03-16 15:03:39,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:03:39,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:03:39,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:39,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038762612] [2025-03-16 15:03:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038762612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:39,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019001608] [2025-03-16 15:03:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:39,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:03:39,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:39,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:03:39,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:39,988 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:44,944 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2025-03-16 15:03:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:03:44,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 15:03:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:44,956 INFO L225 Difference]: With dead ends: 3696 [2025-03-16 15:03:44,956 INFO L226 Difference]: Without dead ends: 2663 [2025-03-16 15:03:44,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 15:03:44,960 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 2646 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 5613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:44,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 1002 Invalid, 5613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4126 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:03:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-16 15:03:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2025-03-16 15:03:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2025-03-16 15:03:45,008 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 57 [2025-03-16 15:03:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:45,009 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2025-03-16 15:03:45,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2025-03-16 15:03:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 15:03:45,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:45,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:03:45,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:03:45,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:45,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1567465204, now seen corresponding path program 1 times [2025-03-16 15:03:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161599209] [2025-03-16 15:03:45,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:45,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 15:03:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 15:03:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161599209] [2025-03-16 15:03:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161599209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:03:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205356223] [2025-03-16 15:03:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:45,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:45,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:45,633 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-16 15:03:45,635 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-16 15:03:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 15:03:45,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 15:03:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:45,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:03:45,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:03:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-16 15:03:45,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:03:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205356223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:45,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:03:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 15:03:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375967207] [2025-03-16 15:03:45,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:45,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:45,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:03:45,921 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:48,639 INFO L93 Difference]: Finished difference Result 6141 states and 9711 transitions. [2025-03-16 15:03:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:48,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2025-03-16 15:03:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:48,652 INFO L225 Difference]: With dead ends: 6141 [2025-03-16 15:03:48,653 INFO L226 Difference]: Without dead ends: 4267 [2025-03-16 15:03:48,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:03:48,655 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:48,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1186 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2025-03-16 15:03:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4253. [2025-03-16 15:03:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.351599247412982) internal successors, (5747), 4252 states have internal predecessors, (5747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5747 transitions. [2025-03-16 15:03:48,714 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5747 transitions. Word has length 182 [2025-03-16 15:03:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:48,715 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 5747 transitions. [2025-03-16 15:03:48,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5747 transitions. [2025-03-16 15:03:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 15:03:48,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:48,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:48,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:03:48,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:48,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1899094927, now seen corresponding path program 1 times [2025-03-16 15:03:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366060306] [2025-03-16 15:03:48,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 15:03:48,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 15:03:48,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:48,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:03:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366060306] [2025-03-16 15:03:49,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366060306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:49,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:49,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:49,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616447085] [2025-03-16 15:03:49,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:49,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:49,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:49,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:49,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:49,094 INFO L87 Difference]: Start difference. First operand 4253 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:51,828 INFO L93 Difference]: Finished difference Result 10898 states and 15274 transitions. [2025-03-16 15:03:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-16 15:03:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:51,847 INFO L225 Difference]: With dead ends: 10898 [2025-03-16 15:03:51,847 INFO L226 Difference]: Without dead ends: 7433 [2025-03-16 15:03:51,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:03:51,852 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:51,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 956 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2025-03-16 15:03:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7425. [2025-03-16 15:03:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7424 states have (on average 1.288927801724138) internal successors, (9569), 7424 states have internal predecessors, (9569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 9569 transitions. [2025-03-16 15:03:51,945 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 9569 transitions. Word has length 224 [2025-03-16 15:03:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:51,946 INFO L471 AbstractCegarLoop]: Abstraction has 7425 states and 9569 transitions. [2025-03-16 15:03:51,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 9569 transitions. [2025-03-16 15:03:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 15:03:51,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:51,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:03:51,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 419251208, now seen corresponding path program 1 times [2025-03-16 15:03:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411253332] [2025-03-16 15:03:51,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 15:03:51,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 15:03:51,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:03:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411253332] [2025-03-16 15:03:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411253332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:52,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769738411] [2025-03-16 15:03:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:52,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:52,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:52,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:52,082 INFO L87 Difference]: Start difference. First operand 7425 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:54,962 INFO L93 Difference]: Finished difference Result 19620 states and 25904 transitions. [2025-03-16 15:03:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-16 15:03:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:54,995 INFO L225 Difference]: With dead ends: 19620 [2025-03-16 15:03:54,995 INFO L226 Difference]: Without dead ends: 12983 [2025-03-16 15:03:55,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:03:55,003 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:55,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 639 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:03:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2025-03-16 15:03:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 12974. [2025-03-16 15:03:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12974 states, 12973 states have (on average 1.2721035997841672) internal successors, (16503), 12973 states have internal predecessors, (16503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 16503 transitions. [2025-03-16 15:03:55,176 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 16503 transitions. Word has length 238 [2025-03-16 15:03:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:55,177 INFO L471 AbstractCegarLoop]: Abstraction has 12974 states and 16503 transitions. [2025-03-16 15:03:55,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 16503 transitions. [2025-03-16 15:03:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 15:03:55,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:55,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:03:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:03:55,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:55,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -176775713, now seen corresponding path program 1 times [2025-03-16 15:03:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487170046] [2025-03-16 15:03:55,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:55,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 15:03:55,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 15:03:55,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:55,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-16 15:03:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:55,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487170046] [2025-03-16 15:03:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487170046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:55,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166590932] [2025-03-16 15:03:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:55,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:55,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:55,344 INFO L87 Difference]: Start difference. First operand 12974 states and 16503 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:57,814 INFO L93 Difference]: Finished difference Result 36179 states and 46597 transitions. [2025-03-16 15:03:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:57,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2025-03-16 15:03:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:57,852 INFO L225 Difference]: With dead ends: 36179 [2025-03-16 15:03:57,852 INFO L226 Difference]: Without dead ends: 23993 [2025-03-16 15:03:57,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:03:57,867 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:57,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 983 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:03:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2025-03-16 15:03:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 23202. [2025-03-16 15:03:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23202 states, 23201 states have (on average 1.2067583293823543) internal successors, (27998), 23201 states have internal predecessors, (27998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23202 states to 23202 states and 27998 transitions. [2025-03-16 15:03:58,212 INFO L78 Accepts]: Start accepts. Automaton has 23202 states and 27998 transitions. Word has length 254 [2025-03-16 15:03:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 23202 states and 27998 transitions. [2025-03-16 15:03:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 23202 states and 27998 transitions. [2025-03-16 15:03:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 15:03:58,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:58,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:58,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:03:58,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:58,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2060272379, now seen corresponding path program 1 times [2025-03-16 15:03:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:58,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708471091] [2025-03-16 15:03:58,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:58,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 15:03:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 15:03:58,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:58,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708471091] [2025-03-16 15:03:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708471091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280215159] [2025-03-16 15:03:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:58,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:58,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:58,336 INFO L87 Difference]: Start difference. First operand 23202 states and 27998 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:00,857 INFO L93 Difference]: Finished difference Result 57431 states and 70772 transitions. [2025-03-16 15:04:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2025-03-16 15:04:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:00,900 INFO L225 Difference]: With dead ends: 57431 [2025-03-16 15:04:00,900 INFO L226 Difference]: Without dead ends: 35017 [2025-03-16 15:04:00,922 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-16 15:04:00,923 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:00,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 922 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:04:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35017 states. [2025-03-16 15:04:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35017 to 33433. [2025-03-16 15:04:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33432 states have (on average 1.1907154821727686) internal successors, (39808), 33432 states have internal predecessors, (39808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 39808 transitions. [2025-03-16 15:04:01,364 INFO L78 Accepts]: Start accepts. Automaton has 33433 states and 39808 transitions. Word has length 256 [2025-03-16 15:04:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 33433 states and 39808 transitions. [2025-03-16 15:04:01,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33433 states and 39808 transitions. [2025-03-16 15:04:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 15:04:01,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:01,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:01,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:04:01,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:01,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -767590296, now seen corresponding path program 1 times [2025-03-16 15:04:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119860935] [2025-03-16 15:04:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:01,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 15:04:01,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 15:04:01,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:01,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:04:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119860935] [2025-03-16 15:04:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119860935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247316441] [2025-03-16 15:04:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:01,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:01,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:01,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:01,658 INFO L87 Difference]: Start difference. First operand 33433 states and 39808 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:06,523 INFO L93 Difference]: Finished difference Result 117459 states and 141049 transitions. [2025-03-16 15:04:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2025-03-16 15:04:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:06,628 INFO L225 Difference]: With dead ends: 117459 [2025-03-16 15:04:06,628 INFO L226 Difference]: Without dead ends: 84814 [2025-03-16 15:04:06,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 15:04:06,667 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1737 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 1188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1188 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:06,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 696 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1188 Valid, 6065 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:04:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84814 states. [2025-03-16 15:04:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84814 to 83899. [2025-03-16 15:04:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83899 states, 83898 states have (on average 1.1736275000595962) internal successors, (98465), 83898 states have internal predecessors, (98465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83899 states to 83899 states and 98465 transitions. [2025-03-16 15:04:07,475 INFO L78 Accepts]: Start accepts. Automaton has 83899 states and 98465 transitions. Word has length 345 [2025-03-16 15:04:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:07,475 INFO L471 AbstractCegarLoop]: Abstraction has 83899 states and 98465 transitions. [2025-03-16 15:04:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 83899 states and 98465 transitions. [2025-03-16 15:04:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 15:04:07,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:07,482 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:07,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:04:07,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1838699836, now seen corresponding path program 1 times [2025-03-16 15:04:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773030258] [2025-03-16 15:04:07,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:07,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 15:04:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 15:04:07,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:07,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:04:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773030258] [2025-03-16 15:04:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773030258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505597624] [2025-03-16 15:04:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:07,704 INFO L87 Difference]: Start difference. First operand 83899 states and 98465 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:10,371 INFO L93 Difference]: Finished difference Result 167045 states and 196194 transitions. [2025-03-16 15:04:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2025-03-16 15:04:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:10,457 INFO L225 Difference]: With dead ends: 167045 [2025-03-16 15:04:10,457 INFO L226 Difference]: Without dead ends: 83934 [2025-03-16 15:04:10,487 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-16 15:04:10,487 INFO L435 NwaCegarLoop]: 1850 mSDtfsCounter, 753 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:10,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1991 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:04:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83934 states. [2025-03-16 15:04:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83934 to 83900. [2025-03-16 15:04:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83900 states, 83899 states have (on average 1.1574750592974887) internal successors, (97111), 83899 states have internal predecessors, (97111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83900 states to 83900 states and 97111 transitions. [2025-03-16 15:04:11,452 INFO L78 Accepts]: Start accepts. Automaton has 83900 states and 97111 transitions. Word has length 354 [2025-03-16 15:04:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 83900 states and 97111 transitions. [2025-03-16 15:04:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83900 states and 97111 transitions. [2025-03-16 15:04:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-16 15:04:11,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:11,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:11,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:04:11,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:11,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1746217193, now seen corresponding path program 1 times [2025-03-16 15:04:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302876538] [2025-03-16 15:04:11,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-16 15:04:11,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-16 15:04:11,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:11,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:04:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302876538] [2025-03-16 15:04:11,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302876538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:11,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078831139] [2025-03-16 15:04:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:11,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:11,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:11,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:11,684 INFO L87 Difference]: Start difference. First operand 83900 states and 97111 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:14,289 INFO L93 Difference]: Finished difference Result 171709 states and 198021 transitions. [2025-03-16 15:04:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2025-03-16 15:04:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:14,397 INFO L225 Difference]: With dead ends: 171709 [2025-03-16 15:04:14,397 INFO L226 Difference]: Without dead ends: 85444 [2025-03-16 15:04:14,457 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-16 15:04:14,458 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 1037 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:14,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1646 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85444 states. [2025-03-16 15:04:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85444 to 80708. [2025-03-16 15:04:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80708 states, 80707 states have (on average 1.104774059251366) internal successors, (89163), 80707 states have internal predecessors, (89163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80708 states to 80708 states and 89163 transitions. [2025-03-16 15:04:15,436 INFO L78 Accepts]: Start accepts. Automaton has 80708 states and 89163 transitions. Word has length 374 [2025-03-16 15:04:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:15,436 INFO L471 AbstractCegarLoop]: Abstraction has 80708 states and 89163 transitions. [2025-03-16 15:04:15,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 80708 states and 89163 transitions. [2025-03-16 15:04:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-16 15:04:15,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:15,440 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:15,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:04:15,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:15,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1276934561, now seen corresponding path program 1 times [2025-03-16 15:04:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:15,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364242442] [2025-03-16 15:04:15,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:15,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:15,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 15:04:15,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 15:04:15,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:15,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:04:16,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364242442] [2025-03-16 15:04:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364242442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640951678] [2025-03-16 15:04:16,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:16,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:16,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:04:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:04:16,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 15:04:16,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 15:04:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:16,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:04:16,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 15:04:16,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640951678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:16,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:16,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:04:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716789336] [2025-03-16 15:04:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:16,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:16,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:16,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:04:16,587 INFO L87 Difference]: Start difference. First operand 80708 states and 89163 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:19,166 INFO L93 Difference]: Finished difference Result 160626 states and 177532 transitions. [2025-03-16 15:04:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2025-03-16 15:04:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:19,256 INFO L225 Difference]: With dead ends: 160626 [2025-03-16 15:04:19,256 INFO L226 Difference]: Without dead ends: 80706 [2025-03-16 15:04:19,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:04:19,288 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:19,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1421 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80706 states. [2025-03-16 15:04:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80706 to 80705. [2025-03-16 15:04:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80705 states, 80704 states have (on average 1.079611915146709) internal successors, (87129), 80704 states have internal predecessors, (87129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80705 states to 80705 states and 87129 transitions. [2025-03-16 15:04:20,189 INFO L78 Accepts]: Start accepts. Automaton has 80705 states and 87129 transitions. Word has length 383 [2025-03-16 15:04:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:20,190 INFO L471 AbstractCegarLoop]: Abstraction has 80705 states and 87129 transitions. [2025-03-16 15:04:20,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 80705 states and 87129 transitions. [2025-03-16 15:04:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 15:04:20,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:20,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:20,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:04:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:04:20,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1164348583, now seen corresponding path program 1 times [2025-03-16 15:04:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736175754] [2025-03-16 15:04:20,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:20,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:20,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:04:20,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:04:20,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:20,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 15:04:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736175754] [2025-03-16 15:04:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736175754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231937026] [2025-03-16 15:04:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:20,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:20,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:20,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:20,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:20,662 INFO L87 Difference]: Start difference. First operand 80705 states and 87129 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:23,768 INFO L93 Difference]: Finished difference Result 187387 states and 204117 transitions. [2025-03-16 15:04:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:23,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2025-03-16 15:04:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:23,895 INFO L225 Difference]: With dead ends: 187387 [2025-03-16 15:04:23,895 INFO L226 Difference]: Without dead ends: 107470 [2025-03-16 15:04:23,938 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-16 15:04:23,939 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 875 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:23,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 902 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:04:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107470 states. [2025-03-16 15:04:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107470 to 105090. [2025-03-16 15:04:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105090 states, 105089 states have (on average 1.0853847691004768) internal successors, (114062), 105089 states have internal predecessors, (114062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105090 states to 105090 states and 114062 transitions. [2025-03-16 15:04:25,242 INFO L78 Accepts]: Start accepts. Automaton has 105090 states and 114062 transitions. Word has length 413 [2025-03-16 15:04:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 105090 states and 114062 transitions. [2025-03-16 15:04:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105090 states and 114062 transitions. [2025-03-16 15:04:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-16 15:04:25,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:25,250 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:04:25,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1680187909, now seen corresponding path program 1 times [2025-03-16 15:04:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675822346] [2025-03-16 15:04:25,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:25,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:25,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 15:04:25,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 15:04:25,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:25,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-16 15:04:25,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:25,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675822346] [2025-03-16 15:04:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675822346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360853361] [2025-03-16 15:04:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:25,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:25,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:25,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:25,612 INFO L87 Difference]: Start difference. First operand 105090 states and 114062 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:28,248 INFO L93 Difference]: Finished difference Result 222863 states and 242085 transitions. [2025-03-16 15:04:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2025-03-16 15:04:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:28,388 INFO L225 Difference]: With dead ends: 222863 [2025-03-16 15:04:28,388 INFO L226 Difference]: Without dead ends: 129580 [2025-03-16 15:04:28,436 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-16 15:04:28,437 INFO L435 NwaCegarLoop]: 1887 mSDtfsCounter, 896 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:28,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 2058 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129580 states. [2025-03-16 15:04:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129580 to 123264. [2025-03-16 15:04:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123264 states, 123263 states have (on average 1.0807217088664076) internal successors, (133213), 123263 states have internal predecessors, (133213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123264 states to 123264 states and 133213 transitions. [2025-03-16 15:04:29,766 INFO L78 Accepts]: Start accepts. Automaton has 123264 states and 133213 transitions. Word has length 446 [2025-03-16 15:04:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:29,767 INFO L471 AbstractCegarLoop]: Abstraction has 123264 states and 133213 transitions. [2025-03-16 15:04:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 123264 states and 133213 transitions. [2025-03-16 15:04:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-16 15:04:29,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:29,776 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:29,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:04:29,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1296730073, now seen corresponding path program 1 times [2025-03-16 15:04:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719682924] [2025-03-16 15:04:29,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:29,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:29,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-16 15:04:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-16 15:04:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:04:30,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719682924] [2025-03-16 15:04:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719682924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620711342] [2025-03-16 15:04:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:30,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:30,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:30,061 INFO L87 Difference]: Start difference. First operand 123264 states and 133213 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:33,365 INFO L93 Difference]: Finished difference Result 278814 states and 303024 transitions. [2025-03-16 15:04:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2025-03-16 15:04:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:33,536 INFO L225 Difference]: With dead ends: 278814 [2025-03-16 15:04:33,536 INFO L226 Difference]: Without dead ends: 152403 [2025-03-16 15:04:33,585 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-16 15:04:33,585 INFO L435 NwaCegarLoop]: 1738 mSDtfsCounter, 785 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:33,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1880 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:04:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152403 states. [2025-03-16 15:04:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152403 to 150808. [2025-03-16 15:04:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150808 states, 150807 states have (on average 1.0706001710795918) internal successors, (161454), 150807 states have internal predecessors, (161454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150808 states to 150808 states and 161454 transitions. [2025-03-16 15:04:35,091 INFO L78 Accepts]: Start accepts. Automaton has 150808 states and 161454 transitions. Word has length 451 [2025-03-16 15:04:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:35,092 INFO L471 AbstractCegarLoop]: Abstraction has 150808 states and 161454 transitions. [2025-03-16 15:04:35,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 150808 states and 161454 transitions. [2025-03-16 15:04:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-16 15:04:35,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:35,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:04:35,100 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 433877252, now seen corresponding path program 1 times [2025-03-16 15:04:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746542766] [2025-03-16 15:04:35,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-16 15:04:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-16 15:04:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:35,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:04:35,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746542766] [2025-03-16 15:04:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746542766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490459343] [2025-03-16 15:04:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:35,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:35,801 INFO L87 Difference]: Start difference. First operand 150808 states and 161454 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:40,854 INFO L93 Difference]: Finished difference Result 333142 states and 358485 transitions. [2025-03-16 15:04:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:40,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461 [2025-03-16 15:04:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:41,098 INFO L225 Difference]: With dead ends: 333142 [2025-03-16 15:04:41,098 INFO L226 Difference]: Without dead ends: 198868 [2025-03-16 15:04:41,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 15:04:41,145 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1391 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 6205 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 6885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 6205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:41,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 998 Invalid, 6885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 6205 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:04:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198868 states. [2025-03-16 15:04:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198868 to 178374. [2025-03-16 15:04:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178374 states, 178373 states have (on average 1.069651797076912) internal successors, (190797), 178373 states have internal predecessors, (190797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178374 states to 178374 states and 190797 transitions. [2025-03-16 15:04:42,924 INFO L78 Accepts]: Start accepts. Automaton has 178374 states and 190797 transitions. Word has length 461 [2025-03-16 15:04:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:42,924 INFO L471 AbstractCegarLoop]: Abstraction has 178374 states and 190797 transitions. [2025-03-16 15:04:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 178374 states and 190797 transitions. [2025-03-16 15:04:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-16 15:04:42,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:42,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:42,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:04:42,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash -517015966, now seen corresponding path program 1 times [2025-03-16 15:04:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519507449] [2025-03-16 15:04:42,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:42,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 15:04:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 15:04:42,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:42,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 349 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:04:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519507449] [2025-03-16 15:04:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519507449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803411974] [2025-03-16 15:04:44,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:44,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:04:44,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:04:44,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 15:04:44,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 15:04:44,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:44,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:44,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:04:44,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 15:04:44,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803411974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:04:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115510615] [2025-03-16 15:04:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:44,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:04:44,468 INFO L87 Difference]: Start difference. First operand 178374 states and 190797 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:48,469 INFO L93 Difference]: Finished difference Result 370896 states and 397144 transitions. [2025-03-16 15:04:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-03-16 15:04:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:48,708 INFO L225 Difference]: With dead ends: 370896 [2025-03-16 15:04:48,708 INFO L226 Difference]: Without dead ends: 205115 [2025-03-16 15:04:48,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:04:48,785 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 949 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:48,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1687 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 15:04:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205115 states. [2025-03-16 15:04:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205115 to 193277. [2025-03-16 15:04:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193277 states, 193276 states have (on average 1.0656108363169767) internal successors, (205957), 193276 states have internal predecessors, (205957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193277 states to 193277 states and 205957 transitions. [2025-03-16 15:04:50,628 INFO L78 Accepts]: Start accepts. Automaton has 193277 states and 205957 transitions. Word has length 473 [2025-03-16 15:04:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 193277 states and 205957 transitions. [2025-03-16 15:04:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 193277 states and 205957 transitions. [2025-03-16 15:04:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-16 15:04:50,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:50,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:50,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:04:50,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:50,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1937761275, now seen corresponding path program 1 times [2025-03-16 15:04:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899136713] [2025-03-16 15:04:50,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 15:04:50,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 15:04:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:50,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:04:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899136713] [2025-03-16 15:04:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899136713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017507668] [2025-03-16 15:04:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:51,809 INFO L87 Difference]: Start difference. First operand 193277 states and 205957 transitions. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)