/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-30 23:52:23,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-30 23:52:23,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-30 23:52:23,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-30 23:52:23,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-30 23:52:23,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-30 23:52:23,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-30 23:52:23,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-30 23:52:23,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-30 23:52:23,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-30 23:52:23,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-30 23:52:23,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-30 23:52:23,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-30 23:52:23,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-30 23:52:23,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-30 23:52:23,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-30 23:52:23,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-30 23:52:23,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-30 23:52:23,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-30 23:52:23,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-30 23:52:23,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-30 23:52:23,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-30 23:52:23,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-30 23:52:23,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-30 23:52:24,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-30 23:52:24,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-30 23:52:24,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-30 23:52:24,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-30 23:52:24,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-30 23:52:24,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-30 23:52:24,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-30 23:52:24,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-30 23:52:24,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-30 23:52:24,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-30 23:52:24,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-30 23:52:24,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-30 23:52:24,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-30 23:52:24,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-30 23:52:24,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-30 23:52:24,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-30 23:52:24,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-30 23:52:24,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-30 23:52:24,041 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-30 23:52:24,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-30 23:52:24,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-30 23:52:24,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-30 23:52:24,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-30 23:52:24,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-30 23:52:24,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-30 23:52:24,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-30 23:52:24,044 INFO L138 SettingsManager]: * Use SBE=true [2023-03-30 23:52:24,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-30 23:52:24,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-30 23:52:24,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-30 23:52:24,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-30 23:52:24,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-30 23:52:24,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 23:52:24,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-30 23:52:24,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-30 23:52:24,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-30 23:52:24,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-30 23:52:24,049 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-30 23:52:24,049 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-03-30 23:52:24,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-30 23:52:24,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-30 23:52:24,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-30 23:52:24,318 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-30 23:52:24,319 INFO L275 PluginConnector]: CDTParser initialized [2023-03-30 23:52:24,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2023-03-30 23:52:25,488 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-30 23:52:25,687 INFO L351 CDTParser]: Found 1 translation units. [2023-03-30 23:52:25,688 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2023-03-30 23:52:25,704 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb52c25f6/3723cfd531984c24af470c3ae7bbdd61/FLAG44d0fbd23 [2023-03-30 23:52:25,725 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb52c25f6/3723cfd531984c24af470c3ae7bbdd61 [2023-03-30 23:52:25,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-30 23:52:25,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-30 23:52:25,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-30 23:52:25,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-30 23:52:25,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-30 23:52:25,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 11:52:25" (1/1) ... [2023-03-30 23:52:25,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca37afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:25, skipping insertion in model container [2023-03-30 23:52:25,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 11:52:25" (1/1) ... [2023-03-30 23:52:25,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-30 23:52:25,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-30 23:52:26,050 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2023-03-30 23:52:26,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 23:52:26,073 INFO L203 MainTranslator]: Completed pre-run [2023-03-30 23:52:26,149 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2023-03-30 23:52:26,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 23:52:26,163 INFO L208 MainTranslator]: Completed translation [2023-03-30 23:52:26,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26 WrapperNode [2023-03-30 23:52:26,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-30 23:52:26,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-30 23:52:26,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-30 23:52:26,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-30 23:52:26,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,246 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-30 23:52:26,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-30 23:52:26,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-30 23:52:26,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-30 23:52:26,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (1/1) ... [2023-03-30 23:52:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 23:52:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:26,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-30 23:52:26,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-30 23:52:26,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-30 23:52:26,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-30 23:52:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-30 23:52:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-30 23:52:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-30 23:52:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-30 23:52:26,431 INFO L236 CfgBuilder]: Building ICFG [2023-03-30 23:52:26,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-30 23:52:27,057 INFO L277 CfgBuilder]: Performing block encoding [2023-03-30 23:52:27,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-30 23:52:27,065 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-30 23:52:27,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 11:52:27 BoogieIcfgContainer [2023-03-30 23:52:27,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-30 23:52:27,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-30 23:52:27,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-30 23:52:27,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-30 23:52:27,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.03 11:52:25" (1/3) ... [2023-03-30 23:52:27,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712088f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 11:52:27, skipping insertion in model container [2023-03-30 23:52:27,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 11:52:26" (2/3) ... [2023-03-30 23:52:27,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712088f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 11:52:27, skipping insertion in model container [2023-03-30 23:52:27,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 11:52:27" (3/3) ... [2023-03-30 23:52:27,074 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2023-03-30 23:52:27,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-30 23:52:27,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-30 23:52:27,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-30 23:52:27,138 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@39ce2400, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-30 23:52:27,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-30 23:52:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 109 states have (on average 1.944954128440367) internal successors, (212), 110 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-30 23:52:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-03-30 23:52:27,148 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:27,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:27,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:27,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1592323151, now seen corresponding path program 1 times [2023-03-30 23:52:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103302538] [2023-03-30 23:52:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:27,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103302538] [2023-03-30 23:52:27,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103302538] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:27,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:27,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:27,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232398976] [2023-03-30 23:52:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:27,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:27,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:27,456 INFO L87 Difference]: Start difference. First operand has 115 states, 109 states have (on average 1.944954128440367) internal successors, (212), 110 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:28,199 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2023-03-30 23:52:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-03-30 23:52:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:28,215 INFO L225 Difference]: With dead ends: 331 [2023-03-30 23:52:28,215 INFO L226 Difference]: Without dead ends: 197 [2023-03-30 23:52:28,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:28,222 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 567 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:28,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 16 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-03-30 23:52:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-03-30 23:52:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2023-03-30 23:52:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 178 states have (on average 1.696629213483146) internal successors, (302), 178 states have internal predecessors, (302), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 305 transitions. [2023-03-30 23:52:28,280 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 305 transitions. Word has length 14 [2023-03-30 23:52:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:28,281 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 305 transitions. [2023-03-30 23:52:28,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 305 transitions. [2023-03-30 23:52:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-03-30 23:52:28,282 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:28,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:28,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-30 23:52:28,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:28,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 129905018, now seen corresponding path program 1 times [2023-03-30 23:52:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702445935] [2023-03-30 23:52:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:28,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:28,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702445935] [2023-03-30 23:52:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702445935] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:28,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:28,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821059200] [2023-03-30 23:52:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:28,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:28,389 INFO L87 Difference]: Start difference. First operand 182 states and 305 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:28,793 INFO L93 Difference]: Finished difference Result 365 states and 614 transitions. [2023-03-30 23:52:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-03-30 23:52:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:28,796 INFO L225 Difference]: With dead ends: 365 [2023-03-30 23:52:28,796 INFO L226 Difference]: Without dead ends: 189 [2023-03-30 23:52:28,797 INFO L412 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 [2023-03-30 23:52:28,798 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:28,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 12 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-30 23:52:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-03-30 23:52:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2023-03-30 23:52:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6756756756756757) internal successors, (310), 185 states have internal predecessors, (310), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 313 transitions. [2023-03-30 23:52:28,812 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 313 transitions. Word has length 15 [2023-03-30 23:52:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:28,813 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 313 transitions. [2023-03-30 23:52:28,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 313 transitions. [2023-03-30 23:52:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-30 23:52:28,814 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:28,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:28,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-30 23:52:28,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:28,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2112573703, now seen corresponding path program 1 times [2023-03-30 23:52:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068166148] [2023-03-30 23:52:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068166148] [2023-03-30 23:52:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068166148] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-30 23:52:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809861250] [2023-03-30 23:52:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 23:52:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 23:52:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:29,117 INFO L87 Difference]: Start difference. First operand 189 states and 313 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:29,629 INFO L93 Difference]: Finished difference Result 283 states and 458 transitions. [2023-03-30 23:52:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-30 23:52:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-03-30 23:52:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:29,631 INFO L225 Difference]: With dead ends: 283 [2023-03-30 23:52:29,631 INFO L226 Difference]: Without dead ends: 276 [2023-03-30 23:52:29,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-03-30 23:52:29,632 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 433 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:29,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 12 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-30 23:52:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-03-30 23:52:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2023-03-30 23:52:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.6627450980392158) internal successors, (424), 255 states have internal predecessors, (424), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 427 transitions. [2023-03-30 23:52:29,648 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 427 transitions. Word has length 21 [2023-03-30 23:52:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:29,649 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 427 transitions. [2023-03-30 23:52:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 427 transitions. [2023-03-30 23:52:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-03-30 23:52:29,650 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:29,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:29,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-30 23:52:29,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:29,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash -478444640, now seen corresponding path program 1 times [2023-03-30 23:52:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244482061] [2023-03-30 23:52:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244482061] [2023-03-30 23:52:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244482061] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357723852] [2023-03-30 23:52:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:29,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:29,698 INFO L87 Difference]: Start difference. First operand 259 states and 427 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:29,990 INFO L93 Difference]: Finished difference Result 393 states and 645 transitions. [2023-03-30 23:52:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-03-30 23:52:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:29,992 INFO L225 Difference]: With dead ends: 393 [2023-03-30 23:52:29,992 INFO L226 Difference]: Without dead ends: 141 [2023-03-30 23:52:29,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:29,994 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 212 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:29,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 12 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-30 23:52:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-03-30 23:52:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2023-03-30 23:52:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 135 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 220 transitions. [2023-03-30 23:52:30,010 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 220 transitions. Word has length 22 [2023-03-30 23:52:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:30,010 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 220 transitions. [2023-03-30 23:52:30,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 220 transitions. [2023-03-30 23:52:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-03-30 23:52:30,011 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:30,011 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:30,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-30 23:52:30,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:30,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 825633227, now seen corresponding path program 1 times [2023-03-30 23:52:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825068272] [2023-03-30 23:52:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825068272] [2023-03-30 23:52:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825068272] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795611617] [2023-03-30 23:52:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:30,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:30,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:30,121 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) [2023-03-30 23:52:30,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-30 23:52:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2023-03-30 23:52:30,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-03-30 23:52:30,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-30 23:52:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795611617] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-30 23:52:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-03-30 23:52:30,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429945708] [2023-03-30 23:52:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:30,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-30 23:52:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-30 23:52:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-30 23:52:30,257 INFO L87 Difference]: Start difference. First operand 139 states and 220 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:30,297 INFO L93 Difference]: Finished difference Result 247 states and 393 transitions. [2023-03-30 23:52:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-30 23:52:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-03-30 23:52:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:30,299 INFO L225 Difference]: With dead ends: 247 [2023-03-30 23:52:30,299 INFO L226 Difference]: Without dead ends: 119 [2023-03-30 23:52:30,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-30 23:52:30,300 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 101 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:30,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 188 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 23:52:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-03-30 23:52:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-03-30 23:52:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.575221238938053) internal successors, (178), 113 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 181 transitions. [2023-03-30 23:52:30,325 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 181 transitions. Word has length 28 [2023-03-30 23:52:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:30,326 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 181 transitions. [2023-03-30 23:52:30,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 181 transitions. [2023-03-30 23:52:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-30 23:52:30,327 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:30,327 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-30 23:52:30,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:30,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:30,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 975568684, now seen corresponding path program 1 times [2023-03-30 23:52:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026344084] [2023-03-30 23:52:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026344084] [2023-03-30 23:52:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026344084] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406787831] [2023-03-30 23:52:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:30,610 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) [2023-03-30 23:52:30,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-30 23:52:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:30,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-30 23:52:30,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:30,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406787831] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:30,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:30,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-03-30 23:52:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052732723] [2023-03-30 23:52:30,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:30,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-30 23:52:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:30,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-30 23:52:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-03-30 23:52:30,784 INFO L87 Difference]: Start difference. First operand 117 states and 181 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:31,705 INFO L93 Difference]: Finished difference Result 467 states and 756 transitions. [2023-03-30 23:52:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-03-30 23:52:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-03-30 23:52:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:31,708 INFO L225 Difference]: With dead ends: 467 [2023-03-30 23:52:31,708 INFO L226 Difference]: Without dead ends: 371 [2023-03-30 23:52:31,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-03-30 23:52:31,709 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1073 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:31,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 22 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-30 23:52:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-03-30 23:52:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 314. [2023-03-30 23:52:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 310 states have (on average 1.7096774193548387) internal successors, (530), 310 states have internal predecessors, (530), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 533 transitions. [2023-03-30 23:52:31,724 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 533 transitions. Word has length 30 [2023-03-30 23:52:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:31,724 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 533 transitions. [2023-03-30 23:52:31,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 533 transitions. [2023-03-30 23:52:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-30 23:52:31,725 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:31,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:31,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:31,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-03-30 23:52:31,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:31,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1655627054, now seen corresponding path program 1 times [2023-03-30 23:52:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474424322] [2023-03-30 23:52:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:31,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474424322] [2023-03-30 23:52:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474424322] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:31,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677712675] [2023-03-30 23:52:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:31,995 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) [2023-03-30 23:52:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-30 23:52:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:32,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-30 23:52:32,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:32,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677712675] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:32,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-03-30 23:52:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311196230] [2023-03-30 23:52:32,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:32,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-30 23:52:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-30 23:52:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-30 23:52:32,124 INFO L87 Difference]: Start difference. First operand 314 states and 533 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:32,759 INFO L93 Difference]: Finished difference Result 602 states and 1030 transitions. [2023-03-30 23:52:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-30 23:52:32,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-03-30 23:52:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:32,762 INFO L225 Difference]: With dead ends: 602 [2023-03-30 23:52:32,762 INFO L226 Difference]: Without dead ends: 590 [2023-03-30 23:52:32,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-03-30 23:52:32,763 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 557 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:32,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 22 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-03-30 23:52:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-03-30 23:52:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 576. [2023-03-30 23:52:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 572 states have (on average 1.6905594405594406) internal successors, (967), 572 states have internal predecessors, (967), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 970 transitions. [2023-03-30 23:52:32,785 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 970 transitions. Word has length 30 [2023-03-30 23:52:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:32,785 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 970 transitions. [2023-03-30 23:52:32,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 970 transitions. [2023-03-30 23:52:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 23:52:32,786 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:32,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:32,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:32,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:32,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -203725321, now seen corresponding path program 1 times [2023-03-30 23:52:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744036030] [2023-03-30 23:52:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744036030] [2023-03-30 23:52:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744036030] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:33,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549349124] [2023-03-30 23:52:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:33,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:33,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-30 23:52:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:33,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjunts are in the unsatisfiable core [2023-03-30 23:52:33,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:33,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549349124] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:33,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-03-30 23:52:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601661010] [2023-03-30 23:52:33,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:33,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-30 23:52:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-30 23:52:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-03-30 23:52:33,479 INFO L87 Difference]: Start difference. First operand 576 states and 970 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:34,680 INFO L93 Difference]: Finished difference Result 755 states and 1253 transitions. [2023-03-30 23:52:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-30 23:52:34,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-03-30 23:52:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:34,685 INFO L225 Difference]: With dead ends: 755 [2023-03-30 23:52:34,686 INFO L226 Difference]: Without dead ends: 738 [2023-03-30 23:52:34,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-03-30 23:52:34,687 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 498 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:34,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 32 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-30 23:52:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-03-30 23:52:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 715. [2023-03-30 23:52:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 711 states have (on average 1.6765119549929677) internal successors, (1192), 711 states have internal predecessors, (1192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1195 transitions. [2023-03-30 23:52:34,713 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1195 transitions. Word has length 31 [2023-03-30 23:52:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:34,714 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 1195 transitions. [2023-03-30 23:52:34,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1195 transitions. [2023-03-30 23:52:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-03-30 23:52:34,718 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:34,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:34,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:34,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:34,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:34,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1320649931, now seen corresponding path program 1 times [2023-03-30 23:52:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978930542] [2023-03-30 23:52:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-03-30 23:52:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978930542] [2023-03-30 23:52:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978930542] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:34,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:34,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148264427] [2023-03-30 23:52:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:34,989 INFO L87 Difference]: Start difference. First operand 715 states and 1195 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:35,249 INFO L93 Difference]: Finished difference Result 1334 states and 2217 transitions. [2023-03-30 23:52:35,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:35,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-03-30 23:52:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:35,257 INFO L225 Difference]: With dead ends: 1334 [2023-03-30 23:52:35,257 INFO L226 Difference]: Without dead ends: 649 [2023-03-30 23:52:35,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:35,259 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:35,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 12 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 23:52:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-03-30 23:52:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2023-03-30 23:52:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 643 states have (on average 1.6283048211508553) internal successors, (1047), 643 states have internal predecessors, (1047), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1050 transitions. [2023-03-30 23:52:35,283 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1050 transitions. Word has length 32 [2023-03-30 23:52:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:35,283 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 1050 transitions. [2023-03-30 23:52:35,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1050 transitions. [2023-03-30 23:52:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-03-30 23:52:35,284 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:35,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:35,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-30 23:52:35,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:35,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1550800446, now seen corresponding path program 1 times [2023-03-30 23:52:35,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:35,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894220758] [2023-03-30 23:52:35,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:35,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-30 23:52:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894220758] [2023-03-30 23:52:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894220758] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:35,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:35,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236907464] [2023-03-30 23:52:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:35,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:35,339 INFO L87 Difference]: Start difference. First operand 647 states and 1050 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:35,582 INFO L93 Difference]: Finished difference Result 1247 states and 2037 transitions. [2023-03-30 23:52:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:35,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-03-30 23:52:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:35,585 INFO L225 Difference]: With dead ends: 1247 [2023-03-30 23:52:35,586 INFO L226 Difference]: Without dead ends: 649 [2023-03-30 23:52:35,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:35,587 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:35,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 12 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 23:52:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-03-30 23:52:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2023-03-30 23:52:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 643 states have (on average 1.6158631415241058) internal successors, (1039), 643 states have internal predecessors, (1039), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1042 transitions. [2023-03-30 23:52:35,631 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1042 transitions. Word has length 40 [2023-03-30 23:52:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:35,632 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 1042 transitions. [2023-03-30 23:52:35,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1042 transitions. [2023-03-30 23:52:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-03-30 23:52:35,633 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:35,633 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:35,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-30 23:52:35,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:35,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash -713540502, now seen corresponding path program 1 times [2023-03-30 23:52:35,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:35,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050492335] [2023-03-30 23:52:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050492335] [2023-03-30 23:52:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050492335] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376885500] [2023-03-30 23:52:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:35,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:35,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:35,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-30 23:52:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:35,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2023-03-30 23:52:35,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-30 23:52:36,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-30 23:52:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376885500] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:36,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2023-03-30 23:52:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79950052] [2023-03-30 23:52:36,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:36,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-30 23:52:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-30 23:52:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-03-30 23:52:36,253 INFO L87 Difference]: Start difference. First operand 647 states and 1042 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:37,887 INFO L93 Difference]: Finished difference Result 1543 states and 2471 transitions. [2023-03-30 23:52:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-30 23:52:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-03-30 23:52:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:37,892 INFO L225 Difference]: With dead ends: 1543 [2023-03-30 23:52:37,892 INFO L226 Difference]: Without dead ends: 922 [2023-03-30 23:52:37,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2023-03-30 23:52:37,895 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 911 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:37,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 42 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-30 23:52:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-03-30 23:52:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 862. [2023-03-30 23:52:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 858 states have (on average 1.6037296037296038) internal successors, (1376), 858 states have internal predecessors, (1376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1379 transitions. [2023-03-30 23:52:37,929 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1379 transitions. Word has length 41 [2023-03-30 23:52:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:37,929 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1379 transitions. [2023-03-30 23:52:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1379 transitions. [2023-03-30 23:52:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-03-30 23:52:37,930 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:37,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:37,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-03-30 23:52:38,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:38,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -633472549, now seen corresponding path program 1 times [2023-03-30 23:52:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470583236] [2023-03-30 23:52:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 23:52:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470583236] [2023-03-30 23:52:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470583236] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190234104] [2023-03-30 23:52:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:38,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:38,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:38,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:38,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-30 23:52:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:38,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2023-03-30 23:52:38,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 23:52:38,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 23:52:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190234104] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:38,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-03-30 23:52:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701441406] [2023-03-30 23:52:38,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:38,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 23:52:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 23:52:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:38,418 INFO L87 Difference]: Start difference. First operand 862 states and 1379 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:38,852 INFO L93 Difference]: Finished difference Result 876 states and 1391 transitions. [2023-03-30 23:52:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-30 23:52:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-03-30 23:52:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:38,857 INFO L225 Difference]: With dead ends: 876 [2023-03-30 23:52:38,858 INFO L226 Difference]: Without dead ends: 864 [2023-03-30 23:52:38,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-03-30 23:52:38,859 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 476 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:38,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 17 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-30 23:52:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-03-30 23:52:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 862. [2023-03-30 23:52:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 858 states have (on average 1.5547785547785549) internal successors, (1334), 858 states have internal predecessors, (1334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1337 transitions. [2023-03-30 23:52:38,888 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1337 transitions. Word has length 42 [2023-03-30 23:52:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:38,889 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1337 transitions. [2023-03-30 23:52:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1337 transitions. [2023-03-30 23:52:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-03-30 23:52:38,890 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:38,891 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:38,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:39,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:39,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:39,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1484540844, now seen corresponding path program 1 times [2023-03-30 23:52:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574369139] [2023-03-30 23:52:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:39,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:39,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574369139] [2023-03-30 23:52:39,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574369139] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:39,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693613815] [2023-03-30 23:52:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:39,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:39,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-30 23:52:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:39,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 13 conjunts are in the unsatisfiable core [2023-03-30 23:52:39,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:39,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693613815] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:40,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2023-03-30 23:52:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285339960] [2023-03-30 23:52:40,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-30 23:52:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-30 23:52:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-03-30 23:52:40,020 INFO L87 Difference]: Start difference. First operand 862 states and 1337 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:40,667 INFO L93 Difference]: Finished difference Result 890 states and 1370 transitions. [2023-03-30 23:52:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-30 23:52:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-03-30 23:52:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:40,671 INFO L225 Difference]: With dead ends: 890 [2023-03-30 23:52:40,671 INFO L226 Difference]: Without dead ends: 888 [2023-03-30 23:52:40,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-03-30 23:52:40,672 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 464 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:40,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 27 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-03-30 23:52:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2023-03-30 23:52:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 862. [2023-03-30 23:52:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 858 states have (on average 1.5536130536130537) internal successors, (1333), 858 states have internal predecessors, (1333), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1336 transitions. [2023-03-30 23:52:40,704 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1336 transitions. Word has length 44 [2023-03-30 23:52:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:40,704 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1336 transitions. [2023-03-30 23:52:40,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1336 transitions. [2023-03-30 23:52:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-03-30 23:52:40,705 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:40,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:40,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:40,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:40,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1098636328, now seen corresponding path program 1 times [2023-03-30 23:52:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071672009] [2023-03-30 23:52:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-30 23:52:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071672009] [2023-03-30 23:52:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071672009] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435079525] [2023-03-30 23:52:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:40,956 INFO L87 Difference]: Start difference. First operand 862 states and 1336 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:41,200 INFO L93 Difference]: Finished difference Result 1740 states and 2674 transitions. [2023-03-30 23:52:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-03-30 23:52:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:41,204 INFO L225 Difference]: With dead ends: 1740 [2023-03-30 23:52:41,204 INFO L226 Difference]: Without dead ends: 927 [2023-03-30 23:52:41,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:41,206 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:41,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 12 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 23:52:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2023-03-30 23:52:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 925. [2023-03-30 23:52:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 921 states have (on average 1.504885993485342) internal successors, (1386), 921 states have internal predecessors, (1386), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1389 transitions. [2023-03-30 23:52:41,238 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1389 transitions. Word has length 45 [2023-03-30 23:52:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:41,238 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1389 transitions. [2023-03-30 23:52:41,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1389 transitions. [2023-03-30 23:52:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-03-30 23:52:41,239 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:41,239 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:41,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-30 23:52:41,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:41,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1895361513, now seen corresponding path program 1 times [2023-03-30 23:52:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238006879] [2023-03-30 23:52:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-03-30 23:52:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238006879] [2023-03-30 23:52:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238006879] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 23:52:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-30 23:52:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731782091] [2023-03-30 23:52:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-30 23:52:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-30 23:52:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-30 23:52:41,311 INFO L87 Difference]: Start difference. First operand 925 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:41,504 INFO L93 Difference]: Finished difference Result 1335 states and 2001 transitions. [2023-03-30 23:52:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-30 23:52:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-03-30 23:52:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:41,506 INFO L225 Difference]: With dead ends: 1335 [2023-03-30 23:52:41,507 INFO L226 Difference]: Without dead ends: 518 [2023-03-30 23:52:41,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-30 23:52:41,508 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:41,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 12 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 23:52:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-03-30 23:52:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2023-03-30 23:52:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.466796875) internal successors, (751), 512 states have internal predecessors, (751), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 754 transitions. [2023-03-30 23:52:41,529 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 754 transitions. Word has length 57 [2023-03-30 23:52:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:41,529 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 754 transitions. [2023-03-30 23:52:41,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 754 transitions. [2023-03-30 23:52:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-03-30 23:52:41,530 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:41,530 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:41,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-30 23:52:41,531 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:41,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -777426197, now seen corresponding path program 1 times [2023-03-30 23:52:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:41,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621289225] [2023-03-30 23:52:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-30 23:52:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621289225] [2023-03-30 23:52:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621289225] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375557613] [2023-03-30 23:52:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:41,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:41,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-30 23:52:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:41,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-30 23:52:41,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-30 23:52:41,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-30 23:52:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375557613] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 23:52:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-30 23:52:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-03-30 23:52:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578523409] [2023-03-30 23:52:41,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 23:52:41,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 23:52:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 23:52:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-03-30 23:52:41,824 INFO L87 Difference]: Start difference. First operand 516 states and 754 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:41,872 INFO L93 Difference]: Finished difference Result 523 states and 758 transitions. [2023-03-30 23:52:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-30 23:52:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-03-30 23:52:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:41,875 INFO L225 Difference]: With dead ends: 523 [2023-03-30 23:52:41,875 INFO L226 Difference]: Without dead ends: 520 [2023-03-30 23:52:41,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-03-30 23:52:41,876 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 226 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:41,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 359 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 23:52:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-03-30 23:52:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 516. [2023-03-30 23:52:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.462890625) internal successors, (749), 512 states have internal predecessors, (749), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 752 transitions. [2023-03-30 23:52:41,896 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 752 transitions. Word has length 59 [2023-03-30 23:52:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:41,896 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 752 transitions. [2023-03-30 23:52:41,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 752 transitions. [2023-03-30 23:52:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-03-30 23:52:41,897 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:41,897 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:41,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:42,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-03-30 23:52:42,105 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:42,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1681043038, now seen corresponding path program 1 times [2023-03-30 23:52:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987458057] [2023-03-30 23:52:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987458057] [2023-03-30 23:52:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987458057] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453587426] [2023-03-30 23:52:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:42,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:42,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:42,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:42,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-30 23:52:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:42,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 19 conjunts are in the unsatisfiable core [2023-03-30 23:52:42,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:42,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453587426] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:42,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:42,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-03-30 23:52:42,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117432747] [2023-03-30 23:52:42,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:42,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-30 23:52:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-30 23:52:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-03-30 23:52:42,929 INFO L87 Difference]: Start difference. First operand 516 states and 752 transitions. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 13 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:43,877 INFO L93 Difference]: Finished difference Result 526 states and 757 transitions. [2023-03-30 23:52:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-30 23:52:43,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 13 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-03-30 23:52:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:43,880 INFO L225 Difference]: With dead ends: 526 [2023-03-30 23:52:43,880 INFO L226 Difference]: Without dead ends: 524 [2023-03-30 23:52:43,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-03-30 23:52:43,881 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 471 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:43,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 47 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-03-30 23:52:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2023-03-30 23:52:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 516. [2023-03-30 23:52:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.45703125) internal successors, (746), 512 states have internal predecessors, (746), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 749 transitions. [2023-03-30 23:52:43,900 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 749 transitions. Word has length 60 [2023-03-30 23:52:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:43,900 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 749 transitions. [2023-03-30 23:52:43,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 13 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 749 transitions. [2023-03-30 23:52:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-03-30 23:52:43,901 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:43,901 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:43,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:44,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-03-30 23:52:44,106 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:44,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2119245034, now seen corresponding path program 1 times [2023-03-30 23:52:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762021900] [2023-03-30 23:52:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762021900] [2023-03-30 23:52:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762021900] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403150141] [2023-03-30 23:52:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:44,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:44,570 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:44,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-30 23:52:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:44,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 21 conjunts are in the unsatisfiable core [2023-03-30 23:52:44,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:44,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-03-30 23:52:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403150141] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:45,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 13 [2023-03-30 23:52:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213521313] [2023-03-30 23:52:45,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:45,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-30 23:52:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-30 23:52:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-03-30 23:52:45,264 INFO L87 Difference]: Start difference. First operand 516 states and 749 transitions. Second operand has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 12 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:46,544 INFO L93 Difference]: Finished difference Result 616 states and 887 transitions. [2023-03-30 23:52:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-30 23:52:46,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 12 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2023-03-30 23:52:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:46,546 INFO L225 Difference]: With dead ends: 616 [2023-03-30 23:52:46,546 INFO L226 Difference]: Without dead ends: 606 [2023-03-30 23:52:46,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-03-30 23:52:46,547 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 684 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:46,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 37 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-30 23:52:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-03-30 23:52:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2023-03-30 23:52:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 594 states have (on average 1.4242424242424243) internal successors, (846), 594 states have internal predecessors, (846), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 849 transitions. [2023-03-30 23:52:46,573 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 849 transitions. Word has length 67 [2023-03-30 23:52:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:46,573 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 849 transitions. [2023-03-30 23:52:46,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 12 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 849 transitions. [2023-03-30 23:52:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-30 23:52:46,574 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:46,574 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:46,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:46,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-03-30 23:52:46,780 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:46,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1894504637, now seen corresponding path program 1 times [2023-03-30 23:52:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203598539] [2023-03-30 23:52:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:46,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-30 23:52:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203598539] [2023-03-30 23:52:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203598539] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629671998] [2023-03-30 23:52:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:47,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:47,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:47,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-30 23:52:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:47,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 29 conjunts are in the unsatisfiable core [2023-03-30 23:52:47,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:47,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 23:52:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629671998] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:48,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-03-30 23:52:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337358451] [2023-03-30 23:52:48,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:48,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-03-30 23:52:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-03-30 23:52:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-03-30 23:52:48,170 INFO L87 Difference]: Start difference. First operand 598 states and 849 transitions. Second operand has 22 states, 22 states have (on average 10.227272727272727) internal successors, (225), 21 states have internal predecessors, (225), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:49,403 INFO L93 Difference]: Finished difference Result 641 states and 905 transitions. [2023-03-30 23:52:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-30 23:52:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.227272727272727) internal successors, (225), 21 states have internal predecessors, (225), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2023-03-30 23:52:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:49,405 INFO L225 Difference]: With dead ends: 641 [2023-03-30 23:52:49,405 INFO L226 Difference]: Without dead ends: 639 [2023-03-30 23:52:49,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2023-03-30 23:52:49,406 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 680 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:49,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 57 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-30 23:52:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-03-30 23:52:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 598. [2023-03-30 23:52:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 594 states have (on average 1.4225589225589226) internal successors, (845), 594 states have internal predecessors, (845), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 848 transitions. [2023-03-30 23:52:49,430 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 848 transitions. Word has length 90 [2023-03-30 23:52:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:49,430 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 848 transitions. [2023-03-30 23:52:49,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.227272727272727) internal successors, (225), 21 states have internal predecessors, (225), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 848 transitions. [2023-03-30 23:52:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-30 23:52:49,431 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:49,431 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:49,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:49,643 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:49,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1954077384, now seen corresponding path program 1 times [2023-03-30 23:52:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970303515] [2023-03-30 23:52:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 57 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-30 23:52:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970303515] [2023-03-30 23:52:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970303515] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590936472] [2023-03-30 23:52:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:49,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:49,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:49,812 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:49,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-03-30 23:52:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:49,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjunts are in the unsatisfiable core [2023-03-30 23:52:49,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 57 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-30 23:52:49,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 57 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-30 23:52:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590936472] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:50,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-03-30 23:52:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544752188] [2023-03-30 23:52:50,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:50,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-30 23:52:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-30 23:52:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-03-30 23:52:50,114 INFO L87 Difference]: Start difference. First operand 598 states and 848 transitions. Second operand has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 13 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:51,533 INFO L93 Difference]: Finished difference Result 1797 states and 2541 transitions. [2023-03-30 23:52:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-30 23:52:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 13 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2023-03-30 23:52:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:51,537 INFO L225 Difference]: With dead ends: 1797 [2023-03-30 23:52:51,537 INFO L226 Difference]: Without dead ends: 1389 [2023-03-30 23:52:51,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2023-03-30 23:52:51,538 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1815 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 27 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-30 23:52:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2023-03-30 23:52:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1300. [2023-03-30 23:52:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1296 states have (on average 1.4274691358024691) internal successors, (1850), 1296 states have internal predecessors, (1850), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1853 transitions. [2023-03-30 23:52:51,591 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1853 transitions. Word has length 105 [2023-03-30 23:52:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:51,591 INFO L495 AbstractCegarLoop]: Abstraction has 1300 states and 1853 transitions. [2023-03-30 23:52:51,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 13 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1853 transitions. [2023-03-30 23:52:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-03-30 23:52:51,593 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:51,594 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:51,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:51,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:51,799 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:51,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1256399909, now seen corresponding path program 2 times [2023-03-30 23:52:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470134296] [2023-03-30 23:52:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 23:52:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 23:52:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-03-30 23:52:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 23:52:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470134296] [2023-03-30 23:52:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470134296] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 23:52:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141750019] [2023-03-30 23:52:52,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 23:52:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 23:52:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 23:52:52,453 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 23:52:52,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-03-30 23:52:52,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 23:52:52,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 23:52:52,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 21 conjunts are in the unsatisfiable core [2023-03-30 23:52:52,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 23:52:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-03-30 23:52:52,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 23:52:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-03-30 23:52:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141750019] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 23:52:53,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 23:52:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2023-03-30 23:52:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32244696] [2023-03-30 23:52:53,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 23:52:53,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-03-30 23:52:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 23:52:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-03-30 23:52:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2023-03-30 23:52:53,222 INFO L87 Difference]: Start difference. First operand 1300 states and 1853 transitions. Second operand has 21 states, 21 states have (on average 15.619047619047619) internal successors, (328), 20 states have internal predecessors, (328), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 23:52:55,776 INFO L93 Difference]: Finished difference Result 3132 states and 4441 transitions. [2023-03-30 23:52:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-03-30 23:52:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 15.619047619047619) internal successors, (328), 20 states have internal predecessors, (328), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 243 [2023-03-30 23:52:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 23:52:55,782 INFO L225 Difference]: With dead ends: 3132 [2023-03-30 23:52:55,782 INFO L226 Difference]: Without dead ends: 2256 [2023-03-30 23:52:55,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 499 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2023-03-30 23:52:55,784 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4318 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-03-30 23:52:55,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 17 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-03-30 23:52:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2023-03-30 23:52:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2119. [2023-03-30 23:52:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2115 states have (on average 1.4288416075650119) internal successors, (3022), 2115 states have internal predecessors, (3022), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3025 transitions. [2023-03-30 23:52:55,862 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3025 transitions. Word has length 243 [2023-03-30 23:52:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 23:52:55,863 INFO L495 AbstractCegarLoop]: Abstraction has 2119 states and 3025 transitions. [2023-03-30 23:52:55,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 15.619047619047619) internal successors, (328), 20 states have internal predecessors, (328), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-30 23:52:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3025 transitions. [2023-03-30 23:52:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2023-03-30 23:52:55,868 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 23:52:55,868 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:55,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-03-30 23:52:56,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-03-30 23:52:56,075 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 23:52:56,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 23:52:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -472850639, now seen corresponding path program 1 times [2023-03-30 23:52:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 23:52:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475327923] [2023-03-30 23:52:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 23:52:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 23:52:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-30 23:52:56,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-30 23:52:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-30 23:52:57,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-03-30 23:52:57,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-30 23:52:57,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-30 23:52:57,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-03-30 23:52:57,044 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 23:52:57,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-30 23:52:57,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.03 11:52:57 BoogieIcfgContainer [2023-03-30 23:52:57,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-30 23:52:57,184 INFO L158 Benchmark]: Toolchain (without parser) took 31456.50ms. Allocated memory was 182.5MB in the beginning and 520.1MB in the end (delta: 337.6MB). Free memory was 128.0MB in the beginning and 367.5MB in the end (delta: -239.5MB). Peak memory consumption was 294.0MB. Max. memory is 8.0GB. [2023-03-30 23:52:57,185 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-30 23:52:57,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.63ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 108.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-03-30 23:52:57,185 INFO L158 Benchmark]: Boogie Preprocessor took 95.26ms. Allocated memory is still 182.5MB. Free memory was 108.8MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-30 23:52:57,185 INFO L158 Benchmark]: RCFGBuilder took 806.71ms. Allocated memory was 182.5MB in the beginning and 299.9MB in the end (delta: 117.4MB). Free memory was 105.5MB in the beginning and 233.9MB in the end (delta: -128.4MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2023-03-30 23:52:57,186 INFO L158 Benchmark]: TraceAbstraction took 30115.12ms. Allocated memory was 299.9MB in the beginning and 520.1MB in the end (delta: 220.2MB). Free memory was 232.9MB in the beginning and 367.5MB in the end (delta: -134.6MB). Peak memory consumption was 280.9MB. Max. memory is 8.0GB. [2023-03-30 23:52:57,186 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.63ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 108.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.26ms. Allocated memory is still 182.5MB. Free memory was 108.8MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 806.71ms. Allocated memory was 182.5MB in the beginning and 299.9MB in the end (delta: 117.4MB). Free memory was 105.5MB in the beginning and 233.9MB in the end (delta: -128.4MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * TraceAbstraction took 30115.12ms. Allocated memory was 299.9MB in the beginning and 520.1MB in the end (delta: 220.2MB). Free memory was 232.9MB in the beginning and 367.5MB in the end (delta: -134.6MB). Peak memory consumption was 280.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [\old(m_Protocol)=51, \old(m_msg_1_1)=54, \old(m_msg_1_2)=57, \old(m_msg_2)=56, \old(m_recv_ack_1_1)=49, \old(m_recv_ack_1_2)=53, \old(m_recv_ack_2)=52, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=1] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=1] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=2] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=4] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=5] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=5] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=6] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=7] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=7] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=8] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=9] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=9] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=10] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=11] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=11] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=12] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=13] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=13] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=14] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=15] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=15] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=16] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.9s, OverallIterations: 22, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14401 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14401 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18203 IncrementalHoareTripleChecker+Invalid, 18781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 426 mSDtfsCounter, 18203 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1991 GetRequests, 1727 SyntacticMatches, 23 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2119occurred in iteration=21, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 513 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2385 NumberOfCodeBlocks, 2385 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2724 ConstructedInterpolants, 0 QuantifiedInterpolants, 14055 SizeOfPredicates, 25 NumberOfNonLiveVariables, 4483 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 45 InterpolantComputations, 10 PerfectInterpolantSequences, 1400/5690 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-03-30 23:52:57,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...