./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27d160802d278384ef6d8db395ef2d19702d5645 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:01:44,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:01:44,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:01:44,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:01:44,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:01:44,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:01:44,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:01:44,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:01:44,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:01:44,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:01:44,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:01:44,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:01:44,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:01:44,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:01:44,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:01:44,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:01:44,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:01:44,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:01:44,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:01:44,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:01:44,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:01:44,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:01:44,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:01:44,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:01:44,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:01:44,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:01:44,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:01:44,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:01:44,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:01:44,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:01:44,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:01:44,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:01:44,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:01:44,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:01:44,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:01:44,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:01:44,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:01:44,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:01:44,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:01:44,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:01:44,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:01:44,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:01:44,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:01:44,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:01:44,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:01:44,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:01:44,954 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:01:44,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:01:44,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:01:44,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:01:44,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:01:44,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:01:44,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:01:44,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:01:44,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:01:44,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:01:44,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:01:44,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:01:44,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:01:44,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:01:44,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:01:44,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:01:44,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:01:44,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:01:44,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:01:44,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:01:44,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:01:44,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:01:44,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:01:44,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:01:44,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27d160802d278384ef6d8db395ef2d19702d5645 [2019-11-20 07:01:45,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:01:45,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:01:45,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:01:45,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:01:45,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:01:45,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.05.cil-2.c [2019-11-20 07:01:45,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/data/6b464f0ec/555b61345d0949e78062532dace4d522/FLAGbcaef38bb [2019-11-20 07:01:45,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:01:45,624 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/sv-benchmarks/c/systemc/token_ring.05.cil-2.c [2019-11-20 07:01:45,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/data/6b464f0ec/555b61345d0949e78062532dace4d522/FLAGbcaef38bb [2019-11-20 07:01:46,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/data/6b464f0ec/555b61345d0949e78062532dace4d522 [2019-11-20 07:01:46,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:01:46,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:01:46,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:01:46,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:01:46,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:01:46,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624449f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46, skipping insertion in model container [2019-11-20 07:01:46,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:01:46,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:01:46,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:01:46,438 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:01:46,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:01:46,540 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:01:46,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46 WrapperNode [2019-11-20 07:01:46,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:01:46,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:01:46,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:01:46,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:01:46,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:01:46,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:01:46,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:01:46,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:01:46,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... [2019-11-20 07:01:46,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:01:46,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:01:46,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:01:46,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:01:46,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:01:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:01:46,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:01:48,353 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:01:48,353 INFO L285 CfgBuilder]: Removed 198 assume(true) statements. [2019-11-20 07:01:48,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:01:48 BoogieIcfgContainer [2019-11-20 07:01:48,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:01:48,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:01:48,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:01:48,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:01:48,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:01:46" (1/3) ... [2019-11-20 07:01:48,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd2a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:01:48, skipping insertion in model container [2019-11-20 07:01:48,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:01:46" (2/3) ... [2019-11-20 07:01:48,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dd2a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:01:48, skipping insertion in model container [2019-11-20 07:01:48,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:01:48" (3/3) ... [2019-11-20 07:01:48,364 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-2.c [2019-11-20 07:01:48,375 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:01:48,384 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 07:01:48,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 07:01:48,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:01:48,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:01:48,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:01:48,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:01:48,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:01:48,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:01:48,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:01:48,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:01:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states. [2019-11-20 07:01:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:48,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:48,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:48,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash -967631064, now seen corresponding path program 1 times [2019-11-20 07:01:48,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:48,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135158994] [2019-11-20 07:01:48,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:48,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135158994] [2019-11-20 07:01:48,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:48,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:48,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562589555] [2019-11-20 07:01:48,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:48,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:48,757 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 3 states. [2019-11-20 07:01:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:48,838 INFO L93 Difference]: Finished difference Result 1075 states and 1663 transitions. [2019-11-20 07:01:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:48,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:48,864 INFO L225 Difference]: With dead ends: 1075 [2019-11-20 07:01:48,864 INFO L226 Difference]: Without dead ends: 536 [2019-11-20 07:01:48,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-20 07:01:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-20 07:01:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-20 07:01:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 812 transitions. [2019-11-20 07:01:48,969 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 812 transitions. Word has length 83 [2019-11-20 07:01:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:48,969 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 812 transitions. [2019-11-20 07:01:48,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 812 transitions. [2019-11-20 07:01:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:48,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:48,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:48,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1207870810, now seen corresponding path program 1 times [2019-11-20 07:01:48,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:48,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31491344] [2019-11-20 07:01:48,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31491344] [2019-11-20 07:01:49,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602533015] [2019-11-20 07:01:49,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,043 INFO L87 Difference]: Start difference. First operand 536 states and 812 transitions. Second operand 3 states. [2019-11-20 07:01:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:49,134 INFO L93 Difference]: Finished difference Result 1480 states and 2236 transitions. [2019-11-20 07:01:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:49,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:49,140 INFO L225 Difference]: With dead ends: 1480 [2019-11-20 07:01:49,141 INFO L226 Difference]: Without dead ends: 954 [2019-11-20 07:01:49,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-11-20 07:01:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 950. [2019-11-20 07:01:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1434 transitions. [2019-11-20 07:01:49,206 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1434 transitions. Word has length 83 [2019-11-20 07:01:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:49,207 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1434 transitions. [2019-11-20 07:01:49,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1434 transitions. [2019-11-20 07:01:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:49,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:49,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:49,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -258608350, now seen corresponding path program 1 times [2019-11-20 07:01:49,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:49,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523672715] [2019-11-20 07:01:49,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523672715] [2019-11-20 07:01:49,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242048719] [2019-11-20 07:01:49,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,267 INFO L87 Difference]: Start difference. First operand 950 states and 1434 transitions. Second operand 3 states. [2019-11-20 07:01:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:49,320 INFO L93 Difference]: Finished difference Result 1889 states and 2851 transitions. [2019-11-20 07:01:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:49,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:49,327 INFO L225 Difference]: With dead ends: 1889 [2019-11-20 07:01:49,327 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:49,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1426 transitions. [2019-11-20 07:01:49,403 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1426 transitions. Word has length 83 [2019-11-20 07:01:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:49,404 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1426 transitions. [2019-11-20 07:01:49,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1426 transitions. [2019-11-20 07:01:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:49,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:49,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:49,406 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2029102298, now seen corresponding path program 1 times [2019-11-20 07:01:49,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:49,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39876709] [2019-11-20 07:01:49,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39876709] [2019-11-20 07:01:49,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969825488] [2019-11-20 07:01:49,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,471 INFO L87 Difference]: Start difference. First operand 950 states and 1426 transitions. Second operand 3 states. [2019-11-20 07:01:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:49,522 INFO L93 Difference]: Finished difference Result 1888 states and 2834 transitions. [2019-11-20 07:01:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:49,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:49,528 INFO L225 Difference]: With dead ends: 1888 [2019-11-20 07:01:49,528 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:49,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1418 transitions. [2019-11-20 07:01:49,569 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1418 transitions. Word has length 83 [2019-11-20 07:01:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:49,570 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1418 transitions. [2019-11-20 07:01:49,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1418 transitions. [2019-11-20 07:01:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:49,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:49,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:49,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2086215006, now seen corresponding path program 1 times [2019-11-20 07:01:49,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:49,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482127188] [2019-11-20 07:01:49,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482127188] [2019-11-20 07:01:49,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357141401] [2019-11-20 07:01:49,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:49,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,668 INFO L87 Difference]: Start difference. First operand 950 states and 1418 transitions. Second operand 3 states. [2019-11-20 07:01:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:49,721 INFO L93 Difference]: Finished difference Result 1886 states and 2815 transitions. [2019-11-20 07:01:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:49,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:49,727 INFO L225 Difference]: With dead ends: 1886 [2019-11-20 07:01:49,727 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:49,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1410 transitions. [2019-11-20 07:01:49,770 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1410 transitions. Word has length 83 [2019-11-20 07:01:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:49,770 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1410 transitions. [2019-11-20 07:01:49,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1410 transitions. [2019-11-20 07:01:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:49,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:49,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:49,772 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash 41097502, now seen corresponding path program 1 times [2019-11-20 07:01:49,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:49,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049699952] [2019-11-20 07:01:49,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049699952] [2019-11-20 07:01:49,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189843064] [2019-11-20 07:01:49,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:49,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:49,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,825 INFO L87 Difference]: Start difference. First operand 950 states and 1410 transitions. Second operand 3 states. [2019-11-20 07:01:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:49,878 INFO L93 Difference]: Finished difference Result 1885 states and 2798 transitions. [2019-11-20 07:01:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:49,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:49,884 INFO L225 Difference]: With dead ends: 1885 [2019-11-20 07:01:49,884 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:49,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1402 transitions. [2019-11-20 07:01:49,928 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1402 transitions. Word has length 83 [2019-11-20 07:01:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:49,928 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1402 transitions. [2019-11-20 07:01:49,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1402 transitions. [2019-11-20 07:01:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:49,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:49,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:49,930 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash -451528672, now seen corresponding path program 1 times [2019-11-20 07:01:49,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:49,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318213841] [2019-11-20 07:01:49,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:49,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318213841] [2019-11-20 07:01:49,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:49,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:49,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837963632] [2019-11-20 07:01:49,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:49,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,004 INFO L87 Difference]: Start difference. First operand 950 states and 1402 transitions. Second operand 3 states. [2019-11-20 07:01:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,082 INFO L93 Difference]: Finished difference Result 1884 states and 2781 transitions. [2019-11-20 07:01:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,087 INFO L225 Difference]: With dead ends: 1884 [2019-11-20 07:01:50,088 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1380 transitions. [2019-11-20 07:01:50,130 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1380 transitions. Word has length 83 [2019-11-20 07:01:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,130 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1380 transitions. [2019-11-20 07:01:50,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1380 transitions. [2019-11-20 07:01:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,132 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash 713295197, now seen corresponding path program 1 times [2019-11-20 07:01:50,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608021460] [2019-11-20 07:01:50,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:50,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608021460] [2019-11-20 07:01:50,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:50,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:50,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779510425] [2019-11-20 07:01:50,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:50,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,164 INFO L87 Difference]: Start difference. First operand 950 states and 1380 transitions. Second operand 3 states. [2019-11-20 07:01:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,244 INFO L93 Difference]: Finished difference Result 1883 states and 2736 transitions. [2019-11-20 07:01:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,250 INFO L225 Difference]: With dead ends: 1883 [2019-11-20 07:01:50,250 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1358 transitions. [2019-11-20 07:01:50,298 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1358 transitions. Word has length 83 [2019-11-20 07:01:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,298 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1358 transitions. [2019-11-20 07:01:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1358 transitions. [2019-11-20 07:01:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,300 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2103165025, now seen corresponding path program 1 times [2019-11-20 07:01:50,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705697797] [2019-11-20 07:01:50,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:50,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705697797] [2019-11-20 07:01:50,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:50,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:50,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591061602] [2019-11-20 07:01:50,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:50,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,327 INFO L87 Difference]: Start difference. First operand 950 states and 1358 transitions. Second operand 3 states. [2019-11-20 07:01:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,401 INFO L93 Difference]: Finished difference Result 1882 states and 2691 transitions. [2019-11-20 07:01:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,407 INFO L225 Difference]: With dead ends: 1882 [2019-11-20 07:01:50,407 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1336 transitions. [2019-11-20 07:01:50,473 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1336 transitions. Word has length 83 [2019-11-20 07:01:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,473 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1336 transitions. [2019-11-20 07:01:50,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1336 transitions. [2019-11-20 07:01:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash 845256222, now seen corresponding path program 1 times [2019-11-20 07:01:50,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678267863] [2019-11-20 07:01:50,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:50,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678267863] [2019-11-20 07:01:50,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:50,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:50,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332442512] [2019-11-20 07:01:50,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:50,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,511 INFO L87 Difference]: Start difference. First operand 950 states and 1336 transitions. Second operand 3 states. [2019-11-20 07:01:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,587 INFO L93 Difference]: Finished difference Result 1881 states and 2646 transitions. [2019-11-20 07:01:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,593 INFO L225 Difference]: With dead ends: 1881 [2019-11-20 07:01:50,593 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1314 transitions. [2019-11-20 07:01:50,638 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1314 transitions. Word has length 83 [2019-11-20 07:01:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,638 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1314 transitions. [2019-11-20 07:01:50,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1314 transitions. [2019-11-20 07:01:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,639 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1865695778, now seen corresponding path program 1 times [2019-11-20 07:01:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158437738] [2019-11-20 07:01:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:50,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158437738] [2019-11-20 07:01:50,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:50,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:50,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001842476] [2019-11-20 07:01:50,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:50,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,667 INFO L87 Difference]: Start difference. First operand 950 states and 1314 transitions. Second operand 3 states. [2019-11-20 07:01:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,738 INFO L93 Difference]: Finished difference Result 1880 states and 2601 transitions. [2019-11-20 07:01:50,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,744 INFO L225 Difference]: With dead ends: 1880 [2019-11-20 07:01:50,744 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1292 transitions. [2019-11-20 07:01:50,788 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1292 transitions. Word has length 83 [2019-11-20 07:01:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,788 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1292 transitions. [2019-11-20 07:01:50,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1292 transitions. [2019-11-20 07:01:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,789 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1915494495, now seen corresponding path program 1 times [2019-11-20 07:01:50,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758035460] [2019-11-20 07:01:50,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758035460] [2019-11-20 07:01:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:50,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341241051] [2019-11-20 07:01:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,846 INFO L87 Difference]: Start difference. First operand 950 states and 1292 transitions. Second operand 3 states. [2019-11-20 07:01:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:50,896 INFO L93 Difference]: Finished difference Result 1887 states and 2565 transitions. [2019-11-20 07:01:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:50,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:50,902 INFO L225 Difference]: With dead ends: 1887 [2019-11-20 07:01:50,902 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:50,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1284 transitions. [2019-11-20 07:01:50,946 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1284 transitions. Word has length 83 [2019-11-20 07:01:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:50,947 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1284 transitions. [2019-11-20 07:01:50,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1284 transitions. [2019-11-20 07:01:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:50,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:50,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:50,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash 110056161, now seen corresponding path program 1 times [2019-11-20 07:01:50,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:50,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169129564] [2019-11-20 07:01:50,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:51,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169129564] [2019-11-20 07:01:51,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:51,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:51,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141817522] [2019-11-20 07:01:51,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:51,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:51,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:51,005 INFO L87 Difference]: Start difference. First operand 950 states and 1284 transitions. Second operand 3 states. [2019-11-20 07:01:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:51,077 INFO L93 Difference]: Finished difference Result 1879 states and 2541 transitions. [2019-11-20 07:01:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:51,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:51,083 INFO L225 Difference]: With dead ends: 1879 [2019-11-20 07:01:51,083 INFO L226 Difference]: Without dead ends: 950 [2019-11-20 07:01:51,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-20 07:01:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-11-20 07:01:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-20 07:01:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1262 transitions. [2019-11-20 07:01:51,131 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1262 transitions. Word has length 83 [2019-11-20 07:01:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:51,132 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1262 transitions. [2019-11-20 07:01:51,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1262 transitions. [2019-11-20 07:01:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:01:51,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:51,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:51,134 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1169807517, now seen corresponding path program 1 times [2019-11-20 07:01:51,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:51,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75723975] [2019-11-20 07:01:51,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75723975] [2019-11-20 07:01:51,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:51,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:01:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526363779] [2019-11-20 07:01:51,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:51,177 INFO L87 Difference]: Start difference. First operand 950 states and 1262 transitions. Second operand 3 states. [2019-11-20 07:01:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:51,295 INFO L93 Difference]: Finished difference Result 2718 states and 3617 transitions. [2019-11-20 07:01:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:51,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:01:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:51,305 INFO L225 Difference]: With dead ends: 2718 [2019-11-20 07:01:51,305 INFO L226 Difference]: Without dead ends: 1791 [2019-11-20 07:01:51,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-11-20 07:01:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1711. [2019-11-20 07:01:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-11-20 07:01:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2262 transitions. [2019-11-20 07:01:51,423 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2262 transitions. Word has length 83 [2019-11-20 07:01:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:51,423 INFO L462 AbstractCegarLoop]: Abstraction has 1711 states and 2262 transitions. [2019-11-20 07:01:51,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2262 transitions. [2019-11-20 07:01:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:51,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:51,425 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:51,426 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 797868130, now seen corresponding path program 1 times [2019-11-20 07:01:51,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:51,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081011948] [2019-11-20 07:01:51,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:51,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081011948] [2019-11-20 07:01:51,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:51,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:01:51,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744230257] [2019-11-20 07:01:51,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:01:51,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:01:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:01:51,505 INFO L87 Difference]: Start difference. First operand 1711 states and 2262 transitions. Second operand 5 states. [2019-11-20 07:01:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:51,782 INFO L93 Difference]: Finished difference Result 3853 states and 5137 transitions. [2019-11-20 07:01:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:01:51,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-20 07:01:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:51,794 INFO L225 Difference]: With dead ends: 3853 [2019-11-20 07:01:51,794 INFO L226 Difference]: Without dead ends: 2169 [2019-11-20 07:01:51,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:01:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-11-20 07:01:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 1717. [2019-11-20 07:01:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-11-20 07:01:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2241 transitions. [2019-11-20 07:01:51,911 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2241 transitions. Word has length 135 [2019-11-20 07:01:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:51,911 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 2241 transitions. [2019-11-20 07:01:51,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:01:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2241 transitions. [2019-11-20 07:01:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:51,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:51,914 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:51,914 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash -256235162, now seen corresponding path program 1 times [2019-11-20 07:01:51,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:51,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41011726] [2019-11-20 07:01:51,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:51,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41011726] [2019-11-20 07:01:51,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:51,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:01:51,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480539628] [2019-11-20 07:01:51,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:01:51,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:01:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:01:51,988 INFO L87 Difference]: Start difference. First operand 1717 states and 2241 transitions. Second operand 5 states. [2019-11-20 07:01:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:52,271 INFO L93 Difference]: Finished difference Result 3936 states and 5175 transitions. [2019-11-20 07:01:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:01:52,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-20 07:01:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:52,285 INFO L225 Difference]: With dead ends: 3936 [2019-11-20 07:01:52,285 INFO L226 Difference]: Without dead ends: 2253 [2019-11-20 07:01:52,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:01:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-11-20 07:01:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1723. [2019-11-20 07:01:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-20 07:01:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2220 transitions. [2019-11-20 07:01:52,396 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2220 transitions. Word has length 135 [2019-11-20 07:01:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:52,396 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2220 transitions. [2019-11-20 07:01:52,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:01:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2220 transitions. [2019-11-20 07:01:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:52,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:52,399 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:52,400 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1153628440, now seen corresponding path program 1 times [2019-11-20 07:01:52,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:52,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868518245] [2019-11-20 07:01:52,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:52,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868518245] [2019-11-20 07:01:52,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:52,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:01:52,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620129214] [2019-11-20 07:01:52,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:01:52,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:01:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:01:52,469 INFO L87 Difference]: Start difference. First operand 1723 states and 2220 transitions. Second operand 5 states. [2019-11-20 07:01:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:52,789 INFO L93 Difference]: Finished difference Result 4523 states and 5873 transitions. [2019-11-20 07:01:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:01:52,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-20 07:01:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:52,806 INFO L225 Difference]: With dead ends: 4523 [2019-11-20 07:01:52,807 INFO L226 Difference]: Without dead ends: 2841 [2019-11-20 07:01:52,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:01:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-11-20 07:01:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1735. [2019-11-20 07:01:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-11-20 07:01:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2207 transitions. [2019-11-20 07:01:52,933 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2207 transitions. Word has length 135 [2019-11-20 07:01:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:52,933 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2207 transitions. [2019-11-20 07:01:52,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:01:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2207 transitions. [2019-11-20 07:01:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:52,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:52,936 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:52,936 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1106974188, now seen corresponding path program 1 times [2019-11-20 07:01:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986404511] [2019-11-20 07:01:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:53,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986404511] [2019-11-20 07:01:53,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:53,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:01:53,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890807313] [2019-11-20 07:01:53,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:01:53,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:01:53,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:01:53,015 INFO L87 Difference]: Start difference. First operand 1735 states and 2207 transitions. Second operand 5 states. [2019-11-20 07:01:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:53,334 INFO L93 Difference]: Finished difference Result 4678 states and 5995 transitions. [2019-11-20 07:01:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:01:53,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-20 07:01:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:53,348 INFO L225 Difference]: With dead ends: 4678 [2019-11-20 07:01:53,349 INFO L226 Difference]: Without dead ends: 2991 [2019-11-20 07:01:53,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:01:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2019-11-20 07:01:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1747. [2019-11-20 07:01:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-11-20 07:01:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2194 transitions. [2019-11-20 07:01:53,477 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2194 transitions. Word has length 135 [2019-11-20 07:01:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:53,478 INFO L462 AbstractCegarLoop]: Abstraction has 1747 states and 2194 transitions. [2019-11-20 07:01:53,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:01:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2194 transitions. [2019-11-20 07:01:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:53,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:53,480 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:53,481 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -132007952, now seen corresponding path program 1 times [2019-11-20 07:01:53,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:53,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389937767] [2019-11-20 07:01:53,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:53,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389937767] [2019-11-20 07:01:53,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:53,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:01:53,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413275098] [2019-11-20 07:01:53,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:01:53,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:01:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:01:53,560 INFO L87 Difference]: Start difference. First operand 1747 states and 2194 transitions. Second operand 5 states. [2019-11-20 07:01:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:53,937 INFO L93 Difference]: Finished difference Result 4952 states and 6274 transitions. [2019-11-20 07:01:53,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:01:53,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-20 07:01:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:53,962 INFO L225 Difference]: With dead ends: 4952 [2019-11-20 07:01:53,968 INFO L226 Difference]: Without dead ends: 3267 [2019-11-20 07:01:53,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:01:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2019-11-20 07:01:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 1759. [2019-11-20 07:01:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2019-11-20 07:01:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2181 transitions. [2019-11-20 07:01:54,086 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2181 transitions. Word has length 135 [2019-11-20 07:01:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:54,087 INFO L462 AbstractCegarLoop]: Abstraction has 1759 states and 2181 transitions. [2019-11-20 07:01:54,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:01:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2181 transitions. [2019-11-20 07:01:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 07:01:54,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:54,089 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:54,090 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1580711948, now seen corresponding path program 1 times [2019-11-20 07:01:54,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:54,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335559360] [2019-11-20 07:01:54,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:54,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335559360] [2019-11-20 07:01:54,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:54,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:54,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94773810] [2019-11-20 07:01:54,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:54,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:54,157 INFO L87 Difference]: Start difference. First operand 1759 states and 2181 transitions. Second operand 3 states. [2019-11-20 07:01:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:54,359 INFO L93 Difference]: Finished difference Result 4879 states and 6029 transitions. [2019-11-20 07:01:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:54,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-20 07:01:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:54,366 INFO L225 Difference]: With dead ends: 4879 [2019-11-20 07:01:54,366 INFO L226 Difference]: Without dead ends: 3194 [2019-11-20 07:01:54,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2019-11-20 07:01:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3190. [2019-11-20 07:01:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-11-20 07:01:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 3915 transitions. [2019-11-20 07:01:54,568 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 3915 transitions. Word has length 135 [2019-11-20 07:01:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:54,568 INFO L462 AbstractCegarLoop]: Abstraction has 3190 states and 3915 transitions. [2019-11-20 07:01:54,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 3915 transitions. [2019-11-20 07:01:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 07:01:54,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:54,572 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:54,572 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1007923084, now seen corresponding path program 1 times [2019-11-20 07:01:54,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:54,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821726837] [2019-11-20 07:01:54,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:54,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821726837] [2019-11-20 07:01:54,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:54,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:54,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769448784] [2019-11-20 07:01:54,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:54,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:54,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:54,650 INFO L87 Difference]: Start difference. First operand 3190 states and 3915 transitions. Second operand 3 states. [2019-11-20 07:01:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:55,052 INFO L93 Difference]: Finished difference Result 9050 states and 11084 transitions. [2019-11-20 07:01:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:55,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-20 07:01:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:55,064 INFO L225 Difference]: With dead ends: 9050 [2019-11-20 07:01:55,064 INFO L226 Difference]: Without dead ends: 5934 [2019-11-20 07:01:55,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2019-11-20 07:01:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5930. [2019-11-20 07:01:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-11-20 07:01:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 7232 transitions. [2019-11-20 07:01:55,348 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 7232 transitions. Word has length 136 [2019-11-20 07:01:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:55,349 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 7232 transitions. [2019-11-20 07:01:55,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 7232 transitions. [2019-11-20 07:01:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 07:01:55,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:55,354 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:55,354 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 463050510, now seen corresponding path program 1 times [2019-11-20 07:01:55,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:55,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483247504] [2019-11-20 07:01:55,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 07:01:55,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483247504] [2019-11-20 07:01:55,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:55,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:55,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505678950] [2019-11-20 07:01:55,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:55,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:55,385 INFO L87 Difference]: Start difference. First operand 5930 states and 7232 transitions. Second operand 3 states. [2019-11-20 07:01:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:55,808 INFO L93 Difference]: Finished difference Result 11718 states and 14302 transitions. [2019-11-20 07:01:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:55,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-20 07:01:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:55,821 INFO L225 Difference]: With dead ends: 11718 [2019-11-20 07:01:55,822 INFO L226 Difference]: Without dead ends: 5862 [2019-11-20 07:01:55,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2019-11-20 07:01:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5862. [2019-11-20 07:01:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-11-20 07:01:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 7154 transitions. [2019-11-20 07:01:56,164 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 7154 transitions. Word has length 136 [2019-11-20 07:01:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:56,165 INFO L462 AbstractCegarLoop]: Abstraction has 5862 states and 7154 transitions. [2019-11-20 07:01:56,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 7154 transitions. [2019-11-20 07:01:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 07:01:56,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:56,174 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:56,175 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash -622903665, now seen corresponding path program 1 times [2019-11-20 07:01:56,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:56,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162727502] [2019-11-20 07:01:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:56,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162727502] [2019-11-20 07:01:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:56,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561407561] [2019-11-20 07:01:56,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:56,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:56,239 INFO L87 Difference]: Start difference. First operand 5862 states and 7154 transitions. Second operand 3 states. [2019-11-20 07:01:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:56,969 INFO L93 Difference]: Finished difference Result 16721 states and 20393 transitions. [2019-11-20 07:01:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:56,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-20 07:01:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:56,986 INFO L225 Difference]: With dead ends: 16721 [2019-11-20 07:01:56,986 INFO L226 Difference]: Without dead ends: 10933 [2019-11-20 07:01:56,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2019-11-20 07:01:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10929. [2019-11-20 07:01:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10929 states. [2019-11-20 07:01:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10929 states to 10929 states and 13293 transitions. [2019-11-20 07:01:57,506 INFO L78 Accepts]: Start accepts. Automaton has 10929 states and 13293 transitions. Word has length 137 [2019-11-20 07:01:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:57,506 INFO L462 AbstractCegarLoop]: Abstraction has 10929 states and 13293 transitions. [2019-11-20 07:01:57,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10929 states and 13293 transitions. [2019-11-20 07:01:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 07:01:57,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:57,514 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:57,515 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1167776239, now seen corresponding path program 1 times [2019-11-20 07:01:57,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:57,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425568437] [2019-11-20 07:01:57,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 07:01:57,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425568437] [2019-11-20 07:01:57,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:57,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:57,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102469871] [2019-11-20 07:01:57,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:57,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:57,547 INFO L87 Difference]: Start difference. First operand 10929 states and 13293 transitions. Second operand 3 states. [2019-11-20 07:01:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:01:58,449 INFO L93 Difference]: Finished difference Result 21717 states and 26427 transitions. [2019-11-20 07:01:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:01:58,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-20 07:01:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:01:58,466 INFO L225 Difference]: With dead ends: 21717 [2019-11-20 07:01:58,467 INFO L226 Difference]: Without dead ends: 10862 [2019-11-20 07:01:58,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10862 states. [2019-11-20 07:01:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10862 to 10862. [2019-11-20 07:01:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10862 states. [2019-11-20 07:01:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 13217 transitions. [2019-11-20 07:01:59,037 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 13217 transitions. Word has length 137 [2019-11-20 07:01:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:01:59,037 INFO L462 AbstractCegarLoop]: Abstraction has 10862 states and 13217 transitions. [2019-11-20 07:01:59,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:01:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 13217 transitions. [2019-11-20 07:01:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 07:01:59,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:01:59,042 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:01:59,042 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:01:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:01:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1460610289, now seen corresponding path program 1 times [2019-11-20 07:01:59,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:01:59,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813277249] [2019-11-20 07:01:59,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:01:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:01:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:01:59,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813277249] [2019-11-20 07:01:59,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:01:59,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:01:59,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133807715] [2019-11-20 07:01:59,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:01:59,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:01:59,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:01:59,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:01:59,091 INFO L87 Difference]: Start difference. First operand 10862 states and 13217 transitions. Second operand 3 states. [2019-11-20 07:02:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:00,146 INFO L93 Difference]: Finished difference Result 31292 states and 38062 transitions. [2019-11-20 07:02:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:00,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-20 07:02:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:00,183 INFO L225 Difference]: With dead ends: 31292 [2019-11-20 07:02:00,184 INFO L226 Difference]: Without dead ends: 20504 [2019-11-20 07:02:00,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2019-11-20 07:02:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 20084. [2019-11-20 07:02:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20084 states. [2019-11-20 07:02:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 24370 transitions. [2019-11-20 07:02:01,420 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 24370 transitions. Word has length 138 [2019-11-20 07:02:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:01,420 INFO L462 AbstractCegarLoop]: Abstraction has 20084 states and 24370 transitions. [2019-11-20 07:02:01,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 24370 transitions. [2019-11-20 07:02:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 07:02:01,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:01,431 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:01,431 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -78955983, now seen corresponding path program 1 times [2019-11-20 07:02:01,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:01,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019471242] [2019-11-20 07:02:01,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 07:02:01,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019471242] [2019-11-20 07:02:01,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:01,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:01,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679878145] [2019-11-20 07:02:01,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:01,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:01,462 INFO L87 Difference]: Start difference. First operand 20084 states and 24370 transitions. Second operand 3 states. [2019-11-20 07:02:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:02,369 INFO L93 Difference]: Finished difference Result 40047 states and 48604 transitions. [2019-11-20 07:02:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:02,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-20 07:02:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:02,400 INFO L225 Difference]: With dead ends: 40047 [2019-11-20 07:02:02,401 INFO L226 Difference]: Without dead ends: 20018 [2019-11-20 07:02:02,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20018 states. [2019-11-20 07:02:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20018 to 20018. [2019-11-20 07:02:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20018 states. [2019-11-20 07:02:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20018 states to 20018 states and 24296 transitions. [2019-11-20 07:02:03,460 INFO L78 Accepts]: Start accepts. Automaton has 20018 states and 24296 transitions. Word has length 138 [2019-11-20 07:02:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:03,460 INFO L462 AbstractCegarLoop]: Abstraction has 20018 states and 24296 transitions. [2019-11-20 07:02:03,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20018 states and 24296 transitions. [2019-11-20 07:02:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 07:02:03,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:03,468 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:03,468 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:03,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1660502314, now seen corresponding path program 1 times [2019-11-20 07:02:03,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:03,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150470450] [2019-11-20 07:02:03,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:03,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150470450] [2019-11-20 07:02:03,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:03,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:03,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699078993] [2019-11-20 07:02:03,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:03,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:03,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:03,525 INFO L87 Difference]: Start difference. First operand 20018 states and 24296 transitions. Second operand 3 states. [2019-11-20 07:02:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:05,359 INFO L93 Difference]: Finished difference Result 56835 states and 68987 transitions. [2019-11-20 07:02:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:05,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-20 07:02:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:05,393 INFO L225 Difference]: With dead ends: 56835 [2019-11-20 07:02:05,393 INFO L226 Difference]: Without dead ends: 36891 [2019-11-20 07:02:05,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36891 states. [2019-11-20 07:02:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36891 to 36887. [2019-11-20 07:02:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36887 states. [2019-11-20 07:02:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36887 states to 36887 states and 44695 transitions. [2019-11-20 07:02:07,232 INFO L78 Accepts]: Start accepts. Automaton has 36887 states and 44695 transitions. Word has length 139 [2019-11-20 07:02:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:07,232 INFO L462 AbstractCegarLoop]: Abstraction has 36887 states and 44695 transitions. [2019-11-20 07:02:07,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 36887 states and 44695 transitions. [2019-11-20 07:02:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 07:02:07,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:07,244 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:07,244 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1115629740, now seen corresponding path program 1 times [2019-11-20 07:02:07,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:07,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176265322] [2019-11-20 07:02:07,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 07:02:07,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176265322] [2019-11-20 07:02:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:07,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314641988] [2019-11-20 07:02:07,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:07,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:07,276 INFO L87 Difference]: Start difference. First operand 36887 states and 44695 transitions. Second operand 3 states. [2019-11-20 07:02:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:08,865 INFO L93 Difference]: Finished difference Result 73635 states and 89237 transitions. [2019-11-20 07:02:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:08,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-20 07:02:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:08,902 INFO L225 Difference]: With dead ends: 73635 [2019-11-20 07:02:08,902 INFO L226 Difference]: Without dead ends: 36822 [2019-11-20 07:02:08,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36822 states. [2019-11-20 07:02:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36822 to 36822. [2019-11-20 07:02:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36822 states. [2019-11-20 07:02:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36822 states to 36822 states and 44623 transitions. [2019-11-20 07:02:11,005 INFO L78 Accepts]: Start accepts. Automaton has 36822 states and 44623 transitions. Word has length 139 [2019-11-20 07:02:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:11,005 INFO L462 AbstractCegarLoop]: Abstraction has 36822 states and 44623 transitions. [2019-11-20 07:02:11,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 36822 states and 44623 transitions. [2019-11-20 07:02:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 07:02:11,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:11,017 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:11,017 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1562919338, now seen corresponding path program 1 times [2019-11-20 07:02:11,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:11,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024160420] [2019-11-20 07:02:11,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:11,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024160420] [2019-11-20 07:02:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:11,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032499137] [2019-11-20 07:02:11,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:11,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:11,065 INFO L87 Difference]: Start difference. First operand 36822 states and 44623 transitions. Second operand 3 states. [2019-11-20 07:02:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:14,381 INFO L93 Difference]: Finished difference Result 106480 states and 128661 transitions. [2019-11-20 07:02:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:14,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-20 07:02:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:14,425 INFO L225 Difference]: With dead ends: 106480 [2019-11-20 07:02:14,425 INFO L226 Difference]: Without dead ends: 53418 [2019-11-20 07:02:14,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53418 states. [2019-11-20 07:02:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53418 to 53418. [2019-11-20 07:02:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53418 states. [2019-11-20 07:02:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53418 states to 53418 states and 64412 transitions. [2019-11-20 07:02:17,203 INFO L78 Accepts]: Start accepts. Automaton has 53418 states and 64412 transitions. Word has length 140 [2019-11-20 07:02:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:17,204 INFO L462 AbstractCegarLoop]: Abstraction has 53418 states and 64412 transitions. [2019-11-20 07:02:17,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 53418 states and 64412 transitions. [2019-11-20 07:02:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 07:02:17,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:17,229 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:17,229 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1472853732, now seen corresponding path program 1 times [2019-11-20 07:02:17,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:17,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995812325] [2019-11-20 07:02:17,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:17,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995812325] [2019-11-20 07:02:17,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:17,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:02:17,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717231486] [2019-11-20 07:02:17,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:17,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:17,297 INFO L87 Difference]: Start difference. First operand 53418 states and 64412 transitions. Second operand 3 states. [2019-11-20 07:02:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:20,559 INFO L93 Difference]: Finished difference Result 123134 states and 148256 transitions. [2019-11-20 07:02:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:20,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-20 07:02:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:20,618 INFO L225 Difference]: With dead ends: 123134 [2019-11-20 07:02:20,619 INFO L226 Difference]: Without dead ends: 69773 [2019-11-20 07:02:20,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69773 states. [2019-11-20 07:02:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69773 to 69581. [2019-11-20 07:02:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69581 states. [2019-11-20 07:02:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69581 states to 69581 states and 83394 transitions. [2019-11-20 07:02:23,808 INFO L78 Accepts]: Start accepts. Automaton has 69581 states and 83394 transitions. Word has length 181 [2019-11-20 07:02:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:23,809 INFO L462 AbstractCegarLoop]: Abstraction has 69581 states and 83394 transitions. [2019-11-20 07:02:23,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 69581 states and 83394 transitions. [2019-11-20 07:02:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 07:02:23,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:23,836 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:23,836 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 614314275, now seen corresponding path program 1 times [2019-11-20 07:02:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:23,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718295458] [2019-11-20 07:02:23,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 07:02:24,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718295458] [2019-11-20 07:02:24,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:24,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:24,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363392049] [2019-11-20 07:02:24,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:24,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:24,171 INFO L87 Difference]: Start difference. First operand 69581 states and 83394 transitions. Second operand 3 states. [2019-11-20 07:02:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:27,192 INFO L93 Difference]: Finished difference Result 138159 states and 165318 transitions. [2019-11-20 07:02:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:27,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-20 07:02:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:27,261 INFO L225 Difference]: With dead ends: 138159 [2019-11-20 07:02:27,261 INFO L226 Difference]: Without dead ends: 68651 [2019-11-20 07:02:27,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68651 states. [2019-11-20 07:02:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68651 to 68651. [2019-11-20 07:02:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68651 states. [2019-11-20 07:02:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68651 states to 68651 states and 81362 transitions. [2019-11-20 07:02:33,292 INFO L78 Accepts]: Start accepts. Automaton has 68651 states and 81362 transitions. Word has length 201 [2019-11-20 07:02:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:33,292 INFO L462 AbstractCegarLoop]: Abstraction has 68651 states and 81362 transitions. [2019-11-20 07:02:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68651 states and 81362 transitions. [2019-11-20 07:02:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 07:02:33,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:33,315 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:33,315 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1781198288, now seen corresponding path program 1 times [2019-11-20 07:02:33,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:33,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160221499] [2019-11-20 07:02:33,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:33,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160221499] [2019-11-20 07:02:33,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:33,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:33,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690739666] [2019-11-20 07:02:33,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:33,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:33,405 INFO L87 Difference]: Start difference. First operand 68651 states and 81362 transitions. Second operand 3 states. [2019-11-20 07:02:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:36,735 INFO L93 Difference]: Finished difference Result 121255 states and 144068 transitions. [2019-11-20 07:02:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:36,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-11-20 07:02:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:36,827 INFO L225 Difference]: With dead ends: 121255 [2019-11-20 07:02:36,827 INFO L226 Difference]: Without dead ends: 68655 [2019-11-20 07:02:36,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68655 states. [2019-11-20 07:02:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68655 to 68651. [2019-11-20 07:02:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68651 states. [2019-11-20 07:02:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68651 states to 68651 states and 81260 transitions. [2019-11-20 07:02:40,335 INFO L78 Accepts]: Start accepts. Automaton has 68651 states and 81260 transitions. Word has length 202 [2019-11-20 07:02:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:40,335 INFO L462 AbstractCegarLoop]: Abstraction has 68651 states and 81260 transitions. [2019-11-20 07:02:40,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 68651 states and 81260 transitions. [2019-11-20 07:02:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-20 07:02:40,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:40,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:40,369 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1995337667, now seen corresponding path program 1 times [2019-11-20 07:02:40,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:40,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69829468] [2019-11-20 07:02:40,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 07:02:40,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69829468] [2019-11-20 07:02:40,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:40,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:02:40,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006413047] [2019-11-20 07:02:40,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:40,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:40,462 INFO L87 Difference]: Start difference. First operand 68651 states and 81260 transitions. Second operand 3 states. [2019-11-20 07:02:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:44,411 INFO L93 Difference]: Finished difference Result 152007 states and 179689 transitions. [2019-11-20 07:02:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:44,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-11-20 07:02:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:44,484 INFO L225 Difference]: With dead ends: 152007 [2019-11-20 07:02:44,484 INFO L226 Difference]: Without dead ends: 83406 [2019-11-20 07:02:44,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83406 states. [2019-11-20 07:02:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83406 to 83150. [2019-11-20 07:02:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2019-11-20 07:02:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 97938 transitions. [2019-11-20 07:02:48,613 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 97938 transitions. Word has length 243 [2019-11-20 07:02:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:48,614 INFO L462 AbstractCegarLoop]: Abstraction has 83150 states and 97938 transitions. [2019-11-20 07:02:48,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 97938 transitions. [2019-11-20 07:02:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-20 07:02:48,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:48,646 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:48,646 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -92954994, now seen corresponding path program 1 times [2019-11-20 07:02:48,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:48,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045320401] [2019-11-20 07:02:48,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:48,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045320401] [2019-11-20 07:02:48,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:48,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:48,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301754666] [2019-11-20 07:02:48,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:48,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:48,735 INFO L87 Difference]: Start difference. First operand 83150 states and 97938 transitions. Second operand 3 states. [2019-11-20 07:02:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:53,210 INFO L93 Difference]: Finished difference Result 151732 states and 179122 transitions. [2019-11-20 07:02:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:53,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-11-20 07:02:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:53,293 INFO L225 Difference]: With dead ends: 151732 [2019-11-20 07:02:53,293 INFO L226 Difference]: Without dead ends: 83154 [2019-11-20 07:02:53,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83154 states. [2019-11-20 07:02:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83154 to 83150. [2019-11-20 07:02:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2019-11-20 07:02:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 97792 transitions. [2019-11-20 07:02:58,139 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 97792 transitions. Word has length 246 [2019-11-20 07:02:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:58,140 INFO L462 AbstractCegarLoop]: Abstraction has 83150 states and 97792 transitions. [2019-11-20 07:02:58,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:02:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 97792 transitions. [2019-11-20 07:02:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-20 07:02:58,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:58,170 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:58,170 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -331946524, now seen corresponding path program 1 times [2019-11-20 07:02:58,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694568302] [2019-11-20 07:02:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:58,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694568302] [2019-11-20 07:02:58,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:58,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:02:58,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770129691] [2019-11-20 07:02:58,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:02:58,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:02:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:02:58,272 INFO L87 Difference]: Start difference. First operand 83150 states and 97792 transitions. Second operand 3 states. [2019-11-20 07:03:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:03:03,037 INFO L93 Difference]: Finished difference Result 151856 states and 178956 transitions. [2019-11-20 07:03:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:03:03,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-11-20 07:03:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:03:03,118 INFO L225 Difference]: With dead ends: 151856 [2019-11-20 07:03:03,118 INFO L226 Difference]: Without dead ends: 83278 [2019-11-20 07:03:03,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83278 states. [2019-11-20 07:03:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83278 to 83150. [2019-11-20 07:03:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2019-11-20 07:03:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 96448 transitions. [2019-11-20 07:03:10,136 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 96448 transitions. Word has length 246 [2019-11-20 07:03:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:03:10,136 INFO L462 AbstractCegarLoop]: Abstraction has 83150 states and 96448 transitions. [2019-11-20 07:03:10,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:03:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 96448 transitions. [2019-11-20 07:03:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-20 07:03:10,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:03:10,164 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:03:10,164 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:03:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:03:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1718247822, now seen corresponding path program 1 times [2019-11-20 07:03:10,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:03:10,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276331945] [2019-11-20 07:03:10,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:03:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:03:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 07:03:10,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276331945] [2019-11-20 07:03:10,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:03:10,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:03:10,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280699572] [2019-11-20 07:03:10,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:03:10,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:03:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:03:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:03:10,253 INFO L87 Difference]: Start difference. First operand 83150 states and 96448 transitions. Second operand 5 states. [2019-11-20 07:03:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:03:17,760 INFO L93 Difference]: Finished difference Result 213778 states and 249756 transitions. [2019-11-20 07:03:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:03:17,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-11-20 07:03:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:03:17,888 INFO L225 Difference]: With dead ends: 213778 [2019-11-20 07:03:17,888 INFO L226 Difference]: Without dead ends: 130682 [2019-11-20 07:03:17,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:03:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130682 states. [2019-11-20 07:03:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130682 to 83534. [2019-11-20 07:03:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83534 states. [2019-11-20 07:03:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83534 states to 83534 states and 95647 transitions. [2019-11-20 07:03:23,224 INFO L78 Accepts]: Start accepts. Automaton has 83534 states and 95647 transitions. Word has length 249 [2019-11-20 07:03:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:03:23,224 INFO L462 AbstractCegarLoop]: Abstraction has 83534 states and 95647 transitions. [2019-11-20 07:03:23,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:03:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 83534 states and 95647 transitions. [2019-11-20 07:03:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-20 07:03:23,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:03:23,257 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:03:23,257 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:03:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:03:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash -582486225, now seen corresponding path program 1 times [2019-11-20 07:03:23,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:03:23,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029569443] [2019-11-20 07:03:23,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:03:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:03:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 07:03:23,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029569443] [2019-11-20 07:03:23,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:03:23,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:03:23,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993468370] [2019-11-20 07:03:23,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:03:23,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:03:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:03:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:23,388 INFO L87 Difference]: Start difference. First operand 83534 states and 95647 transitions. Second operand 3 states. [2019-11-20 07:03:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:03:29,795 INFO L93 Difference]: Finished difference Result 180296 states and 206239 transitions. [2019-11-20 07:03:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:03:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-20 07:03:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:03:29,882 INFO L225 Difference]: With dead ends: 180296 [2019-11-20 07:03:29,882 INFO L226 Difference]: Without dead ends: 96805 [2019-11-20 07:03:29,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96805 states. [2019-11-20 07:03:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96805 to 96485. [2019-11-20 07:03:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96485 states. [2019-11-20 07:03:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96485 states to 96485 states and 110061 transitions. [2019-11-20 07:03:35,893 INFO L78 Accepts]: Start accepts. Automaton has 96485 states and 110061 transitions. Word has length 289 [2019-11-20 07:03:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:03:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 96485 states and 110061 transitions. [2019-11-20 07:03:35,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:03:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 96485 states and 110061 transitions. [2019-11-20 07:03:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-20 07:03:35,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:03:35,940 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:03:35,940 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:03:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:03:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash -423262633, now seen corresponding path program 1 times [2019-11-20 07:03:35,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:03:35,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30998454] [2019-11-20 07:03:35,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:03:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:03:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:03:36,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30998454] [2019-11-20 07:03:36,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:03:36,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:03:36,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612056164] [2019-11-20 07:03:36,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:03:36,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:03:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:03:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:36,041 INFO L87 Difference]: Start difference. First operand 96485 states and 110061 transitions. Second operand 3 states. [2019-11-20 07:03:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:03:41,399 INFO L93 Difference]: Finished difference Result 179951 states and 205635 transitions. [2019-11-20 07:03:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:03:41,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-20 07:03:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:03:41,479 INFO L225 Difference]: With dead ends: 179951 [2019-11-20 07:03:41,479 INFO L226 Difference]: Without dead ends: 96489 [2019-11-20 07:03:41,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96489 states. [2019-11-20 07:03:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96489 to 96485. [2019-11-20 07:03:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96485 states. [2019-11-20 07:03:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96485 states to 96485 states and 109853 transitions. [2019-11-20 07:03:47,000 INFO L78 Accepts]: Start accepts. Automaton has 96485 states and 109853 transitions. Word has length 292 [2019-11-20 07:03:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:03:47,000 INFO L462 AbstractCegarLoop]: Abstraction has 96485 states and 109853 transitions. [2019-11-20 07:03:47,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:03:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 96485 states and 109853 transitions. [2019-11-20 07:03:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-20 07:03:47,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:03:47,040 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:03:47,040 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:03:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:03:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1162176953, now seen corresponding path program 1 times [2019-11-20 07:03:47,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:03:47,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81528667] [2019-11-20 07:03:47,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:03:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:03:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:03:47,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81528667] [2019-11-20 07:03:47,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:03:47,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:03:47,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428003054] [2019-11-20 07:03:47,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:03:47,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:03:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:03:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:47,176 INFO L87 Difference]: Start difference. First operand 96485 states and 109853 transitions. Second operand 3 states. [2019-11-20 07:03:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:03:54,797 INFO L93 Difference]: Finished difference Result 204741 states and 232803 transitions. [2019-11-20 07:03:54,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:03:54,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-11-20 07:03:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:03:54,891 INFO L225 Difference]: With dead ends: 204741 [2019-11-20 07:03:54,891 INFO L226 Difference]: Without dead ends: 108292 [2019-11-20 07:03:54,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:03:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108292 states. [2019-11-20 07:04:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108292 to 107908. [2019-11-20 07:04:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107908 states. [2019-11-20 07:04:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107908 states to 107908 states and 122379 transitions. [2019-11-20 07:04:00,770 INFO L78 Accepts]: Start accepts. Automaton has 107908 states and 122379 transitions. Word has length 334 [2019-11-20 07:04:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:00,770 INFO L462 AbstractCegarLoop]: Abstraction has 107908 states and 122379 transitions. [2019-11-20 07:04:00,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 107908 states and 122379 transitions. [2019-11-20 07:04:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-20 07:04:00,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:00,816 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:00,816 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -978666524, now seen corresponding path program 1 times [2019-11-20 07:04:00,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:00,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478640434] [2019-11-20 07:04:00,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:04:00,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478640434] [2019-11-20 07:04:00,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:00,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:00,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718588291] [2019-11-20 07:04:00,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:00,952 INFO L87 Difference]: Start difference. First operand 107908 states and 122379 transitions. Second operand 3 states. [2019-11-20 07:04:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:06,634 INFO L93 Difference]: Finished difference Result 204326 states and 232161 transitions. [2019-11-20 07:04:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-20 07:04:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:06,727 INFO L225 Difference]: With dead ends: 204326 [2019-11-20 07:04:06,727 INFO L226 Difference]: Without dead ends: 107912 [2019-11-20 07:04:06,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107912 states. [2019-11-20 07:04:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107912 to 107908. [2019-11-20 07:04:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107908 states. [2019-11-20 07:04:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107908 states to 107908 states and 122067 transitions. [2019-11-20 07:04:12,739 INFO L78 Accepts]: Start accepts. Automaton has 107908 states and 122067 transitions. Word has length 337 [2019-11-20 07:04:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:12,739 INFO L462 AbstractCegarLoop]: Abstraction has 107908 states and 122067 transitions. [2019-11-20 07:04:12,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 107908 states and 122067 transitions. [2019-11-20 07:04:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-20 07:04:12,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:12,783 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:12,783 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 660132916, now seen corresponding path program 1 times [2019-11-20 07:04:12,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:12,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312982609] [2019-11-20 07:04:12,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 07:04:12,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312982609] [2019-11-20 07:04:12,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:12,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:04:12,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832682927] [2019-11-20 07:04:12,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:12,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:12,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:12,945 INFO L87 Difference]: Start difference. First operand 107908 states and 122067 transitions. Second operand 3 states. [2019-11-20 07:04:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:19,169 INFO L93 Difference]: Finished difference Result 226138 states and 255399 transitions. [2019-11-20 07:04:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:19,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2019-11-20 07:04:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:19,272 INFO L225 Difference]: With dead ends: 226138 [2019-11-20 07:04:19,272 INFO L226 Difference]: Without dead ends: 118259 [2019-11-20 07:04:19,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118259 states. [2019-11-20 07:04:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118259 to 117811. [2019-11-20 07:04:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117811 states. [2019-11-20 07:04:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117811 states to 117811 states and 132721 transitions. [2019-11-20 07:04:25,806 INFO L78 Accepts]: Start accepts. Automaton has 117811 states and 132721 transitions. Word has length 379 [2019-11-20 07:04:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:25,806 INFO L462 AbstractCegarLoop]: Abstraction has 117811 states and 132721 transitions. [2019-11-20 07:04:25,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 117811 states and 132721 transitions. [2019-11-20 07:04:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-20 07:04:25,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:25,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:25,873 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 176006994, now seen corresponding path program 1 times [2019-11-20 07:04:25,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:25,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44908773] [2019-11-20 07:04:25,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:04:25,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44908773] [2019-11-20 07:04:25,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:25,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:25,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066433721] [2019-11-20 07:04:25,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:25,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:25,997 INFO L87 Difference]: Start difference. First operand 117811 states and 132721 transitions. Second operand 3 states. [2019-11-20 07:04:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:27,864 INFO L93 Difference]: Finished difference Result 141218 states and 158629 transitions. [2019-11-20 07:04:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:27,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-11-20 07:04:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:27,882 INFO L225 Difference]: With dead ends: 141218 [2019-11-20 07:04:27,882 INFO L226 Difference]: Without dead ends: 20186 [2019-11-20 07:04:27,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2019-11-20 07:04:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2019-11-20 07:04:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21827 transitions. [2019-11-20 07:04:29,375 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21827 transitions. Word has length 382 [2019-11-20 07:04:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:29,375 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21827 transitions. [2019-11-20 07:04:29,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21827 transitions. [2019-11-20 07:04:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-11-20 07:04:29,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:29,388 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:29,388 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:29,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1861356732, now seen corresponding path program 1 times [2019-11-20 07:04:29,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:29,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903905484] [2019-11-20 07:04:29,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:04:29,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903905484] [2019-11-20 07:04:29,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:29,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:29,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154914362] [2019-11-20 07:04:29,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:29,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:29,514 INFO L87 Difference]: Start difference. First operand 20186 states and 21827 transitions. Second operand 3 states. [2019-11-20 07:04:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:30,625 INFO L93 Difference]: Finished difference Result 33147 states and 35901 transitions. [2019-11-20 07:04:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:30,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-11-20 07:04:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:30,640 INFO L225 Difference]: With dead ends: 33147 [2019-11-20 07:04:30,640 INFO L226 Difference]: Without dead ends: 20186 [2019-11-20 07:04:30,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2019-11-20 07:04:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2019-11-20 07:04:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21675 transitions. [2019-11-20 07:04:31,630 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21675 transitions. Word has length 383 [2019-11-20 07:04:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:31,631 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21675 transitions. [2019-11-20 07:04:31,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21675 transitions. [2019-11-20 07:04:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-11-20 07:04:31,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:31,646 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:31,646 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:31,647 INFO L82 PathProgramCache]: Analyzing trace with hash 914909407, now seen corresponding path program 1 times [2019-11-20 07:04:31,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:31,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348571558] [2019-11-20 07:04:31,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:04:31,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348571558] [2019-11-20 07:04:31,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:31,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:31,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843179932] [2019-11-20 07:04:31,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:31,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:31,758 INFO L87 Difference]: Start difference. First operand 20186 states and 21675 transitions. Second operand 3 states. [2019-11-20 07:04:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:33,643 INFO L93 Difference]: Finished difference Result 31679 states and 34063 transitions. [2019-11-20 07:04:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:33,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 388 [2019-11-20 07:04:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:33,658 INFO L225 Difference]: With dead ends: 31679 [2019-11-20 07:04:33,658 INFO L226 Difference]: Without dead ends: 20186 [2019-11-20 07:04:33,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2019-11-20 07:04:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2019-11-20 07:04:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21535 transitions. [2019-11-20 07:04:34,698 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21535 transitions. Word has length 388 [2019-11-20 07:04:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:34,699 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21535 transitions. [2019-11-20 07:04:34,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21535 transitions. [2019-11-20 07:04:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-20 07:04:34,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:34,711 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:34,711 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash -946028452, now seen corresponding path program 1 times [2019-11-20 07:04:34,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:34,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948719182] [2019-11-20 07:04:34,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:04:34,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948719182] [2019-11-20 07:04:34,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:34,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:34,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981176899] [2019-11-20 07:04:34,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:34,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:34,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:34,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:34,814 INFO L87 Difference]: Start difference. First operand 20186 states and 21535 transitions. Second operand 3 states. [2019-11-20 07:04:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:35,811 INFO L93 Difference]: Finished difference Result 30560 states and 32647 transitions. [2019-11-20 07:04:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:35,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-20 07:04:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:35,826 INFO L225 Difference]: With dead ends: 30560 [2019-11-20 07:04:35,826 INFO L226 Difference]: Without dead ends: 20186 [2019-11-20 07:04:35,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2019-11-20 07:04:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2019-11-20 07:04:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21404 transitions. [2019-11-20 07:04:36,983 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21404 transitions. Word has length 393 [2019-11-20 07:04:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:36,983 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21404 transitions. [2019-11-20 07:04:36,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21404 transitions. [2019-11-20 07:04:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-11-20 07:04:36,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:36,994 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:36,994 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1833719307, now seen corresponding path program 1 times [2019-11-20 07:04:36,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:36,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486930222] [2019-11-20 07:04:36,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 07:04:37,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486930222] [2019-11-20 07:04:37,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:37,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060328799] [2019-11-20 07:04:37,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:37,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:37,121 INFO L87 Difference]: Start difference. First operand 20186 states and 21404 transitions. Second operand 3 states. [2019-11-20 07:04:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:38,153 INFO L93 Difference]: Finished difference Result 30625 states and 32533 transitions. [2019-11-20 07:04:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:38,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-11-20 07:04:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:38,168 INFO L225 Difference]: With dead ends: 30625 [2019-11-20 07:04:38,168 INFO L226 Difference]: Without dead ends: 20264 [2019-11-20 07:04:38,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20264 states. [2019-11-20 07:04:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20264 to 20186. [2019-11-20 07:04:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21272 transitions. [2019-11-20 07:04:39,182 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21272 transitions. Word has length 398 [2019-11-20 07:04:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21272 transitions. [2019-11-20 07:04:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21272 transitions. [2019-11-20 07:04:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-20 07:04:39,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:39,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:39,194 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1021388863, now seen corresponding path program 1 times [2019-11-20 07:04:39,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948094826] [2019-11-20 07:04:39,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:04:39,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948094826] [2019-11-20 07:04:39,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:39,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:39,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094138908] [2019-11-20 07:04:39,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:39,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:39,328 INFO L87 Difference]: Start difference. First operand 20186 states and 21272 transitions. Second operand 3 states. [2019-11-20 07:04:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:40,516 INFO L93 Difference]: Finished difference Result 35999 states and 37931 transitions. [2019-11-20 07:04:40,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:40,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-20 07:04:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:40,532 INFO L225 Difference]: With dead ends: 35999 [2019-11-20 07:04:40,532 INFO L226 Difference]: Without dead ends: 20186 [2019-11-20 07:04:40,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2019-11-20 07:04:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2019-11-20 07:04:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21096 transitions. [2019-11-20 07:04:41,610 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21096 transitions. Word has length 402 [2019-11-20 07:04:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:41,610 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21096 transitions. [2019-11-20 07:04:41,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21096 transitions. [2019-11-20 07:04:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-11-20 07:04:41,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:41,623 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:41,623 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash -846459542, now seen corresponding path program 1 times [2019-11-20 07:04:41,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:41,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023069291] [2019-11-20 07:04:41,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 07:04:42,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023069291] [2019-11-20 07:04:42,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:42,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 07:04:42,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195356679] [2019-11-20 07:04:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:04:42,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:04:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:04:42,050 INFO L87 Difference]: Start difference. First operand 20186 states and 21096 transitions. Second operand 8 states. [2019-11-20 07:04:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:43,265 INFO L93 Difference]: Finished difference Result 20186 states and 21096 transitions. [2019-11-20 07:04:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:04:43,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 407 [2019-11-20 07:04:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:43,280 INFO L225 Difference]: With dead ends: 20186 [2019-11-20 07:04:43,280 INFO L226 Difference]: Without dead ends: 20184 [2019-11-20 07:04:43,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:04:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20184 states. [2019-11-20 07:04:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20184 to 20184. [2019-11-20 07:04:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20184 states. [2019-11-20 07:04:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20184 states to 20184 states and 21093 transitions. [2019-11-20 07:04:44,462 INFO L78 Accepts]: Start accepts. Automaton has 20184 states and 21093 transitions. Word has length 407 [2019-11-20 07:04:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 20184 states and 21093 transitions. [2019-11-20 07:04:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:04:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20184 states and 21093 transitions. [2019-11-20 07:04:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-20 07:04:44,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:44,476 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:44,476 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -256593416, now seen corresponding path program 1 times [2019-11-20 07:04:44,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:44,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105618371] [2019-11-20 07:04:44,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:04:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-20 07:04:44,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105618371] [2019-11-20 07:04:44,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:04:44,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:04:44,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543649758] [2019-11-20 07:04:44,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:04:44,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:04:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:04:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:44,603 INFO L87 Difference]: Start difference. First operand 20184 states and 21093 transitions. Second operand 3 states. [2019-11-20 07:04:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:04:45,839 INFO L93 Difference]: Finished difference Result 24560 states and 25612 transitions. [2019-11-20 07:04:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:04:45,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2019-11-20 07:04:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:04:45,858 INFO L225 Difference]: With dead ends: 24560 [2019-11-20 07:04:45,858 INFO L226 Difference]: Without dead ends: 22364 [2019-11-20 07:04:45,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:04:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-11-20 07:04:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 20186. [2019-11-20 07:04:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2019-11-20 07:04:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21095 transitions. [2019-11-20 07:04:47,121 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21095 transitions. Word has length 411 [2019-11-20 07:04:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:04:47,122 INFO L462 AbstractCegarLoop]: Abstraction has 20186 states and 21095 transitions. [2019-11-20 07:04:47,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:04:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21095 transitions. [2019-11-20 07:04:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 07:04:47,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:04:47,134 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:04:47,134 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:04:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:04:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash 398102070, now seen corresponding path program 1 times [2019-11-20 07:04:47,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:04:47,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52300615] [2019-11-20 07:04:47,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:04:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:04:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:04:47,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:04:47,433 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:04:47,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:04:47 BoogieIcfgContainer [2019-11-20 07:04:47,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:04:47,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:04:47,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:04:47,761 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:04:47,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:01:48" (3/4) ... [2019-11-20 07:04:47,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:04:48,063 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3809aebb-cf86-420e-89f4-ffdeb5e575fc/bin/uautomizer/witness.graphml [2019-11-20 07:04:48,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:04:48,065 INFO L168 Benchmark]: Toolchain (without parser) took 182031.37 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 950.1 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 581.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,066 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:04:48,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,067 INFO L168 Benchmark]: Boogie Preprocessor took 99.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,067 INFO L168 Benchmark]: RCFGBuilder took 1576.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.7 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,068 INFO L168 Benchmark]: TraceAbstraction took 179404.02 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 944.7 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 387.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,068 INFO L168 Benchmark]: Witness Printer took 302.91 ms. Allocated memory is still 5.8 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 100.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:04:48,071 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 502.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1576.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.7 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179404.02 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 944.7 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 387.9 MB. Max. memory is 11.5 GB. * Witness Printer took 302.91 ms. Allocated memory is still 5.8 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 100.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int t4_pc = 0; [L19] int t5_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int t4_st ; [L25] int t5_st ; [L26] int m_i ; [L27] int t1_i ; [L28] int t2_i ; [L29] int t3_i ; [L30] int t4_i ; [L31] int t5_i ; [L32] int M_E = 2; [L33] int T1_E = 2; [L34] int T2_E = 2; [L35] int T3_E = 2; [L36] int T4_E = 2; [L37] int T5_E = 2; [L38] int E_M = 2; [L39] int E_1 = 2; [L40] int E_2 = 2; [L41] int E_3 = 2; [L42] int E_4 = 2; [L43] int E_5 = 2; [L51] int token ; [L53] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L975] int __retres1 ; [L886] m_i = 1 [L887] t1_i = 1 [L888] t2_i = 1 [L889] t3_i = 1 [L890] t4_i = 1 [L891] t5_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L916] int kernel_st ; [L917] int tmp ; [L918] int tmp___0 ; [L922] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L416] COND TRUE m_i == 1 [L417] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L421] COND TRUE t1_i == 1 [L422] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L426] COND TRUE t2_i == 1 [L427] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L431] COND TRUE t3_i == 1 [L432] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L436] COND TRUE t4_i == 1 [L437] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L441] COND TRUE t5_i == 1 [L442] t5_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L601] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L606] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L611] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L616] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L621] COND FALSE !(T4_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L626] COND FALSE !(T5_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L631] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L636] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L641] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L646] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L651] COND FALSE !(E_4 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L656] COND FALSE !(E_5 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L294] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L313] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L332] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L351] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L370] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L389] COND FALSE !(t5_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L679] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L684] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L689] COND FALSE !(T4_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L694] COND FALSE !(T5_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L699] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L704] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L709] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L714] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L719] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L724] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L930] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L933] kernel_st = 1 [L492] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L520] COND TRUE t1_st == 0 [L521] int tmp_ndt_2; [L522] tmp_ndt_2 = __VERIFIER_nondet_int() [L523] COND TRUE \read(tmp_ndt_2) [L525] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L114] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L125] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L127] t1_pc = 1 [L128] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L534] COND TRUE t2_st == 0 [L535] int tmp_ndt_3; [L536] tmp_ndt_3 = __VERIFIER_nondet_int() [L537] COND TRUE \read(tmp_ndt_3) [L539] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L150] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L161] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L163] t2_pc = 1 [L164] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L548] COND TRUE t3_st == 0 [L549] int tmp_ndt_4; [L550] tmp_ndt_4 = __VERIFIER_nondet_int() [L551] COND TRUE \read(tmp_ndt_4) [L553] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L186] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L197] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L199] t3_pc = 1 [L200] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L562] COND TRUE t4_st == 0 [L563] int tmp_ndt_5; [L564] tmp_ndt_5 = __VERIFIER_nondet_int() [L565] COND TRUE \read(tmp_ndt_5) [L567] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L222] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L233] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L235] t4_pc = 1 [L236] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L576] COND TRUE t5_st == 0 [L577] int tmp_ndt_6; [L578] tmp_ndt_6 = __VERIFIER_nondet_int() [L579] COND TRUE \read(tmp_ndt_6) [L581] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L258] COND TRUE t5_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L269] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L271] t5_pc = 1 [L272] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND TRUE \read(tmp_ndt_1) [L511] m_st = 1 [L56] int tmp_var = __VERIFIER_nondet_int(); [L58] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L69] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L72] token = __VERIFIER_nondet_int() [L73] local = token [L74] E_1 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L294] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L304] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L306] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L310] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L313] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L314] COND TRUE E_1 == 1 [L315] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L325] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L751] tmp___0 = is_transmit1_triggered() [L753] COND TRUE \read(tmp___0) [L754] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L329] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L332] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L333] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L342] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L344] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L348] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L351] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L352] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L361] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L363] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L367] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L370] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L371] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L380] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L382] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L386] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L389] COND TRUE t5_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L390] COND FALSE !(E_5 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L399] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L401] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L76] E_1 = 2 [L77] m_pc = 1 [L78] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L520] COND TRUE t1_st == 0 [L521] int tmp_ndt_2; [L522] tmp_ndt_2 = __VERIFIER_nondet_int() [L523] COND TRUE \read(tmp_ndt_2) [L525] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L114] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L117] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-5] [L133] token += 1 [L134] E_2 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L304] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L306] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L310] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L323] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L325] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L329] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L333] COND TRUE E_2 == 1 [L334] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L344] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L759] tmp___1 = is_transmit2_triggered() [L761] COND TRUE \read(tmp___1) [L762] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L348] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L361] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L363] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L367] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L380] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L382] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L386] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L399] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L401] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L136] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L125] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L127] t1_pc = 1 [L128] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L534] COND TRUE t2_st == 0 [L535] int tmp_ndt_3; [L536] tmp_ndt_3 = __VERIFIER_nondet_int() [L537] COND TRUE \read(tmp_ndt_3) [L539] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L150] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L153] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-4] [L169] token += 1 [L170] E_3 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L352] COND TRUE E_3 == 1 [L353] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L767] tmp___2 = is_transmit3_triggered() [L769] COND TRUE \read(tmp___2) [L770] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L172] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L161] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L163] t2_pc = 1 [L164] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L548] COND TRUE t3_st == 0 [L549] int tmp_ndt_4; [L550] tmp_ndt_4 = __VERIFIER_nondet_int() [L551] COND TRUE \read(tmp_ndt_4) [L553] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L186] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L189] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-3] [L205] token += 1 [L206] E_4 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L371] COND TRUE E_4 == 1 [L372] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L775] tmp___3 = is_transmit4_triggered() [L777] COND TRUE \read(tmp___3) [L778] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L208] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L197] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L199] t3_pc = 1 [L200] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L562] COND TRUE t4_st == 0 [L563] int tmp_ndt_5; [L564] tmp_ndt_5 = __VERIFIER_nondet_int() [L565] COND TRUE \read(tmp_ndt_5) [L567] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L222] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L225] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-2] [L241] token += 1 [L242] E_5 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L390] COND TRUE E_5 == 1 [L391] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=-1] [L783] tmp___4 = is_transmit5_triggered() [L785] COND TRUE \read(tmp___4) [L786] t5_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=-1] [L244] E_5 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=-1] [L233] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=-1] [L235] t4_pc = 1 [L236] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=-1] [L576] COND TRUE t5_st == 0 [L577] int tmp_ndt_6; [L578] tmp_ndt_6 = __VERIFIER_nondet_int() [L579] COND TRUE \read(tmp_ndt_6) [L581] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=-1] [L258] COND FALSE !(t5_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=-1] [L261] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=-1] [L277] token += 1 [L278] E_M = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L295] COND TRUE E_M == 1 [L296] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L743] tmp = is_master_triggered() [L745] COND TRUE \read(tmp) [L746] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L280] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L269] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=0] [L271] t5_pc = 1 [L272] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND TRUE \read(tmp_ndt_1) [L511] m_st = 1 [L56] int tmp_var = __VERIFIER_nondet_int(); [L58] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L61] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L83] COND FALSE !(token != local + 5) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L88] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L89] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L94] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L95] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L96] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=-5, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 540 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.3s, OverallIterations: 50, TraceHistogramMax: 3, AutomataDifference: 88.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 39010 SDtfs, 34584 SDslu, 28927 SDs, 0 SdLazy, 1041 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117811occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 84.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 56508 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 9987 NumberOfCodeBlocks, 9987 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 9526 ConstructedInterpolants, 0 QuantifiedInterpolants, 4457844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 PerfectInterpolantSequences, 984/984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...