./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/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 69fb30bd96659b6c61b59030d7ea8c3053fedc35 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-10-22 08:55:38,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:38,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:38,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:38,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:38,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:38,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:38,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:38,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:38,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:38,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:38,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:38,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:38,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:38,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:38,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:38,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:38,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:38,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:38,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:38,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:38,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:38,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:38,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:38,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:38,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:38,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:38,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:38,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:38,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:38,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:38,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:38,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:38,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:38,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:38,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:38,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:38,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:38,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:38,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:38,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:38,697 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:38,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:38,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:38,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:38,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:38,713 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:38,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:38,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:38,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:38,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:38,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:38,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:38,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:38,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:38,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:38,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:38,719 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:38,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:38,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:38,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:38,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:38,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:38,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:38,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:38,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:38,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:38,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:38,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:38,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:38,721 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/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/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 -> 69fb30bd96659b6c61b59030d7ea8c3053fedc35 [2019-10-22 08:55:38,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:38,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:38,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:38,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:38,767 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:38,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2019-10-22 08:55:38,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/data/4c6e5bc81/5c204dc2856e4b79b887fd0351e39a27/FLAG04c480455 [2019-10-22 08:55:39,211 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:39,212 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2019-10-22 08:55:39,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/data/4c6e5bc81/5c204dc2856e4b79b887fd0351e39a27/FLAG04c480455 [2019-10-22 08:55:39,613 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/data/4c6e5bc81/5c204dc2856e4b79b887fd0351e39a27 [2019-10-22 08:55:39,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:39,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:39,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:39,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:39,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:39,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125dadd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39, skipping insertion in model container [2019-10-22 08:55:39,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,630 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:39,658 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:39,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:39,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:39,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:39,947 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:39,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39 WrapperNode [2019-10-22 08:55:39,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:39,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:39,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:39,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:39,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:39,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:39,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:39,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:39,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:40,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... [2019-10-22 08:55:40,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:40,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:40,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:40,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:40,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/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-10-22 08:55:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:41,068 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:41,068 INFO L284 CfgBuilder]: Removed 132 assume(true) statements. [2019-10-22 08:55:41,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:41 BoogieIcfgContainer [2019-10-22 08:55:41,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:41,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:41,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:41,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:41,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:39" (1/3) ... [2019-10-22 08:55:41,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737fd131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:41, skipping insertion in model container [2019-10-22 08:55:41,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:39" (2/3) ... [2019-10-22 08:55:41,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737fd131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:41, skipping insertion in model container [2019-10-22 08:55:41,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:41" (3/3) ... [2019-10-22 08:55:41,075 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-22 08:55:41,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:41,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:55:41,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:55:41,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:41,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:41,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:41,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:41,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:41,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:41,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:41,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2019-10-22 08:55:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:41,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:41,144 INFO L380 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] [2019-10-22 08:55:41,146 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2019-10-22 08:55:41,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153835557] [2019-10-22 08:55:41,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153835557] [2019-10-22 08:55:41,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:41,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531721948] [2019-10-22 08:55:41,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:41,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,307 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2019-10-22 08:55:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,365 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2019-10-22 08:55:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:41,379 INFO L225 Difference]: With dead ends: 627 [2019-10-22 08:55:41,379 INFO L226 Difference]: Without dead ends: 312 [2019-10-22 08:55:41,382 INFO L600 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-10-22 08:55:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-22 08:55:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-10-22 08:55:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 08:55:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2019-10-22 08:55:41,434 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2019-10-22 08:55:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:41,435 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2019-10-22 08:55:41,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2019-10-22 08:55:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:41,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:41,436 INFO L380 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] [2019-10-22 08:55:41,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2019-10-22 08:55:41,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379234132] [2019-10-22 08:55:41,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379234132] [2019-10-22 08:55:41,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:41,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350062149] [2019-10-22 08:55:41,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:41,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,485 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2019-10-22 08:55:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,571 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2019-10-22 08:55:41,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:41,578 INFO L225 Difference]: With dead ends: 848 [2019-10-22 08:55:41,578 INFO L226 Difference]: Without dead ends: 544 [2019-10-22 08:55:41,580 INFO L600 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-10-22 08:55:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-22 08:55:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-10-22 08:55:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2019-10-22 08:55:41,645 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2019-10-22 08:55:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:41,645 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2019-10-22 08:55:41,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2019-10-22 08:55:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:41,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:41,647 INFO L380 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] [2019-10-22 08:55:41,647 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:41,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2019-10-22 08:55:41,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358292363] [2019-10-22 08:55:41,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358292363] [2019-10-22 08:55:41,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:41,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099126318] [2019-10-22 08:55:41,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:41,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,709 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 3 states. [2019-10-22 08:55:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,745 INFO L93 Difference]: Finished difference Result 1071 states and 1623 transitions. [2019-10-22 08:55:41,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:41,748 INFO L225 Difference]: With dead ends: 1071 [2019-10-22 08:55:41,748 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:41,754 INFO L600 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-10-22 08:55:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 810 transitions. [2019-10-22 08:55:41,786 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 810 transitions. Word has length 61 [2019-10-22 08:55:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:41,787 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 810 transitions. [2019-10-22 08:55:41,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 810 transitions. [2019-10-22 08:55:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:41,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:41,792 INFO L380 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] [2019-10-22 08:55:41,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1494892678, now seen corresponding path program 1 times [2019-10-22 08:55:41,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73817059] [2019-10-22 08:55:41,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73817059] [2019-10-22 08:55:41,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:41,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669498440] [2019-10-22 08:55:41,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:41,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,859 INFO L87 Difference]: Start difference. First operand 540 states and 810 transitions. Second operand 3 states. [2019-10-22 08:55:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,896 INFO L93 Difference]: Finished difference Result 1070 states and 1606 transitions. [2019-10-22 08:55:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:41,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:41,899 INFO L225 Difference]: With dead ends: 1070 [2019-10-22 08:55:41,901 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:41,902 INFO L600 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-10-22 08:55:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 802 transitions. [2019-10-22 08:55:41,929 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 802 transitions. Word has length 61 [2019-10-22 08:55:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:41,931 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 802 transitions. [2019-10-22 08:55:41,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 802 transitions. [2019-10-22 08:55:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:41,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:41,932 INFO L380 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] [2019-10-22 08:55:41,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash -774201098, now seen corresponding path program 1 times [2019-10-22 08:55:41,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:41,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138425727] [2019-10-22 08:55:41,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:41,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:41,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138425727] [2019-10-22 08:55:41,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:41,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:41,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400127515] [2019-10-22 08:55:41,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:41,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:41,990 INFO L87 Difference]: Start difference. First operand 540 states and 802 transitions. Second operand 3 states. [2019-10-22 08:55:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,024 INFO L93 Difference]: Finished difference Result 1069 states and 1589 transitions. [2019-10-22 08:55:42,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,027 INFO L225 Difference]: With dead ends: 1069 [2019-10-22 08:55:42,027 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:42,028 INFO L600 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-10-22 08:55:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 794 transitions. [2019-10-22 08:55:42,051 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 794 transitions. Word has length 61 [2019-10-22 08:55:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,052 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 794 transitions. [2019-10-22 08:55:42,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 794 transitions. [2019-10-22 08:55:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:42,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,053 INFO L380 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] [2019-10-22 08:55:42,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -196763654, now seen corresponding path program 1 times [2019-10-22 08:55:42,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512081943] [2019-10-22 08:55:42,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512081943] [2019-10-22 08:55:42,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62249634] [2019-10-22 08:55:42,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,107 INFO L87 Difference]: Start difference. First operand 540 states and 794 transitions. Second operand 3 states. [2019-10-22 08:55:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,167 INFO L93 Difference]: Finished difference Result 1068 states and 1572 transitions. [2019-10-22 08:55:42,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,171 INFO L225 Difference]: With dead ends: 1068 [2019-10-22 08:55:42,171 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:42,172 INFO L600 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-10-22 08:55:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 776 transitions. [2019-10-22 08:55:42,199 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 776 transitions. Word has length 61 [2019-10-22 08:55:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,200 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 776 transitions. [2019-10-22 08:55:42,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 776 transitions. [2019-10-22 08:55:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:42,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,201 INFO L380 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] [2019-10-22 08:55:42,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 749500983, now seen corresponding path program 1 times [2019-10-22 08:55:42,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541391428] [2019-10-22 08:55:42,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541391428] [2019-10-22 08:55:42,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812364069] [2019-10-22 08:55:42,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,263 INFO L87 Difference]: Start difference. First operand 540 states and 776 transitions. Second operand 3 states. [2019-10-22 08:55:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,322 INFO L93 Difference]: Finished difference Result 1066 states and 1533 transitions. [2019-10-22 08:55:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,324 INFO L225 Difference]: With dead ends: 1066 [2019-10-22 08:55:42,324 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:42,325 INFO L600 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-10-22 08:55:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 758 transitions. [2019-10-22 08:55:42,346 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 758 transitions. Word has length 61 [2019-10-22 08:55:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,346 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 758 transitions. [2019-10-22 08:55:42,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 758 transitions. [2019-10-22 08:55:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:42,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,347 INFO L380 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] [2019-10-22 08:55:42,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash 91036916, now seen corresponding path program 1 times [2019-10-22 08:55:42,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323211403] [2019-10-22 08:55:42,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323211403] [2019-10-22 08:55:42,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910865684] [2019-10-22 08:55:42,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,378 INFO L87 Difference]: Start difference. First operand 540 states and 758 transitions. Second operand 3 states. [2019-10-22 08:55:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,423 INFO L93 Difference]: Finished difference Result 1065 states and 1496 transitions. [2019-10-22 08:55:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,425 INFO L225 Difference]: With dead ends: 1065 [2019-10-22 08:55:42,425 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:42,426 INFO L600 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-10-22 08:55:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 740 transitions. [2019-10-22 08:55:42,446 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 740 transitions. Word has length 61 [2019-10-22 08:55:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,446 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 740 transitions. [2019-10-22 08:55:42,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 740 transitions. [2019-10-22 08:55:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:42,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,447 INFO L380 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] [2019-10-22 08:55:42,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1080534521, now seen corresponding path program 1 times [2019-10-22 08:55:42,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924277436] [2019-10-22 08:55:42,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924277436] [2019-10-22 08:55:42,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85367679] [2019-10-22 08:55:42,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,503 INFO L87 Difference]: Start difference. First operand 540 states and 740 transitions. Second operand 3 states. [2019-10-22 08:55:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,549 INFO L93 Difference]: Finished difference Result 1067 states and 1463 transitions. [2019-10-22 08:55:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,551 INFO L225 Difference]: With dead ends: 1067 [2019-10-22 08:55:42,552 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:55:42,552 INFO L600 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-10-22 08:55:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:55:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-22 08:55:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:55:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-10-22 08:55:42,574 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 61 [2019-10-22 08:55:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,574 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-10-22 08:55:42,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-10-22 08:55:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:55:42,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,575 INFO L380 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] [2019-10-22 08:55:42,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -507813381, now seen corresponding path program 1 times [2019-10-22 08:55:42,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831401656] [2019-10-22 08:55:42,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831401656] [2019-10-22 08:55:42,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:42,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447527301] [2019-10-22 08:55:42,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,633 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-10-22 08:55:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,700 INFO L93 Difference]: Finished difference Result 1522 states and 2039 transitions. [2019-10-22 08:55:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:55:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,704 INFO L225 Difference]: With dead ends: 1522 [2019-10-22 08:55:42,704 INFO L226 Difference]: Without dead ends: 999 [2019-10-22 08:55:42,706 INFO L600 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-10-22 08:55:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-10-22 08:55:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 947. [2019-10-22 08:55:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-10-22 08:55:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1256 transitions. [2019-10-22 08:55:42,742 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1256 transitions. Word has length 61 [2019-10-22 08:55:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,742 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1256 transitions. [2019-10-22 08:55:42,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1256 transitions. [2019-10-22 08:55:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:55:42,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,744 INFO L380 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] [2019-10-22 08:55:42,744 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash -624063038, now seen corresponding path program 1 times [2019-10-22 08:55:42,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154091419] [2019-10-22 08:55:42,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:42,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154091419] [2019-10-22 08:55:42,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:42,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809886717] [2019-10-22 08:55:42,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,810 INFO L87 Difference]: Start difference. First operand 947 states and 1256 transitions. Second operand 3 states. [2019-10-22 08:55:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:42,912 INFO L93 Difference]: Finished difference Result 2713 states and 3613 transitions. [2019-10-22 08:55:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:42,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:55:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:42,919 INFO L225 Difference]: With dead ends: 2713 [2019-10-22 08:55:42,919 INFO L226 Difference]: Without dead ends: 1789 [2019-10-22 08:55:42,921 INFO L600 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-10-22 08:55:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-10-22 08:55:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1701. [2019-10-22 08:55:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-10-22 08:55:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2254 transitions. [2019-10-22 08:55:42,984 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2254 transitions. Word has length 99 [2019-10-22 08:55:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,985 INFO L462 AbstractCegarLoop]: Abstraction has 1701 states and 2254 transitions. [2019-10-22 08:55:42,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2254 transitions. [2019-10-22 08:55:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:55:42,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,986 INFO L380 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] [2019-10-22 08:55:42,987 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2094346499, now seen corresponding path program 1 times [2019-10-22 08:55:42,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376872483] [2019-10-22 08:55:42,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:43,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376872483] [2019-10-22 08:55:43,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:43,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:43,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78505654] [2019-10-22 08:55:43,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:43,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:43,047 INFO L87 Difference]: Start difference. First operand 1701 states and 2254 transitions. Second operand 5 states. [2019-10-22 08:55:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:43,248 INFO L93 Difference]: Finished difference Result 3741 states and 4988 transitions. [2019-10-22 08:55:43,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:43,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-22 08:55:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:43,255 INFO L225 Difference]: With dead ends: 3741 [2019-10-22 08:55:43,255 INFO L226 Difference]: Without dead ends: 2067 [2019-10-22 08:55:43,257 INFO L600 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-10-22 08:55:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-22 08:55:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1707. [2019-10-22 08:55:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:55:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2225 transitions. [2019-10-22 08:55:43,329 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2225 transitions. Word has length 99 [2019-10-22 08:55:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:43,330 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2225 transitions. [2019-10-22 08:55:43,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2225 transitions. [2019-10-22 08:55:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:55:43,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:43,331 INFO L380 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] [2019-10-22 08:55:43,331 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1569507335, now seen corresponding path program 1 times [2019-10-22 08:55:43,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:43,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557240199] [2019-10-22 08:55:43,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:43,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557240199] [2019-10-22 08:55:43,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:43,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:43,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910445792] [2019-10-22 08:55:43,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:43,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:43,383 INFO L87 Difference]: Start difference. First operand 1707 states and 2225 transitions. Second operand 5 states. [2019-10-22 08:55:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:43,564 INFO L93 Difference]: Finished difference Result 4182 states and 5468 transitions. [2019-10-22 08:55:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:43,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-22 08:55:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:43,572 INFO L225 Difference]: With dead ends: 4182 [2019-10-22 08:55:43,573 INFO L226 Difference]: Without dead ends: 2509 [2019-10-22 08:55:43,575 INFO L600 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-10-22 08:55:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-10-22 08:55:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1719. [2019-10-22 08:55:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-22 08:55:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2204 transitions. [2019-10-22 08:55:43,649 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2204 transitions. Word has length 99 [2019-10-22 08:55:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:43,650 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2204 transitions. [2019-10-22 08:55:43,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2204 transitions. [2019-10-22 08:55:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:55:43,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:43,651 INFO L380 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] [2019-10-22 08:55:43,652 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1452084725, now seen corresponding path program 1 times [2019-10-22 08:55:43,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:43,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863930742] [2019-10-22 08:55:43,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:43,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:43,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863930742] [2019-10-22 08:55:43,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:43,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:43,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887896860] [2019-10-22 08:55:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:43,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:43,686 INFO L87 Difference]: Start difference. First operand 1719 states and 2204 transitions. Second operand 5 states. [2019-10-22 08:55:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:43,930 INFO L93 Difference]: Finished difference Result 4879 states and 6330 transitions. [2019-10-22 08:55:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:43,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-22 08:55:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:43,939 INFO L225 Difference]: With dead ends: 4879 [2019-10-22 08:55:43,939 INFO L226 Difference]: Without dead ends: 3201 [2019-10-22 08:55:43,941 INFO L600 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-10-22 08:55:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-10-22 08:55:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 1743. [2019-10-22 08:55:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2019-10-22 08:55:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2199 transitions. [2019-10-22 08:55:44,027 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2199 transitions. Word has length 99 [2019-10-22 08:55:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:44,028 INFO L462 AbstractCegarLoop]: Abstraction has 1743 states and 2199 transitions. [2019-10-22 08:55:44,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2199 transitions. [2019-10-22 08:55:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:55:44,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:44,029 INFO L380 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] [2019-10-22 08:55:44,030 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1078857969, now seen corresponding path program 1 times [2019-10-22 08:55:44,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:44,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701377787] [2019-10-22 08:55:44,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:44,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701377787] [2019-10-22 08:55:44,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:44,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:44,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385561888] [2019-10-22 08:55:44,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:44,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:44,076 INFO L87 Difference]: Start difference. First operand 1743 states and 2199 transitions. Second operand 3 states. [2019-10-22 08:55:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:44,221 INFO L93 Difference]: Finished difference Result 4925 states and 6187 transitions. [2019-10-22 08:55:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:44,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:55:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:44,230 INFO L225 Difference]: With dead ends: 4925 [2019-10-22 08:55:44,230 INFO L226 Difference]: Without dead ends: 3231 [2019-10-22 08:55:44,233 INFO L600 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-10-22 08:55:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2019-10-22 08:55:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3227. [2019-10-22 08:55:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2019-10-22 08:55:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4009 transitions. [2019-10-22 08:55:44,381 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4009 transitions. Word has length 99 [2019-10-22 08:55:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:44,381 INFO L462 AbstractCegarLoop]: Abstraction has 3227 states and 4009 transitions. [2019-10-22 08:55:44,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4009 transitions. [2019-10-22 08:55:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:55:44,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:44,383 INFO L380 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] [2019-10-22 08:55:44,383 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1872181795, now seen corresponding path program 1 times [2019-10-22 08:55:44,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:44,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905375752] [2019-10-22 08:55:44,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:44,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905375752] [2019-10-22 08:55:44,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:44,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:44,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405130040] [2019-10-22 08:55:44,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:44,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:44,423 INFO L87 Difference]: Start difference. First operand 3227 states and 4009 transitions. Second operand 3 states. [2019-10-22 08:55:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:44,697 INFO L93 Difference]: Finished difference Result 9026 states and 11196 transitions. [2019-10-22 08:55:44,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:44,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 08:55:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:44,712 INFO L225 Difference]: With dead ends: 9026 [2019-10-22 08:55:44,713 INFO L226 Difference]: Without dead ends: 5848 [2019-10-22 08:55:44,717 INFO L600 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-10-22 08:55:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2019-10-22 08:55:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 5844. [2019-10-22 08:55:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-10-22 08:55:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 7200 transitions. [2019-10-22 08:55:44,973 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 7200 transitions. Word has length 100 [2019-10-22 08:55:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:44,977 INFO L462 AbstractCegarLoop]: Abstraction has 5844 states and 7200 transitions. [2019-10-22 08:55:44,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 7200 transitions. [2019-10-22 08:55:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:55:44,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:44,980 INFO L380 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] [2019-10-22 08:55:44,980 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash -520796577, now seen corresponding path program 1 times [2019-10-22 08:55:44,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:44,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207358427] [2019-10-22 08:55:44,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:44,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:55:44,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207358427] [2019-10-22 08:55:44,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:44,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:44,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373931046] [2019-10-22 08:55:44,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:44,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:44,999 INFO L87 Difference]: Start difference. First operand 5844 states and 7200 transitions. Second operand 3 states. [2019-10-22 08:55:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:45,334 INFO L93 Difference]: Finished difference Result 11596 states and 14298 transitions. [2019-10-22 08:55:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 08:55:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:45,353 INFO L225 Difference]: With dead ends: 11596 [2019-10-22 08:55:45,353 INFO L226 Difference]: Without dead ends: 5801 [2019-10-22 08:55:45,358 INFO L600 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-10-22 08:55:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-10-22 08:55:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5801. [2019-10-22 08:55:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5801 states. [2019-10-22 08:55:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 7152 transitions. [2019-10-22 08:55:45,614 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 7152 transitions. Word has length 100 [2019-10-22 08:55:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:45,614 INFO L462 AbstractCegarLoop]: Abstraction has 5801 states and 7152 transitions. [2019-10-22 08:55:45,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 7152 transitions. [2019-10-22 08:55:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:55:45,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:45,617 INFO L380 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] [2019-10-22 08:55:45,618 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1349787928, now seen corresponding path program 1 times [2019-10-22 08:55:45,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558747644] [2019-10-22 08:55:45,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:45,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558747644] [2019-10-22 08:55:45,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:45,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718588712] [2019-10-22 08:55:45,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:45,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:45,666 INFO L87 Difference]: Start difference. First operand 5801 states and 7152 transitions. Second operand 3 states. [2019-10-22 08:55:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,107 INFO L93 Difference]: Finished difference Result 16291 states and 20097 transitions. [2019-10-22 08:55:46,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:46,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 08:55:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:46,126 INFO L225 Difference]: With dead ends: 16291 [2019-10-22 08:55:46,126 INFO L226 Difference]: Without dead ends: 10539 [2019-10-22 08:55:46,132 INFO L600 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-10-22 08:55:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2019-10-22 08:55:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 10535. [2019-10-22 08:55:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10535 states. [2019-10-22 08:55:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 12941 transitions. [2019-10-22 08:55:46,537 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 12941 transitions. Word has length 101 [2019-10-22 08:55:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:46,537 INFO L462 AbstractCegarLoop]: Abstraction has 10535 states and 12941 transitions. [2019-10-22 08:55:46,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 12941 transitions. [2019-10-22 08:55:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:55:46,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:46,542 INFO L380 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] [2019-10-22 08:55:46,542 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1593794150, now seen corresponding path program 1 times [2019-10-22 08:55:46,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:46,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370644758] [2019-10-22 08:55:46,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:46,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:55:46,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370644758] [2019-10-22 08:55:46,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:46,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:46,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951270842] [2019-10-22 08:55:46,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:46,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:46,559 INFO L87 Difference]: Start difference. First operand 10535 states and 12941 transitions. Second operand 3 states. [2019-10-22 08:55:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:47,090 INFO L93 Difference]: Finished difference Result 20979 states and 25783 transitions. [2019-10-22 08:55:47,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:47,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 08:55:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:47,107 INFO L225 Difference]: With dead ends: 20979 [2019-10-22 08:55:47,107 INFO L226 Difference]: Without dead ends: 10493 [2019-10-22 08:55:47,115 INFO L600 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-10-22 08:55:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2019-10-22 08:55:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 10493. [2019-10-22 08:55:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10493 states. [2019-10-22 08:55:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 12895 transitions. [2019-10-22 08:55:47,438 INFO L78 Accepts]: Start accepts. Automaton has 10493 states and 12895 transitions. Word has length 101 [2019-10-22 08:55:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:47,439 INFO L462 AbstractCegarLoop]: Abstraction has 10493 states and 12895 transitions. [2019-10-22 08:55:47,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10493 states and 12895 transitions. [2019-10-22 08:55:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:55:47,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:47,443 INFO L380 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] [2019-10-22 08:55:47,443 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash 988555220, now seen corresponding path program 1 times [2019-10-22 08:55:47,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826848872] [2019-10-22 08:55:47,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:47,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826848872] [2019-10-22 08:55:47,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:47,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:47,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968606860] [2019-10-22 08:55:47,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:47,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:47,471 INFO L87 Difference]: Start difference. First operand 10493 states and 12895 transitions. Second operand 3 states. [2019-10-22 08:55:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:48,174 INFO L93 Difference]: Finished difference Result 29982 states and 36689 transitions. [2019-10-22 08:55:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:48,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 08:55:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:48,206 INFO L225 Difference]: With dead ends: 29982 [2019-10-22 08:55:48,207 INFO L226 Difference]: Without dead ends: 19538 [2019-10-22 08:55:48,218 INFO L600 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-10-22 08:55:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2019-10-22 08:55:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 19538. [2019-10-22 08:55:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19538 states. [2019-10-22 08:55:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19538 states to 19538 states and 23591 transitions. [2019-10-22 08:55:49,082 INFO L78 Accepts]: Start accepts. Automaton has 19538 states and 23591 transitions. Word has length 102 [2019-10-22 08:55:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:49,082 INFO L462 AbstractCegarLoop]: Abstraction has 19538 states and 23591 transitions. [2019-10-22 08:55:49,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19538 states and 23591 transitions. [2019-10-22 08:55:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-22 08:55:49,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:49,094 INFO L380 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] [2019-10-22 08:55:49,094 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash 490924073, now seen corresponding path program 1 times [2019-10-22 08:55:49,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868589090] [2019-10-22 08:55:49,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:49,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868589090] [2019-10-22 08:55:49,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:49,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:49,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810447157] [2019-10-22 08:55:49,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:49,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:49,144 INFO L87 Difference]: Start difference. First operand 19538 states and 23591 transitions. Second operand 3 states. [2019-10-22 08:55:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:49,995 INFO L93 Difference]: Finished difference Result 47674 states and 57563 transitions. [2019-10-22 08:55:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:49,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-22 08:55:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:50,031 INFO L225 Difference]: With dead ends: 47674 [2019-10-22 08:55:50,031 INFO L226 Difference]: Without dead ends: 28204 [2019-10-22 08:55:50,045 INFO L600 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-10-22 08:55:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28204 states. [2019-10-22 08:55:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28204 to 28072. [2019-10-22 08:55:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28072 states. [2019-10-22 08:55:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28072 states to 28072 states and 33691 transitions. [2019-10-22 08:55:50,804 INFO L78 Accepts]: Start accepts. Automaton has 28072 states and 33691 transitions. Word has length 131 [2019-10-22 08:55:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:50,804 INFO L462 AbstractCegarLoop]: Abstraction has 28072 states and 33691 transitions. [2019-10-22 08:55:50,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 28072 states and 33691 transitions. [2019-10-22 08:55:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-22 08:55:50,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:50,816 INFO L380 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] [2019-10-22 08:55:50,817 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 293838688, now seen corresponding path program 1 times [2019-10-22 08:55:50,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:50,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736519504] [2019-10-22 08:55:50,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:50,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736519504] [2019-10-22 08:55:50,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:50,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:50,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814738401] [2019-10-22 08:55:50,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:50,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:50,871 INFO L87 Difference]: Start difference. First operand 28072 states and 33691 transitions. Second operand 3 states. [2019-10-22 08:55:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,128 INFO L93 Difference]: Finished difference Result 68432 states and 82087 transitions. [2019-10-22 08:55:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-22 08:55:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:52,165 INFO L225 Difference]: With dead ends: 68432 [2019-10-22 08:55:52,165 INFO L226 Difference]: Without dead ends: 40414 [2019-10-22 08:55:52,182 INFO L600 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-10-22 08:55:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40414 states. [2019-10-22 08:55:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40414 to 40218. [2019-10-22 08:55:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40218 states. [2019-10-22 08:55:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40218 states to 40218 states and 47939 transitions. [2019-10-22 08:55:53,520 INFO L78 Accepts]: Start accepts. Automaton has 40218 states and 47939 transitions. Word has length 131 [2019-10-22 08:55:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 40218 states and 47939 transitions. [2019-10-22 08:55:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 40218 states and 47939 transitions. [2019-10-22 08:55:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-22 08:55:53,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:53,536 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:55:53,536 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 477376696, now seen corresponding path program 1 times [2019-10-22 08:55:53,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:53,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462966383] [2019-10-22 08:55:53,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 08:55:53,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462966383] [2019-10-22 08:55:53,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:53,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:53,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261962842] [2019-10-22 08:55:53,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:53,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:53,571 INFO L87 Difference]: Start difference. First operand 40218 states and 47939 transitions. Second operand 3 states. [2019-10-22 08:55:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:54,942 INFO L93 Difference]: Finished difference Result 72088 states and 85999 transitions. [2019-10-22 08:55:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:54,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-22 08:55:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:54,981 INFO L225 Difference]: With dead ends: 72088 [2019-10-22 08:55:54,981 INFO L226 Difference]: Without dead ends: 41106 [2019-10-22 08:55:55,000 INFO L600 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-10-22 08:55:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41106 states. [2019-10-22 08:55:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41106 to 39498. [2019-10-22 08:55:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39498 states. [2019-10-22 08:55:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39498 states to 39498 states and 46331 transitions. [2019-10-22 08:55:56,305 INFO L78 Accepts]: Start accepts. Automaton has 39498 states and 46331 transitions. Word has length 147 [2019-10-22 08:55:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:56,305 INFO L462 AbstractCegarLoop]: Abstraction has 39498 states and 46331 transitions. [2019-10-22 08:55:56,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39498 states and 46331 transitions. [2019-10-22 08:55:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 08:55:56,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:56,318 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:55:56,318 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1845088335, now seen corresponding path program 1 times [2019-10-22 08:55:56,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834430179] [2019-10-22 08:55:56,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:56,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834430179] [2019-10-22 08:55:56,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:56,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:56,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943529890] [2019-10-22 08:55:56,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:56,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:56,357 INFO L87 Difference]: Start difference. First operand 39498 states and 46331 transitions. Second operand 3 states. [2019-10-22 08:55:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:57,607 INFO L93 Difference]: Finished difference Result 62310 states and 73339 transitions. [2019-10-22 08:55:57,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:57,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 08:55:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:57,648 INFO L225 Difference]: With dead ends: 62310 [2019-10-22 08:55:57,648 INFO L226 Difference]: Without dead ends: 34906 [2019-10-22 08:55:57,669 INFO L600 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-10-22 08:55:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-10-22 08:55:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-10-22 08:55:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-10-22 08:55:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40863 transitions. [2019-10-22 08:55:58,736 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40863 transitions. Word has length 148 [2019-10-22 08:55:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:58,736 INFO L462 AbstractCegarLoop]: Abstraction has 34902 states and 40863 transitions. [2019-10-22 08:55:58,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40863 transitions. [2019-10-22 08:55:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 08:55:58,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:58,749 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:55:58,749 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817295, now seen corresponding path program 1 times [2019-10-22 08:55:58,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:58,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744850249] [2019-10-22 08:55:58,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:58,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744850249] [2019-10-22 08:55:58,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:58,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:58,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152006168] [2019-10-22 08:55:58,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:58,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:58,803 INFO L87 Difference]: Start difference. First operand 34902 states and 40863 transitions. Second operand 3 states. [2019-10-22 08:56:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,198 INFO L93 Difference]: Finished difference Result 62382 states and 73243 transitions. [2019-10-22 08:56:00,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:00,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 08:56:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,227 INFO L225 Difference]: With dead ends: 62382 [2019-10-22 08:56:00,227 INFO L226 Difference]: Without dead ends: 34906 [2019-10-22 08:56:00,242 INFO L600 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-10-22 08:56:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-10-22 08:56:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-10-22 08:56:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-10-22 08:56:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40695 transitions. [2019-10-22 08:56:01,138 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40695 transitions. Word has length 148 [2019-10-22 08:56:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:01,139 INFO L462 AbstractCegarLoop]: Abstraction has 34902 states and 40695 transitions. [2019-10-22 08:56:01,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40695 transitions. [2019-10-22 08:56:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 08:56:01,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:01,144 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:56:01,144 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1576151473, now seen corresponding path program 1 times [2019-10-22 08:56:01,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077659978] [2019-10-22 08:56:01,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:56:01,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077659978] [2019-10-22 08:56:01,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:01,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:01,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5479059] [2019-10-22 08:56:01,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:01,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:01,181 INFO L87 Difference]: Start difference. First operand 34902 states and 40695 transitions. Second operand 3 states. [2019-10-22 08:56:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:02,078 INFO L93 Difference]: Finished difference Result 58470 states and 68303 transitions. [2019-10-22 08:56:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:02,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 08:56:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:02,096 INFO L225 Difference]: With dead ends: 58470 [2019-10-22 08:56:02,096 INFO L226 Difference]: Without dead ends: 23658 [2019-10-22 08:56:02,107 INFO L600 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-10-22 08:56:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23658 states. [2019-10-22 08:56:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23658 to 23654. [2019-10-22 08:56:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23654 states. [2019-10-22 08:56:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23654 states to 23654 states and 27459 transitions. [2019-10-22 08:56:02,707 INFO L78 Accepts]: Start accepts. Automaton has 23654 states and 27459 transitions. Word has length 148 [2019-10-22 08:56:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:02,707 INFO L462 AbstractCegarLoop]: Abstraction has 23654 states and 27459 transitions. [2019-10-22 08:56:02,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23654 states and 27459 transitions. [2019-10-22 08:56:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 08:56:02,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:02,711 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:02,711 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -954570, now seen corresponding path program 1 times [2019-10-22 08:56:02,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438275053] [2019-10-22 08:56:02,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 08:56:02,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438275053] [2019-10-22 08:56:02,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:02,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:02,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131110460] [2019-10-22 08:56:02,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:02,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:02,768 INFO L87 Difference]: Start difference. First operand 23654 states and 27459 transitions. Second operand 3 states. [2019-10-22 08:56:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:03,485 INFO L93 Difference]: Finished difference Result 43106 states and 50305 transitions. [2019-10-22 08:56:03,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:03,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 08:56:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:03,505 INFO L225 Difference]: With dead ends: 43106 [2019-10-22 08:56:03,505 INFO L226 Difference]: Without dead ends: 24254 [2019-10-22 08:56:03,518 INFO L600 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-10-22 08:56:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24254 states. [2019-10-22 08:56:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24254 to 23534. [2019-10-22 08:56:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23534 states. [2019-10-22 08:56:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23534 states to 23534 states and 26843 transitions. [2019-10-22 08:56:04,140 INFO L78 Accepts]: Start accepts. Automaton has 23534 states and 26843 transitions. Word has length 148 [2019-10-22 08:56:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:04,141 INFO L462 AbstractCegarLoop]: Abstraction has 23534 states and 26843 transitions. [2019-10-22 08:56:04,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23534 states and 26843 transitions. [2019-10-22 08:56:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-22 08:56:04,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:04,145 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:04,146 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash 823641312, now seen corresponding path program 1 times [2019-10-22 08:56:04,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20882222] [2019-10-22 08:56:04,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:56:04,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20882222] [2019-10-22 08:56:04,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:04,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:04,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436959202] [2019-10-22 08:56:04,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:04,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:04,200 INFO L87 Difference]: Start difference. First operand 23534 states and 26843 transitions. Second operand 5 states. [2019-10-22 08:56:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:04,810 INFO L93 Difference]: Finished difference Result 32626 states and 36969 transitions. [2019-10-22 08:56:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:04,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-22 08:56:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:04,814 INFO L225 Difference]: With dead ends: 32626 [2019-10-22 08:56:04,814 INFO L226 Difference]: Without dead ends: 4731 [2019-10-22 08:56:04,825 INFO L600 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-10-22 08:56:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-10-22 08:56:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4595. [2019-10-22 08:56:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-10-22 08:56:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4976 transitions. [2019-10-22 08:56:05,021 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4976 transitions. Word has length 149 [2019-10-22 08:56:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:05,021 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4976 transitions. [2019-10-22 08:56:05,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4976 transitions. [2019-10-22 08:56:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-22 08:56:05,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:05,024 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:05,025 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:05,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1473194168, now seen corresponding path program 1 times [2019-10-22 08:56:05,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095486244] [2019-10-22 08:56:05,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:05,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095486244] [2019-10-22 08:56:05,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:05,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:05,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850951999] [2019-10-22 08:56:05,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:05,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:05,176 INFO L87 Difference]: Start difference. First operand 4595 states and 4976 transitions. Second operand 3 states. [2019-10-22 08:56:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:05,320 INFO L93 Difference]: Finished difference Result 7852 states and 8519 transitions. [2019-10-22 08:56:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:05,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-22 08:56:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:05,324 INFO L225 Difference]: With dead ends: 7852 [2019-10-22 08:56:05,324 INFO L226 Difference]: Without dead ends: 4595 [2019-10-22 08:56:05,327 INFO L600 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-10-22 08:56:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-10-22 08:56:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-10-22 08:56:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-10-22 08:56:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4922 transitions. [2019-10-22 08:56:05,456 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4922 transitions. Word has length 214 [2019-10-22 08:56:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:05,456 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4922 transitions. [2019-10-22 08:56:05,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4922 transitions. [2019-10-22 08:56:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-22 08:56:05,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:05,458 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:05,458 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1279770330, now seen corresponding path program 1 times [2019-10-22 08:56:05,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737890389] [2019-10-22 08:56:05,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:05,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737890389] [2019-10-22 08:56:05,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:05,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:05,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136357135] [2019-10-22 08:56:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:05,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:05,507 INFO L87 Difference]: Start difference. First operand 4595 states and 4922 transitions. Second operand 3 states. [2019-10-22 08:56:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:05,669 INFO L93 Difference]: Finished difference Result 7385 states and 7926 transitions. [2019-10-22 08:56:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:05,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-22 08:56:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:05,672 INFO L225 Difference]: With dead ends: 7385 [2019-10-22 08:56:05,672 INFO L226 Difference]: Without dead ends: 4595 [2019-10-22 08:56:05,675 INFO L600 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-10-22 08:56:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-10-22 08:56:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-10-22 08:56:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-10-22 08:56:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4876 transitions. [2019-10-22 08:56:05,816 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4876 transitions. Word has length 217 [2019-10-22 08:56:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:05,816 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4876 transitions. [2019-10-22 08:56:05,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4876 transitions. [2019-10-22 08:56:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-22 08:56:05,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:05,818 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:05,819 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2019-10-22 08:56:05,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777983410] [2019-10-22 08:56:05,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:05,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777983410] [2019-10-22 08:56:05,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:05,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:05,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278982023] [2019-10-22 08:56:05,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:05,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:05,874 INFO L87 Difference]: Start difference. First operand 4595 states and 4876 transitions. Second operand 3 states. [2019-10-22 08:56:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:06,030 INFO L93 Difference]: Finished difference Result 5891 states and 6255 transitions. [2019-10-22 08:56:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:06,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-22 08:56:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:06,033 INFO L225 Difference]: With dead ends: 5891 [2019-10-22 08:56:06,033 INFO L226 Difference]: Without dead ends: 3680 [2019-10-22 08:56:06,035 INFO L600 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-10-22 08:56:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-10-22 08:56:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2019-10-22 08:56:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-10-22 08:56:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3894 transitions. [2019-10-22 08:56:06,140 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3894 transitions. Word has length 220 [2019-10-22 08:56:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:06,140 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 3894 transitions. [2019-10-22 08:56:06,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3894 transitions. [2019-10-22 08:56:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-22 08:56:06,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:06,142 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:06,142 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2019-10-22 08:56:06,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:06,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871233245] [2019-10-22 08:56:06,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:06,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:06,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 08:56:06,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871233245] [2019-10-22 08:56:06,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:06,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:06,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794287836] [2019-10-22 08:56:06,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:06,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:06,322 INFO L87 Difference]: Start difference. First operand 3680 states and 3894 transitions. Second operand 6 states. [2019-10-22 08:56:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:06,533 INFO L93 Difference]: Finished difference Result 3680 states and 3894 transitions. [2019-10-22 08:56:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:06,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-10-22 08:56:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:06,537 INFO L225 Difference]: With dead ends: 3680 [2019-10-22 08:56:06,537 INFO L226 Difference]: Without dead ends: 3678 [2019-10-22 08:56:06,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-10-22 08:56:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3678. [2019-10-22 08:56:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-10-22 08:56:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 3891 transitions. [2019-10-22 08:56:06,741 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 3891 transitions. Word has length 223 [2019-10-22 08:56:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:06,742 INFO L462 AbstractCegarLoop]: Abstraction has 3678 states and 3891 transitions. [2019-10-22 08:56:06,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 3891 transitions. [2019-10-22 08:56:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-22 08:56:06,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:06,745 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:06,745 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2019-10-22 08:56:06,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:06,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041390607] [2019-10-22 08:56:06,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:06,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:06,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 08:56:06,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041390607] [2019-10-22 08:56:06,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:06,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:06,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063931443] [2019-10-22 08:56:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:06,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:06,797 INFO L87 Difference]: Start difference. First operand 3678 states and 3891 transitions. Second operand 3 states. [2019-10-22 08:56:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:07,037 INFO L93 Difference]: Finished difference Result 5766 states and 6078 transitions. [2019-10-22 08:56:07,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:07,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-22 08:56:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:07,041 INFO L225 Difference]: With dead ends: 5766 [2019-10-22 08:56:07,042 INFO L226 Difference]: Without dead ends: 4714 [2019-10-22 08:56:07,044 INFO L600 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-10-22 08:56:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-10-22 08:56:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 3680. [2019-10-22 08:56:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-10-22 08:56:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3893 transitions. [2019-10-22 08:56:07,239 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3893 transitions. Word has length 227 [2019-10-22 08:56:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:07,240 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 3893 transitions. [2019-10-22 08:56:07,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3893 transitions. [2019-10-22 08:56:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-22 08:56:07,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:07,243 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:56:07,243 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2019-10-22 08:56:07,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149823898] [2019-10-22 08:56:07,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,349 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,349 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:56:07,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:07 BoogieIcfgContainer [2019-10-22 08:56:07,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:07,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:07,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:07,496 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:07,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:41" (3/4) ... [2019-10-22 08:56:07,500 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:56:07,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f2bd46da-1073-4352-b007-3c98becbdeb9/bin/uautomizer/witness.graphml [2019-10-22 08:56:07,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:07,678 INFO L168 Benchmark]: Toolchain (without parser) took 28060.91 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 944.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:07,679 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:07,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:07,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:07,680 INFO L168 Benchmark]: Boogie Preprocessor took 47.16 ms. Allocated memory is still 1.2 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-10-22 08:56:07,680 INFO L168 Benchmark]: RCFGBuilder took 1024.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:07,680 INFO L168 Benchmark]: TraceAbstraction took 26425.67 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -953.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:07,681 INFO L168 Benchmark]: Witness Printer took 180.19 ms. Allocated memory is still 4.7 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:07,682 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.16 ms. Allocated memory is still 1.2 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. * RCFGBuilder took 1024.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26425.67 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -953.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 180.19 ms. Allocated memory is still 4.7 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 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 m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L725] int __retres1 ; [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] t3_i = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L294] COND TRUE m_i == 1 [L295] m_st = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L309] COND TRUE t3_i == 1 [L310] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L431] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L436] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L441] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L446] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L451] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L456] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L461] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L466] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=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, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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, token=0] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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, token=0] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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, token=0] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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, token=0] [L479] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L484] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L489] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L494] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L499] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L504] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L509] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L514] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, token=0] [L680] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L683] kernel_st = 1 [L350] int tmp ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L102] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L138] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L174] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, token=0] [L57] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, token=0] [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L210] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L220] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L222] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L226] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L229] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L241] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L245] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L248] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L249] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L258] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L260] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L264] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L267] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L268] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L277] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L279] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L64] E_1 = 2 [L65] m_pc = 1 [L66] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L102] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L105] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-3] [L121] token += 1 [L122] E_2 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L220] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L222] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L226] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L239] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L241] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L245] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L260] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L264] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L277] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L279] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, token=-2] [L124] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L138] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L141] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-2] [L157] token += 1 [L158] E_3 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, token=-1] [L160] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L174] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L177] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=-1] [L193] token += 1 [L194] E_M = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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, token=0] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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, token=0] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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, token=0] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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, token=0] [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=1, token=0] [L196] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=1, token=0] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=1, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L49] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L71] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L82] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L84] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, token=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.3s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15598 SDtfs, 13593 SDslu, 11009 SDs, 0 SdLazy, 596 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40218occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 6602 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 4088 NumberOfCodeBlocks, 4088 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 504/504 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...