./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6031d7dbf9253742754a9f33e4106b11959f7720644c83778bf015fc3b49fed8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:19:34,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:19:34,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:19:34,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:19:34,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:19:34,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:19:34,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:19:34,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:19:34,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:19:34,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:19:34,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:19:34,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:19:34,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:19:34,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:19:34,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:19:34,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:19:34,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:19:34,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:19:34,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:19:34,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:19:34,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:19:34,179 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 -> 6031d7dbf9253742754a9f33e4106b11959f7720644c83778bf015fc3b49fed8 [2025-03-08 15:19:34,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:19:34,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:19:34,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:19:34,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:19:34,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:19:34,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i [2025-03-08 15:19:35,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882b7616e/0f28128661294cf29b4ba823dbfcd61b/FLAG11bc7968c [2025-03-08 15:19:35,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:19:35,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i [2025-03-08 15:19:35,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882b7616e/0f28128661294cf29b4ba823dbfcd61b/FLAG11bc7968c [2025-03-08 15:19:36,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882b7616e/0f28128661294cf29b4ba823dbfcd61b [2025-03-08 15:19:36,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:19:36,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:19:36,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:19:36,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:19:36,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:19:36,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36, skipping insertion in model container [2025-03-08 15:19:36,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:19:36,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i[916,929] [2025-03-08 15:19:36,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:19:36,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:19:36,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-17.i[916,929] [2025-03-08 15:19:36,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:19:36,447 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:19:36,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36 WrapperNode [2025-03-08 15:19:36,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:19:36,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:19:36,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:19:36,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:19:36,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,502 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 361 [2025-03-08 15:19:36,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:19:36,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:19:36,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:19:36,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:19:36,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,554 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:19:36,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:19:36,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:19:36,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:19:36,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:19:36,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (1/1) ... [2025-03-08 15:19:36,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:19:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:19:36,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:19:36,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:19:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:19:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:19:36,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:19:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:19:36,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:19:36,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:19:36,744 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:19:36,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:19:37,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc property_#t~bitwise32#1; [2025-03-08 15:19:37,265 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-08 15:19:37,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:19:37,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:19:37,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:19:37,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:19:37 BoogieIcfgContainer [2025-03-08 15:19:37,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:19:37,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:19:37,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:19:37,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:19:37,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:19:36" (1/3) ... [2025-03-08 15:19:37,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b980e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:19:37, skipping insertion in model container [2025-03-08 15:19:37,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:36" (2/3) ... [2025-03-08 15:19:37,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b980e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:19:37, skipping insertion in model container [2025-03-08 15:19:37,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:19:37" (3/3) ... [2025-03-08 15:19:37,295 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-17.i [2025-03-08 15:19:37,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:19:37,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-17.i that has 2 procedures, 149 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:19:37,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:19:37,366 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;@18c978aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:19:37,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:19:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 15:19:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:37,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:37,398 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:37,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash -126767221, now seen corresponding path program 1 times [2025-03-08 15:19:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988344258] [2025-03-08 15:19:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:37,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:37,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:37,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:37,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-08 15:19:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988344258] [2025-03-08 15:19:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988344258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:19:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867380948] [2025-03-08 15:19:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:19:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:19:37,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:19:37,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:19:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:38,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:38,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:38,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:38,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:19:38,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:19:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-08 15:19:38,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:19:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867380948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:19:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:19:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111784862] [2025-03-08 15:19:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:38,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:19:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:38,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:19:38,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:19:38,101 INFO L87 Difference]: Start difference. First operand has 149 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:19:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:38,132 INFO L93 Difference]: Finished difference Result 292 states and 520 transitions. [2025-03-08 15:19:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:19:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 311 [2025-03-08 15:19:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:38,140 INFO L225 Difference]: With dead ends: 292 [2025-03-08 15:19:38,141 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 15:19:38,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:19:38,147 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:38,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:19:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 15:19:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-08 15:19:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.443298969072165) internal successors, (140), 97 states have internal predecessors, (140), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 15:19:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2025-03-08 15:19:38,190 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 311 [2025-03-08 15:19:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2025-03-08 15:19:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:19:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2025-03-08 15:19:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:38,197 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:38,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:19:38,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:19:38,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:38,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1647530256, now seen corresponding path program 1 times [2025-03-08 15:19:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267614300] [2025-03-08 15:19:38,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:38,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:19:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267614300] [2025-03-08 15:19:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267614300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:19:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861043978] [2025-03-08 15:19:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:39,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:19:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:39,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:19:39,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:19:39,043 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:19:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:39,133 INFO L93 Difference]: Finished difference Result 432 states and 696 transitions. [2025-03-08 15:19:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:19:39,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 311 [2025-03-08 15:19:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:39,139 INFO L225 Difference]: With dead ends: 432 [2025-03-08 15:19:39,140 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 15:19:39,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:19:39,143 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 226 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:39,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 631 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:19:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 15:19:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 155. [2025-03-08 15:19:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 15:19:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2025-03-08 15:19:39,171 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 311 [2025-03-08 15:19:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:39,174 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2025-03-08 15:19:39,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:19:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2025-03-08 15:19:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:39,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:39,178 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:39,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:19:39,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:39,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1650364687, now seen corresponding path program 1 times [2025-03-08 15:19:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344080209] [2025-03-08 15:19:39,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:40,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:40,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:40,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:19:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344080209] [2025-03-08 15:19:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344080209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:19:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710158125] [2025-03-08 15:19:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:19:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:19:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:19:43,785 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:19:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:46,411 INFO L93 Difference]: Finished difference Result 975 states and 1540 transitions. [2025-03-08 15:19:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:19:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 311 [2025-03-08 15:19:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:46,416 INFO L225 Difference]: With dead ends: 975 [2025-03-08 15:19:46,416 INFO L226 Difference]: Without dead ends: 823 [2025-03-08 15:19:46,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:19:46,418 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 2060 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:46,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 2294 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 15:19:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-08 15:19:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 593. [2025-03-08 15:19:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 457 states have (on average 1.50109409190372) internal successors, (686), 459 states have internal predecessors, (686), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 15:19:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 946 transitions. [2025-03-08 15:19:46,490 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 946 transitions. Word has length 311 [2025-03-08 15:19:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:46,491 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 946 transitions. [2025-03-08 15:19:46,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:19:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 946 transitions. [2025-03-08 15:19:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:46,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:46,494 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:46,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:19:46,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:46,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1583357934, now seen corresponding path program 1 times [2025-03-08 15:19:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:46,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877749701] [2025-03-08 15:19:46,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:46,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:46,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:46,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:46,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:19:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877749701] [2025-03-08 15:19:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877749701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:19:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820238838] [2025-03-08 15:19:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:19:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:46,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:19:46,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:19:46,769 INFO L87 Difference]: Start difference. First operand 593 states and 946 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:19:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:47,351 INFO L93 Difference]: Finished difference Result 1994 states and 3173 transitions. [2025-03-08 15:19:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:19:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 311 [2025-03-08 15:19:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:47,362 INFO L225 Difference]: With dead ends: 1994 [2025-03-08 15:19:47,362 INFO L226 Difference]: Without dead ends: 1404 [2025-03-08 15:19:47,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:19:47,364 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 251 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:47,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 963 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:19:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-08 15:19:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1398. [2025-03-08 15:19:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 998 states have (on average 1.4448897795591182) internal successors, (1442), 1006 states have internal predecessors, (1442), 384 states have call successors, (384), 15 states have call predecessors, (384), 15 states have return successors, (384), 376 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-08 15:19:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2210 transitions. [2025-03-08 15:19:47,509 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2210 transitions. Word has length 311 [2025-03-08 15:19:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2210 transitions. [2025-03-08 15:19:47,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:19:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2210 transitions. [2025-03-08 15:19:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:47,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:47,515 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:19:47,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:47,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1386844429, now seen corresponding path program 1 times [2025-03-08 15:19:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084676876] [2025-03-08 15:19:47,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:47,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:47,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:19:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:47,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084676876] [2025-03-08 15:19:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084676876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:19:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534194950] [2025-03-08 15:19:47,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:19:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:19:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:19:47,962 INFO L87 Difference]: Start difference. First operand 1398 states and 2210 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:19:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:48,561 INFO L93 Difference]: Finished difference Result 3560 states and 5632 transitions. [2025-03-08 15:19:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:19:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 311 [2025-03-08 15:19:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:48,575 INFO L225 Difference]: With dead ends: 3560 [2025-03-08 15:19:48,576 INFO L226 Difference]: Without dead ends: 2165 [2025-03-08 15:19:48,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:19:48,581 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 642 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1093 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:19:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-03-08 15:19:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1877. [2025-03-08 15:19:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1325 states have (on average 1.4422641509433962) internal successors, (1911), 1334 states have internal predecessors, (1911), 532 states have call successors, (532), 19 states have call predecessors, (532), 19 states have return successors, (532), 523 states have call predecessors, (532), 532 states have call successors, (532) [2025-03-08 15:19:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2975 transitions. [2025-03-08 15:19:48,734 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2975 transitions. Word has length 311 [2025-03-08 15:19:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:48,737 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2975 transitions. [2025-03-08 15:19:48,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:19:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2975 transitions. [2025-03-08 15:19:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:48,742 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:19:48,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1682988592, now seen corresponding path program 1 times [2025-03-08 15:19:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145469005] [2025-03-08 15:19:48,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:49,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:49,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:19:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145469005] [2025-03-08 15:19:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145469005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:19:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669917649] [2025-03-08 15:19:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:19:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:19:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:19:55,315 INFO L87 Difference]: Start difference. First operand 1877 states and 2975 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:19:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:58,872 INFO L93 Difference]: Finished difference Result 3388 states and 5360 transitions. [2025-03-08 15:19:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:19:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 311 [2025-03-08 15:19:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:58,887 INFO L225 Difference]: With dead ends: 3388 [2025-03-08 15:19:58,887 INFO L226 Difference]: Without dead ends: 2798 [2025-03-08 15:19:58,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-03-08 15:19:58,890 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 798 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:58,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2060 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 15:19:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-08 15:19:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2097. [2025-03-08 15:19:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 1496 states have (on average 1.4512032085561497) internal successors, (2171), 1505 states have internal predecessors, (2171), 579 states have call successors, (579), 21 states have call predecessors, (579), 21 states have return successors, (579), 570 states have call predecessors, (579), 579 states have call successors, (579) [2025-03-08 15:19:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3329 transitions. [2025-03-08 15:19:59,038 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3329 transitions. Word has length 311 [2025-03-08 15:19:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:59,039 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3329 transitions. [2025-03-08 15:19:59,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:19:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3329 transitions. [2025-03-08 15:19:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:19:59,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:59,043 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:19:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:19:59,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1320598926, now seen corresponding path program 1 times [2025-03-08 15:19:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419060042] [2025-03-08 15:19:59,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:59,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:19:59,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:19:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:10,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:10,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419060042] [2025-03-08 15:20:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419060042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:10,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 15:20:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661758989] [2025-03-08 15:20:10,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:20:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:10,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:20:10,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:20:10,778 INFO L87 Difference]: Start difference. First operand 2097 states and 3329 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 15:20:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:15,945 INFO L93 Difference]: Finished difference Result 3318 states and 5230 transitions. [2025-03-08 15:20:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:20:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 311 [2025-03-08 15:20:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:15,962 INFO L225 Difference]: With dead ends: 3318 [2025-03-08 15:20:15,962 INFO L226 Difference]: Without dead ends: 3166 [2025-03-08 15:20:15,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-03-08 15:20:15,965 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1367 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:15,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1980 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 15:20:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2025-03-08 15:20:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 2142. [2025-03-08 15:20:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1540 states have (on average 1.4564935064935065) internal successors, (2243), 1549 states have internal predecessors, (2243), 579 states have call successors, (579), 22 states have call predecessors, (579), 22 states have return successors, (579), 570 states have call predecessors, (579), 579 states have call successors, (579) [2025-03-08 15:20:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3401 transitions. [2025-03-08 15:20:16,148 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3401 transitions. Word has length 311 [2025-03-08 15:20:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:16,149 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 3401 transitions. [2025-03-08 15:20:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 15:20:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3401 transitions. [2025-03-08 15:20:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:16,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:16,153 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:20:16,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:16,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2012754353, now seen corresponding path program 1 times [2025-03-08 15:20:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004158441] [2025-03-08 15:20:16,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:16,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:16,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:16,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:16,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004158441] [2025-03-08 15:20:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004158441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:20:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341616635] [2025-03-08 15:20:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:20:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:21,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:20:21,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:20:21,946 INFO L87 Difference]: Start difference. First operand 2142 states and 3401 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:20:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:28,273 INFO L93 Difference]: Finished difference Result 3890 states and 6125 transitions. [2025-03-08 15:20:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:20:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 311 [2025-03-08 15:20:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:28,285 INFO L225 Difference]: With dead ends: 3890 [2025-03-08 15:20:28,285 INFO L226 Difference]: Without dead ends: 3738 [2025-03-08 15:20:28,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:20:28,287 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1299 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:28,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1960 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 15:20:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2025-03-08 15:20:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 2173. [2025-03-08 15:20:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1571 states have (on average 1.4614894971355825) internal successors, (2296), 1580 states have internal predecessors, (2296), 579 states have call successors, (579), 22 states have call predecessors, (579), 22 states have return successors, (579), 570 states have call predecessors, (579), 579 states have call successors, (579) [2025-03-08 15:20:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3454 transitions. [2025-03-08 15:20:28,425 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3454 transitions. Word has length 311 [2025-03-08 15:20:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 3454 transitions. [2025-03-08 15:20:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:20:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3454 transitions. [2025-03-08 15:20:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:28,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:28,428 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:20:28,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1359529360, now seen corresponding path program 1 times [2025-03-08 15:20:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:28,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111165562] [2025-03-08 15:20:28,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:28,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:28,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:28,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:28,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111165562] [2025-03-08 15:20:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111165562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:20:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849669068] [2025-03-08 15:20:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:20:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:28,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:20:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:20:28,571 INFO L87 Difference]: Start difference. First operand 2173 states and 3454 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:20:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:28,946 INFO L93 Difference]: Finished difference Result 4432 states and 7046 transitions. [2025-03-08 15:20:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:20:28,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 311 [2025-03-08 15:20:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:28,959 INFO L225 Difference]: With dead ends: 4432 [2025-03-08 15:20:28,959 INFO L226 Difference]: Without dead ends: 2396 [2025-03-08 15:20:28,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:28,966 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 237 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:28,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 715 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:20:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-03-08 15:20:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2173. [2025-03-08 15:20:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1571 states have (on average 1.455760661998727) internal successors, (2287), 1580 states have internal predecessors, (2287), 579 states have call successors, (579), 22 states have call predecessors, (579), 22 states have return successors, (579), 570 states have call predecessors, (579), 579 states have call successors, (579) [2025-03-08 15:20:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3445 transitions. [2025-03-08 15:20:29,215 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3445 transitions. Word has length 311 [2025-03-08 15:20:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:29,216 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 3445 transitions. [2025-03-08 15:20:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-08 15:20:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3445 transitions. [2025-03-08 15:20:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:29,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:29,222 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:20:29,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425776, now seen corresponding path program 1 times [2025-03-08 15:20:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108808072] [2025-03-08 15:20:29,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:29,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:29,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108808072] [2025-03-08 15:20:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108808072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:20:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019936203] [2025-03-08 15:20:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:29,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:20:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:29,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:20:29,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:29,660 INFO L87 Difference]: Start difference. First operand 2173 states and 3445 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:20:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:30,487 INFO L93 Difference]: Finished difference Result 7769 states and 12438 transitions. [2025-03-08 15:20:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:20:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 311 [2025-03-08 15:20:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:30,515 INFO L225 Difference]: With dead ends: 7769 [2025-03-08 15:20:30,515 INFO L226 Difference]: Without dead ends: 5733 [2025-03-08 15:20:30,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:20:30,521 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 612 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:30,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1065 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:20:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-03-08 15:20:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3754. [2025-03-08 15:20:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3754 states, 2694 states have (on average 1.447290274684484) internal successors, (3899), 2711 states have internal predecessors, (3899), 1020 states have call successors, (1020), 39 states have call predecessors, (1020), 39 states have return successors, (1020), 1003 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-08 15:20:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 5939 transitions. [2025-03-08 15:20:30,908 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 5939 transitions. Word has length 311 [2025-03-08 15:20:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:30,909 INFO L471 AbstractCegarLoop]: Abstraction has 3754 states and 5939 transitions. [2025-03-08 15:20:30,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 15:20:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 5939 transitions. [2025-03-08 15:20:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:30,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:30,914 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:30,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:20:30,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 975742193, now seen corresponding path program 1 times [2025-03-08 15:20:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315903406] [2025-03-08 15:20:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:31,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:31,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:31,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315903406] [2025-03-08 15:20:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315903406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:34,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:20:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134967421] [2025-03-08 15:20:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:20:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:34,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:20:34,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:20:34,880 INFO L87 Difference]: Start difference. First operand 3754 states and 5939 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:20:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:38,985 INFO L93 Difference]: Finished difference Result 5413 states and 8520 transitions. [2025-03-08 15:20:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:20:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 311 [2025-03-08 15:20:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:39,003 INFO L225 Difference]: With dead ends: 5413 [2025-03-08 15:20:39,003 INFO L226 Difference]: Without dead ends: 5261 [2025-03-08 15:20:39,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:20:39,007 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 787 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:39,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2130 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 15:20:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-03-08 15:20:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 3726. [2025-03-08 15:20:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 2666 states have (on average 1.4444861215303826) internal successors, (3851), 2683 states have internal predecessors, (3851), 1020 states have call successors, (1020), 39 states have call predecessors, (1020), 39 states have return successors, (1020), 1003 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-08 15:20:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 5891 transitions. [2025-03-08 15:20:39,318 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 5891 transitions. Word has length 311 [2025-03-08 15:20:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 5891 transitions. [2025-03-08 15:20:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 15:20:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 5891 transitions. [2025-03-08 15:20:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:39,322 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:39,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:20:39,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:39,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1774437934, now seen corresponding path program 1 times [2025-03-08 15:20:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209077427] [2025-03-08 15:20:39,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:39,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:39,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:39,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 93 proven. 45 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-08 15:20:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209077427] [2025-03-08 15:20:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209077427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:20:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72201338] [2025-03-08 15:20:39,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:39,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:39,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:39,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:20:39,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:20:40,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:40,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:40,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:40,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:20:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:20:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1968 proven. 45 refuted. 0 times theorem prover too weak. 2311 trivial. 0 not checked. [2025-03-08 15:20:40,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:20:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 93 proven. 45 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-08 15:20:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72201338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:20:40,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:20:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-08 15:20:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146884017] [2025-03-08 15:20:40,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:20:40,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:20:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:20:40,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:20:40,586 INFO L87 Difference]: Start difference. First operand 3726 states and 5891 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2025-03-08 15:20:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:41,191 INFO L93 Difference]: Finished difference Result 7467 states and 11719 transitions. [2025-03-08 15:20:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:20:41,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) Word has length 311 [2025-03-08 15:20:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:41,206 INFO L225 Difference]: With dead ends: 7467 [2025-03-08 15:20:41,206 INFO L226 Difference]: Without dead ends: 3845 [2025-03-08 15:20:41,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:20:41,214 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 392 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:41,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 554 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:20:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2025-03-08 15:20:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3781. [2025-03-08 15:20:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 2702 states have (on average 1.4278312361213916) internal successors, (3858), 2719 states have internal predecessors, (3858), 1020 states have call successors, (1020), 58 states have call predecessors, (1020), 58 states have return successors, (1020), 1003 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-08 15:20:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5898 transitions. [2025-03-08 15:20:41,617 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5898 transitions. Word has length 311 [2025-03-08 15:20:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:41,618 INFO L471 AbstractCegarLoop]: Abstraction has 3781 states and 5898 transitions. [2025-03-08 15:20:41,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2025-03-08 15:20:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5898 transitions. [2025-03-08 15:20:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 15:20:41,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:41,621 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:41,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:20:41,821 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,SelfDestructingSolverStorable11 [2025-03-08 15:20:41,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash 467967184, now seen corresponding path program 1 times [2025-03-08 15:20:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190984754] [2025-03-08 15:20:41,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:41,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 66 proven. 204 refuted. 0 times theorem prover too weak. 4054 trivial. 0 not checked. [2025-03-08 15:20:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190984754] [2025-03-08 15:20:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190984754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:20:42,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612802905] [2025-03-08 15:20:42,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:42,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:42,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:42,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:20:42,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:20:42,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 15:20:42,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 15:20:42,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:42,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 15:20:42,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:20:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 3083 proven. 219 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2025-03-08 15:20:44,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:20:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 126 proven. 12 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-08 15:20:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612802905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:20:45,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:20:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 6] total 26 [2025-03-08 15:20:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139726167] [2025-03-08 15:20:45,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:20:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 15:20:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:45,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 15:20:45,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:20:45,729 INFO L87 Difference]: Start difference. First operand 3781 states and 5898 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 states have internal predecessors, (211), 9 states have call successors, (119), 6 states have call predecessors, (119), 11 states have return successors, (121), 9 states have call predecessors, (121), 9 states have call successors, (121) [2025-03-08 15:20:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:50,412 INFO L93 Difference]: Finished difference Result 6900 states and 10370 transitions. [2025-03-08 15:20:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 15:20:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 states have internal predecessors, (211), 9 states have call successors, (119), 6 states have call predecessors, (119), 11 states have return successors, (121), 9 states have call predecessors, (121), 9 states have call successors, (121) Word has length 311 [2025-03-08 15:20:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:50,427 INFO L225 Difference]: With dead ends: 6900 [2025-03-08 15:20:50,427 INFO L226 Difference]: Without dead ends: 3370 [2025-03-08 15:20:50,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2026, Invalid=7874, Unknown=0, NotChecked=0, Total=9900 [2025-03-08 15:20:50,439 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1066 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:50,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1639 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:20:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2025-03-08 15:20:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2063. [2025-03-08 15:20:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1549 states have (on average 1.367979341510652) internal successors, (2119), 1552 states have internal predecessors, (2119), 414 states have call successors, (414), 99 states have call predecessors, (414), 99 states have return successors, (414), 411 states have call predecessors, (414), 414 states have call successors, (414) [2025-03-08 15:20:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2947 transitions. [2025-03-08 15:20:50,646 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2947 transitions. Word has length 311 [2025-03-08 15:20:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:50,647 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2947 transitions. [2025-03-08 15:20:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 states have internal predecessors, (211), 9 states have call successors, (119), 6 states have call predecessors, (119), 11 states have return successors, (121), 9 states have call predecessors, (121), 9 states have call successors, (121) [2025-03-08 15:20:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2947 transitions. [2025-03-08 15:20:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-08 15:20:50,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:50,650 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:20:50,659 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-08 15:20:50,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:50,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:50,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 37290562, now seen corresponding path program 1 times [2025-03-08 15:20:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252909544] [2025-03-08 15:20:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 15:20:51,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 15:20:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:51,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-08 15:20:53,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252909544] [2025-03-08 15:20:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252909544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:53,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:53,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:20:53,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137225199] [2025-03-08 15:20:53,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:53,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:20:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:53,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:20:53,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:20:53,309 INFO L87 Difference]: Start difference. First operand 2063 states and 2947 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47)