./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.05.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab3c8e786b7a020c9c7c3a4249de38e06543ca10 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-7b2dab5 [2020-12-09 05:35:48,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:35:48,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:35:48,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:35:48,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:35:48,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:35:48,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:35:48,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:35:48,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:35:48,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:35:48,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:35:48,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:35:48,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:35:48,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:35:48,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:35:48,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:35:48,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:35:48,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:35:48,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:35:48,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:35:48,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:35:48,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:35:48,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:35:48,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:35:48,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:35:48,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:35:48,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:35:48,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:35:48,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:35:48,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:35:48,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:35:48,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:35:48,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:35:48,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:35:48,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:35:48,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:35:48,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:35:48,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:35:48,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:35:48,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:35:48,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:35:48,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:35:48,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:35:48,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:35:48,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:35:48,790 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:35:48,790 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:35:48,790 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:35:48,790 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:35:48,790 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:35:48,791 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:35:48,791 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:35:48,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:35:48,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:35:48,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:35:48,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:35:48,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:35:48,794 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ab3c8e786b7a020c9c7c3a4249de38e06543ca10 [2020-12-09 05:35:48,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:35:48,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:35:48,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:35:48,991 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:35:48,992 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:35:48,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.05.cil.c [2020-12-09 05:35:49,034 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/data/41ece907b/02384c8474504e27bd5277c3dde9aa7b/FLAGb8261b292 [2020-12-09 05:35:49,407 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:35:49,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/sv-benchmarks/c/systemc/transmitter.05.cil.c [2020-12-09 05:35:49,416 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/data/41ece907b/02384c8474504e27bd5277c3dde9aa7b/FLAGb8261b292 [2020-12-09 05:35:49,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/data/41ece907b/02384c8474504e27bd5277c3dde9aa7b [2020-12-09 05:35:49,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:35:49,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:35:49,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:35:49,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:35:49,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:35:49,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7456b49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49, skipping insertion in model container [2020-12-09 05:35:49,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:35:49,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:35:49,569 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/sv-benchmarks/c/systemc/transmitter.05.cil.c[401,414] [2020-12-09 05:35:49,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:35:49,628 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:35:49,635 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/sv-benchmarks/c/systemc/transmitter.05.cil.c[401,414] [2020-12-09 05:35:49,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:35:49,679 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:35:49,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49 WrapperNode [2020-12-09 05:35:49,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:35:49,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:35:49,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:35:49,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:35:49,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:35:49,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:35:49,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:35:49,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:35:49,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... [2020-12-09 05:35:49,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:35:49,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:35:49,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:35:49,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:35:49,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/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 [2020-12-09 05:35:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:35:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:35:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:35:49,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:35:51,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:35:51,609 INFO L299 CfgBuilder]: Removed 181 assume(true) statements. [2020-12-09 05:35:51,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:35:51 BoogieIcfgContainer [2020-12-09 05:35:51,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:35:51,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:35:51,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:35:51,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:35:51,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:35:49" (1/3) ... [2020-12-09 05:35:51,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692b316a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:35:51, skipping insertion in model container [2020-12-09 05:35:51,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:35:49" (2/3) ... [2020-12-09 05:35:51,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692b316a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:35:51, skipping insertion in model container [2020-12-09 05:35:51,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:35:51" (3/3) ... [2020-12-09 05:35:51,618 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2020-12-09 05:35:51,628 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:35:51,631 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 05:35:51,639 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 05:35:51,657 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:35:51,658 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:35:51,658 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:35:51,658 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:35:51,658 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:35:51,658 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:35:51,658 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:35:51,658 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:35:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2020-12-09 05:35:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 05:35:51,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:51,678 INFO L422 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] [2020-12-09 05:35:51,678 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash -198780258, now seen corresponding path program 1 times [2020-12-09 05:35:51,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:51,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329397883] [2020-12-09 05:35:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:35:51,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329397883] [2020-12-09 05:35:51,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:51,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:35:51,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947876213] [2020-12-09 05:35:51,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:51,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:51,842 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2020-12-09 05:35:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:51,930 INFO L93 Difference]: Finished difference Result 669 states and 1025 transitions. [2020-12-09 05:35:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:51,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-12-09 05:35:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:51,944 INFO L225 Difference]: With dead ends: 669 [2020-12-09 05:35:51,944 INFO L226 Difference]: Without dead ends: 432 [2020-12-09 05:35:51,947 INFO L677 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 [2020-12-09 05:35:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-09 05:35:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2020-12-09 05:35:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-12-09 05:35:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2020-12-09 05:35:52,009 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 32 [2020-12-09 05:35:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:52,009 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2020-12-09 05:35:52,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2020-12-09 05:35:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 05:35:52,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:52,011 INFO L422 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] [2020-12-09 05:35:52,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:35:52,012 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1970251233, now seen corresponding path program 1 times [2020-12-09 05:35:52,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:52,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253421434] [2020-12-09 05:35:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:35:52,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253421434] [2020-12-09 05:35:52,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:52,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:35:52,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246394958] [2020-12-09 05:35:52,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:52,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:52,062 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 3 states. [2020-12-09 05:35:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:52,121 INFO L93 Difference]: Finished difference Result 1133 states and 1697 transitions. [2020-12-09 05:35:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:52,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-12-09 05:35:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:52,126 INFO L225 Difference]: With dead ends: 1133 [2020-12-09 05:35:52,126 INFO L226 Difference]: Without dead ends: 731 [2020-12-09 05:35:52,129 INFO L677 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 [2020-12-09 05:35:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2020-12-09 05:35:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 727. [2020-12-09 05:35:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-12-09 05:35:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1076 transitions. [2020-12-09 05:35:52,167 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1076 transitions. Word has length 32 [2020-12-09 05:35:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:52,167 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 1076 transitions. [2020-12-09 05:35:52,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1076 transitions. [2020-12-09 05:35:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 05:35:52,169 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:52,169 INFO L422 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] [2020-12-09 05:35:52,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:35:52,169 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2016277054, now seen corresponding path program 1 times [2020-12-09 05:35:52,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:52,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155743561] [2020-12-09 05:35:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:35:52,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155743561] [2020-12-09 05:35:52,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:52,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:52,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058608819] [2020-12-09 05:35:52,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:35:52,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:35:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:52,228 INFO L87 Difference]: Start difference. First operand 727 states and 1076 transitions. Second operand 4 states. [2020-12-09 05:35:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:52,352 INFO L93 Difference]: Finished difference Result 2385 states and 3511 transitions. [2020-12-09 05:35:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:35:52,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 05:35:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:52,359 INFO L225 Difference]: With dead ends: 2385 [2020-12-09 05:35:52,360 INFO L226 Difference]: Without dead ends: 1670 [2020-12-09 05:35:52,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2020-12-09 05:35:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1312. [2020-12-09 05:35:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2020-12-09 05:35:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1917 transitions. [2020-12-09 05:35:52,403 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1917 transitions. Word has length 32 [2020-12-09 05:35:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:52,403 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1917 transitions. [2020-12-09 05:35:52,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:35:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1917 transitions. [2020-12-09 05:35:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 05:35:52,404 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:52,404 INFO L422 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] [2020-12-09 05:35:52,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:35:52,405 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1902890397, now seen corresponding path program 1 times [2020-12-09 05:35:52,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:52,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141345531] [2020-12-09 05:35:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:35:52,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141345531] [2020-12-09 05:35:52,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:52,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:52,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815931652] [2020-12-09 05:35:52,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:35:52,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:52,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:35:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:52,464 INFO L87 Difference]: Start difference. First operand 1312 states and 1917 transitions. Second operand 4 states. [2020-12-09 05:35:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:52,662 INFO L93 Difference]: Finished difference Result 4490 states and 6514 transitions. [2020-12-09 05:35:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:35:52,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 05:35:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:52,676 INFO L225 Difference]: With dead ends: 4490 [2020-12-09 05:35:52,676 INFO L226 Difference]: Without dead ends: 3197 [2020-12-09 05:35:52,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2020-12-09 05:35:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2547. [2020-12-09 05:35:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2547 states. [2020-12-09 05:35:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3654 transitions. [2020-12-09 05:35:52,747 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3654 transitions. Word has length 32 [2020-12-09 05:35:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:52,747 INFO L481 AbstractCegarLoop]: Abstraction has 2547 states and 3654 transitions. [2020-12-09 05:35:52,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:35:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3654 transitions. [2020-12-09 05:35:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 05:35:52,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:52,751 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:52,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:35:52,751 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 452277091, now seen corresponding path program 1 times [2020-12-09 05:35:52,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:52,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092422559] [2020-12-09 05:35:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 05:35:52,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092422559] [2020-12-09 05:35:52,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:52,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:52,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048678228] [2020-12-09 05:35:52,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:35:52,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:35:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:52,835 INFO L87 Difference]: Start difference. First operand 2547 states and 3654 transitions. Second operand 4 states. [2020-12-09 05:35:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:53,043 INFO L93 Difference]: Finished difference Result 7293 states and 10501 transitions. [2020-12-09 05:35:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:35:53,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-12-09 05:35:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:53,062 INFO L225 Difference]: With dead ends: 7293 [2020-12-09 05:35:53,062 INFO L226 Difference]: Without dead ends: 4767 [2020-12-09 05:35:53,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4767 states. [2020-12-09 05:35:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4767 to 3711. [2020-12-09 05:35:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2020-12-09 05:35:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5338 transitions. [2020-12-09 05:35:53,202 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5338 transitions. Word has length 43 [2020-12-09 05:35:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:53,202 INFO L481 AbstractCegarLoop]: Abstraction has 3711 states and 5338 transitions. [2020-12-09 05:35:53,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:35:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5338 transitions. [2020-12-09 05:35:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 05:35:53,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:53,204 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:53,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:35:53,204 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1403292381, now seen corresponding path program 1 times [2020-12-09 05:35:53,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:53,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522185982] [2020-12-09 05:35:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:35:53,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522185982] [2020-12-09 05:35:53,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:53,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:53,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601947509] [2020-12-09 05:35:53,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:35:53,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:35:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:53,247 INFO L87 Difference]: Start difference. First operand 3711 states and 5338 transitions. Second operand 4 states. [2020-12-09 05:35:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:53,562 INFO L93 Difference]: Finished difference Result 13128 states and 18950 transitions. [2020-12-09 05:35:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:35:53,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-09 05:35:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:53,601 INFO L225 Difference]: With dead ends: 13128 [2020-12-09 05:35:53,601 INFO L226 Difference]: Without dead ends: 9438 [2020-12-09 05:35:53,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9438 states. [2020-12-09 05:35:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9438 to 7043. [2020-12-09 05:35:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7043 states. [2020-12-09 05:35:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 10098 transitions. [2020-12-09 05:35:53,826 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 10098 transitions. Word has length 45 [2020-12-09 05:35:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:53,827 INFO L481 AbstractCegarLoop]: Abstraction has 7043 states and 10098 transitions. [2020-12-09 05:35:53,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:35:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 10098 transitions. [2020-12-09 05:35:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 05:35:53,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:53,828 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:53,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:35:53,829 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash -703285853, now seen corresponding path program 1 times [2020-12-09 05:35:53,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:53,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690989815] [2020-12-09 05:35:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 05:35:53,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690989815] [2020-12-09 05:35:53,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:53,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:53,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824432300] [2020-12-09 05:35:53,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:35:53,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:35:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:53,870 INFO L87 Difference]: Start difference. First operand 7043 states and 10098 transitions. Second operand 4 states. [2020-12-09 05:35:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:54,252 INFO L93 Difference]: Finished difference Result 25061 states and 35837 transitions. [2020-12-09 05:35:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:35:54,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-12-09 05:35:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:54,291 INFO L225 Difference]: With dead ends: 25061 [2020-12-09 05:35:54,291 INFO L226 Difference]: Without dead ends: 18039 [2020-12-09 05:35:54,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:35:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18039 states. [2020-12-09 05:35:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18039 to 12807. [2020-12-09 05:35:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12807 states. [2020-12-09 05:35:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12807 states to 12807 states and 18322 transitions. [2020-12-09 05:35:54,700 INFO L78 Accepts]: Start accepts. Automaton has 12807 states and 18322 transitions. Word has length 47 [2020-12-09 05:35:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:54,701 INFO L481 AbstractCegarLoop]: Abstraction has 12807 states and 18322 transitions. [2020-12-09 05:35:54,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:35:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12807 states and 18322 transitions. [2020-12-09 05:35:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 05:35:54,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:54,703 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:54,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:35:54,704 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 942107353, now seen corresponding path program 1 times [2020-12-09 05:35:54,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:54,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375542456] [2020-12-09 05:35:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 05:35:54,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375542456] [2020-12-09 05:35:54,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:54,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:35:54,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439535041] [2020-12-09 05:35:54,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:54,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:54,738 INFO L87 Difference]: Start difference. First operand 12807 states and 18322 transitions. Second operand 3 states. [2020-12-09 05:35:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:55,217 INFO L93 Difference]: Finished difference Result 35867 states and 51316 transitions. [2020-12-09 05:35:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:55,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-12-09 05:35:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:55,249 INFO L225 Difference]: With dead ends: 35867 [2020-12-09 05:35:55,249 INFO L226 Difference]: Without dead ends: 23081 [2020-12-09 05:35:55,266 INFO L677 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 [2020-12-09 05:35:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23081 states. [2020-12-09 05:35:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23081 to 23079. [2020-12-09 05:35:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23079 states. [2020-12-09 05:35:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23079 states to 23079 states and 32922 transitions. [2020-12-09 05:35:55,762 INFO L78 Accepts]: Start accepts. Automaton has 23079 states and 32922 transitions. Word has length 49 [2020-12-09 05:35:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:55,762 INFO L481 AbstractCegarLoop]: Abstraction has 23079 states and 32922 transitions. [2020-12-09 05:35:55,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23079 states and 32922 transitions. [2020-12-09 05:35:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-09 05:35:55,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:55,767 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:55,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 05:35:55,767 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1980284195, now seen corresponding path program 1 times [2020-12-09 05:35:55,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:55,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90657639] [2020-12-09 05:35:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:35:55,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90657639] [2020-12-09 05:35:55,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:55,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:35:55,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699690934] [2020-12-09 05:35:55,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:55,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:55,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:55,799 INFO L87 Difference]: Start difference. First operand 23079 states and 32922 transitions. Second operand 3 states. [2020-12-09 05:35:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:56,470 INFO L93 Difference]: Finished difference Result 55557 states and 79319 transitions. [2020-12-09 05:35:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:56,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-09 05:35:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:56,502 INFO L225 Difference]: With dead ends: 55557 [2020-12-09 05:35:56,502 INFO L226 Difference]: Without dead ends: 32499 [2020-12-09 05:35:56,520 INFO L677 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 [2020-12-09 05:35:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32499 states. [2020-12-09 05:35:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32499 to 24863. [2020-12-09 05:35:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24863 states. [2020-12-09 05:35:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24863 states to 24863 states and 35834 transitions. [2020-12-09 05:35:57,097 INFO L78 Accepts]: Start accepts. Automaton has 24863 states and 35834 transitions. Word has length 51 [2020-12-09 05:35:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:57,098 INFO L481 AbstractCegarLoop]: Abstraction has 24863 states and 35834 transitions. [2020-12-09 05:35:57,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24863 states and 35834 transitions. [2020-12-09 05:35:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 05:35:57,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:57,118 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:57,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 05:35:57,118 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1990477113, now seen corresponding path program 1 times [2020-12-09 05:35:57,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:57,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343184668] [2020-12-09 05:35:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 05:35:57,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343184668] [2020-12-09 05:35:57,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:57,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:35:57,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594291768] [2020-12-09 05:35:57,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:57,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:57,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:57,155 INFO L87 Difference]: Start difference. First operand 24863 states and 35834 transitions. Second operand 3 states. [2020-12-09 05:35:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:58,014 INFO L93 Difference]: Finished difference Result 60875 states and 87554 transitions. [2020-12-09 05:35:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:58,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-09 05:35:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:58,045 INFO L225 Difference]: With dead ends: 60875 [2020-12-09 05:35:58,045 INFO L226 Difference]: Without dead ends: 36020 [2020-12-09 05:35:58,060 INFO L677 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 [2020-12-09 05:35:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36020 states. [2020-12-09 05:35:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36020 to 35874. [2020-12-09 05:35:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35874 states. [2020-12-09 05:35:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35874 states to 35874 states and 51095 transitions. [2020-12-09 05:35:58,902 INFO L78 Accepts]: Start accepts. Automaton has 35874 states and 51095 transitions. Word has length 72 [2020-12-09 05:35:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:58,903 INFO L481 AbstractCegarLoop]: Abstraction has 35874 states and 51095 transitions. [2020-12-09 05:35:58,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 35874 states and 51095 transitions. [2020-12-09 05:35:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 05:35:58,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:58,923 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:35:58,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 05:35:58,923 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -606442133, now seen corresponding path program 1 times [2020-12-09 05:35:58,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:58,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112316459] [2020-12-09 05:35:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 05:35:58,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112316459] [2020-12-09 05:35:58,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:35:58,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:35:58,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274014476] [2020-12-09 05:35:58,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:58,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:35:58,957 INFO L87 Difference]: Start difference. First operand 35874 states and 51095 transitions. Second operand 3 states. [2020-12-09 05:35:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:59,939 INFO L93 Difference]: Finished difference Result 87813 states and 124818 transitions. [2020-12-09 05:35:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:59,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-09 05:35:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:59,989 INFO L225 Difference]: With dead ends: 87813 [2020-12-09 05:35:59,989 INFO L226 Difference]: Without dead ends: 51953 [2020-12-09 05:36:00,014 INFO L677 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 [2020-12-09 05:36:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51953 states. [2020-12-09 05:36:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51953 to 51735. [2020-12-09 05:36:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51735 states. [2020-12-09 05:36:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51735 states to 51735 states and 72812 transitions. [2020-12-09 05:36:01,615 INFO L78 Accepts]: Start accepts. Automaton has 51735 states and 72812 transitions. Word has length 72 [2020-12-09 05:36:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:01,616 INFO L481 AbstractCegarLoop]: Abstraction has 51735 states and 72812 transitions. [2020-12-09 05:36:01,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51735 states and 72812 transitions. [2020-12-09 05:36:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-09 05:36:01,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:01,644 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:36:01,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 05:36:01,644 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2115570027, now seen corresponding path program 1 times [2020-12-09 05:36:01,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:01,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441578321] [2020-12-09 05:36:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:01,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441578321] [2020-12-09 05:36:01,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:01,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:01,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523147172] [2020-12-09 05:36:01,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:01,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:01,671 INFO L87 Difference]: Start difference. First operand 51735 states and 72812 transitions. Second operand 3 states. [2020-12-09 05:36:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:03,211 INFO L93 Difference]: Finished difference Result 119437 states and 169960 transitions. [2020-12-09 05:36:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:03,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-09 05:36:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:03,274 INFO L225 Difference]: With dead ends: 119437 [2020-12-09 05:36:03,274 INFO L226 Difference]: Without dead ends: 67721 [2020-12-09 05:36:03,294 INFO L677 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 [2020-12-09 05:36:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67721 states. [2020-12-09 05:36:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67721 to 63669. [2020-12-09 05:36:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63669 states. [2020-12-09 05:36:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63669 states to 63669 states and 91496 transitions. [2020-12-09 05:36:04,919 INFO L78 Accepts]: Start accepts. Automaton has 63669 states and 91496 transitions. Word has length 73 [2020-12-09 05:36:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:04,920 INFO L481 AbstractCegarLoop]: Abstraction has 63669 states and 91496 transitions. [2020-12-09 05:36:04,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 63669 states and 91496 transitions. [2020-12-09 05:36:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 05:36:04,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:04,945 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:36:04,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 05:36:04,945 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash 261316187, now seen corresponding path program 1 times [2020-12-09 05:36:04,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:04,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229462065] [2020-12-09 05:36:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:04,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229462065] [2020-12-09 05:36:04,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:04,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:04,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462160155] [2020-12-09 05:36:04,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:04,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:04,977 INFO L87 Difference]: Start difference. First operand 63669 states and 91496 transitions. Second operand 3 states. [2020-12-09 05:36:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:06,763 INFO L93 Difference]: Finished difference Result 119483 states and 173644 transitions. [2020-12-09 05:36:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:06,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-09 05:36:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:06,848 INFO L225 Difference]: With dead ends: 119483 [2020-12-09 05:36:06,848 INFO L226 Difference]: Without dead ends: 75673 [2020-12-09 05:36:06,881 INFO L677 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 [2020-12-09 05:36:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75673 states. [2020-12-09 05:36:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75673 to 71301. [2020-12-09 05:36:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71301 states. [2020-12-09 05:36:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71301 states to 71301 states and 103556 transitions. [2020-12-09 05:36:09,397 INFO L78 Accepts]: Start accepts. Automaton has 71301 states and 103556 transitions. Word has length 74 [2020-12-09 05:36:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:09,397 INFO L481 AbstractCegarLoop]: Abstraction has 71301 states and 103556 transitions. [2020-12-09 05:36:09,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 71301 states and 103556 transitions. [2020-12-09 05:36:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 05:36:09,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:09,414 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:36:09,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 05:36:09,415 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 261742169, now seen corresponding path program 1 times [2020-12-09 05:36:09,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:09,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545724632] [2020-12-09 05:36:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:09,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545724632] [2020-12-09 05:36:09,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:09,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:09,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665005222] [2020-12-09 05:36:09,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:09,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:09,442 INFO L87 Difference]: Start difference. First operand 71301 states and 103556 transitions. Second operand 3 states. [2020-12-09 05:36:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:11,282 INFO L93 Difference]: Finished difference Result 155029 states and 225814 transitions. [2020-12-09 05:36:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:11,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-09 05:36:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:11,379 INFO L225 Difference]: With dead ends: 155029 [2020-12-09 05:36:11,379 INFO L226 Difference]: Without dead ends: 83747 [2020-12-09 05:36:11,429 INFO L677 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 [2020-12-09 05:36:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83747 states. [2020-12-09 05:36:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83747 to 78825. [2020-12-09 05:36:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78825 states. [2020-12-09 05:36:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78825 states to 78825 states and 115292 transitions. [2020-12-09 05:36:13,618 INFO L78 Accepts]: Start accepts. Automaton has 78825 states and 115292 transitions. Word has length 74 [2020-12-09 05:36:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:13,618 INFO L481 AbstractCegarLoop]: Abstraction has 78825 states and 115292 transitions. [2020-12-09 05:36:13,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78825 states and 115292 transitions. [2020-12-09 05:36:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 05:36:13,635 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:13,635 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:36:13,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 05:36:13,636 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash -374573886, now seen corresponding path program 1 times [2020-12-09 05:36:13,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:13,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131755059] [2020-12-09 05:36:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:13,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131755059] [2020-12-09 05:36:13,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:13,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:13,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847129202] [2020-12-09 05:36:13,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:13,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:13,663 INFO L87 Difference]: Start difference. First operand 78825 states and 115292 transitions. Second operand 3 states. [2020-12-09 05:36:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:15,840 INFO L93 Difference]: Finished difference Result 151747 states and 224068 transitions. [2020-12-09 05:36:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:15,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-09 05:36:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:15,953 INFO L225 Difference]: With dead ends: 151747 [2020-12-09 05:36:15,953 INFO L226 Difference]: Without dead ends: 97833 [2020-12-09 05:36:15,996 INFO L677 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 [2020-12-09 05:36:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97833 states. [2020-12-09 05:36:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97833 to 90933. [2020-12-09 05:36:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90933 states. [2020-12-09 05:36:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90933 states to 90933 states and 134228 transitions. [2020-12-09 05:36:18,844 INFO L78 Accepts]: Start accepts. Automaton has 90933 states and 134228 transitions. Word has length 74 [2020-12-09 05:36:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:18,845 INFO L481 AbstractCegarLoop]: Abstraction has 90933 states and 134228 transitions. [2020-12-09 05:36:18,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 90933 states and 134228 transitions. [2020-12-09 05:36:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 05:36:18,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:18,864 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:36:18,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 05:36:18,864 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash -289942500, now seen corresponding path program 1 times [2020-12-09 05:36:18,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:18,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802693524] [2020-12-09 05:36:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:18,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802693524] [2020-12-09 05:36:18,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:18,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:18,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559338878] [2020-12-09 05:36:18,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:18,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:18,896 INFO L87 Difference]: Start difference. First operand 90933 states and 134228 transitions. Second operand 3 states. [2020-12-09 05:36:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:21,596 INFO L93 Difference]: Finished difference Result 170703 states and 254344 transitions. [2020-12-09 05:36:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:21,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-09 05:36:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:21,728 INFO L225 Difference]: With dead ends: 170703 [2020-12-09 05:36:21,728 INFO L226 Difference]: Without dead ends: 109357 [2020-12-09 05:36:21,773 INFO L677 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 [2020-12-09 05:36:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109357 states. [2020-12-09 05:36:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109357 to 106277. [2020-12-09 05:36:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106277 states. [2020-12-09 05:36:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106277 states to 106277 states and 157956 transitions. [2020-12-09 05:36:24,779 INFO L78 Accepts]: Start accepts. Automaton has 106277 states and 157956 transitions. Word has length 74 [2020-12-09 05:36:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:24,779 INFO L481 AbstractCegarLoop]: Abstraction has 106277 states and 157956 transitions. [2020-12-09 05:36:24,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 106277 states and 157956 transitions. [2020-12-09 05:36:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 05:36:24,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:24,793 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:36:24,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 05:36:24,793 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -880292368, now seen corresponding path program 1 times [2020-12-09 05:36:24,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:24,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547044288] [2020-12-09 05:36:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:36:24,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547044288] [2020-12-09 05:36:24,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:24,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:24,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019614271] [2020-12-09 05:36:24,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:36:24,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:36:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:36:24,842 INFO L87 Difference]: Start difference. First operand 106277 states and 157956 transitions. Second operand 4 states. [2020-12-09 05:36:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:28,479 INFO L93 Difference]: Finished difference Result 243709 states and 362420 transitions. [2020-12-09 05:36:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:36:28,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-09 05:36:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:28,648 INFO L225 Difference]: With dead ends: 243709 [2020-12-09 05:36:28,648 INFO L226 Difference]: Without dead ends: 137451 [2020-12-09 05:36:28,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:36:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137451 states. [2020-12-09 05:36:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137451 to 131014. [2020-12-09 05:36:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131014 states. [2020-12-09 05:36:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131014 states to 131014 states and 194739 transitions. [2020-12-09 05:36:32,663 INFO L78 Accepts]: Start accepts. Automaton has 131014 states and 194739 transitions. Word has length 74 [2020-12-09 05:36:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:32,663 INFO L481 AbstractCegarLoop]: Abstraction has 131014 states and 194739 transitions. [2020-12-09 05:36:32,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:36:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131014 states and 194739 transitions. [2020-12-09 05:36:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-09 05:36:32,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:32,679 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:36:32,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 05:36:32,680 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1444641905, now seen corresponding path program 1 times [2020-12-09 05:36:32,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:32,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236863020] [2020-12-09 05:36:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:32,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236863020] [2020-12-09 05:36:32,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:32,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:36:32,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99259073] [2020-12-09 05:36:32,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:36:32,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:36:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:36:32,725 INFO L87 Difference]: Start difference. First operand 131014 states and 194739 transitions. Second operand 4 states. [2020-12-09 05:36:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:38,950 INFO L93 Difference]: Finished difference Result 360295 states and 529679 transitions. [2020-12-09 05:36:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:36:38,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-09 05:36:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:39,174 INFO L225 Difference]: With dead ends: 360295 [2020-12-09 05:36:39,174 INFO L226 Difference]: Without dead ends: 183357 [2020-12-09 05:36:39,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:36:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183357 states. [2020-12-09 05:36:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183357 to 144211. [2020-12-09 05:36:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144211 states. [2020-12-09 05:36:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144211 states to 144211 states and 209384 transitions. [2020-12-09 05:36:44,009 INFO L78 Accepts]: Start accepts. Automaton has 144211 states and 209384 transitions. Word has length 75 [2020-12-09 05:36:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:44,009 INFO L481 AbstractCegarLoop]: Abstraction has 144211 states and 209384 transitions. [2020-12-09 05:36:44,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:36:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 144211 states and 209384 transitions. [2020-12-09 05:36:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-09 05:36:44,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:44,033 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:36:44,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 05:36:44,033 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash -889688266, now seen corresponding path program 1 times [2020-12-09 05:36:44,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:44,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155984526] [2020-12-09 05:36:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:44,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155984526] [2020-12-09 05:36:44,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196594714] [2020-12-09 05:36:44,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:36:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:44,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 05:36:44,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:36:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 05:36:44,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:36:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 05:36:44,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:36:44,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2020-12-09 05:36:44,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553188443] [2020-12-09 05:36:44,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:44,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:36:44,310 INFO L87 Difference]: Start difference. First operand 144211 states and 209384 transitions. Second operand 3 states. [2020-12-09 05:36:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:48,739 INFO L93 Difference]: Finished difference Result 305531 states and 441126 transitions. [2020-12-09 05:36:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:48,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-09 05:36:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:48,992 INFO L225 Difference]: With dead ends: 305531 [2020-12-09 05:36:48,992 INFO L226 Difference]: Without dead ends: 164544 [2020-12-09 05:36:49,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:36:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164544 states. [2020-12-09 05:36:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164544 to 164542. [2020-12-09 05:36:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164542 states. [2020-12-09 05:36:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164542 states to 164542 states and 234129 transitions. [2020-12-09 05:36:53,908 INFO L78 Accepts]: Start accepts. Automaton has 164542 states and 234129 transitions. Word has length 76 [2020-12-09 05:36:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:53,908 INFO L481 AbstractCegarLoop]: Abstraction has 164542 states and 234129 transitions. [2020-12-09 05:36:53,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 164542 states and 234129 transitions. [2020-12-09 05:36:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-09 05:36:53,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:53,954 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:36:54,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:36:54,156 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2067568306, now seen corresponding path program 1 times [2020-12-09 05:36:54,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:54,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730004746] [2020-12-09 05:36:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:36:54,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730004746] [2020-12-09 05:36:54,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:54,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:36:54,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032982973] [2020-12-09 05:36:54,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:36:54,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:36:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:36:54,218 INFO L87 Difference]: Start difference. First operand 164542 states and 234129 transitions. Second operand 4 states. [2020-12-09 05:36:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:59,385 INFO L93 Difference]: Finished difference Result 331524 states and 476995 transitions. [2020-12-09 05:36:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:36:59,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-09 05:36:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:59,620 INFO L225 Difference]: With dead ends: 331524 [2020-12-09 05:36:59,621 INFO L226 Difference]: Without dead ends: 188885 [2020-12-09 05:36:59,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:36:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188885 states. [2020-12-09 05:37:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188885 to 107401. [2020-12-09 05:37:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107401 states. [2020-12-09 05:37:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107401 states to 107401 states and 154579 transitions. [2020-12-09 05:37:03,616 INFO L78 Accepts]: Start accepts. Automaton has 107401 states and 154579 transitions. Word has length 78 [2020-12-09 05:37:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:03,617 INFO L481 AbstractCegarLoop]: Abstraction has 107401 states and 154579 transitions. [2020-12-09 05:37:03,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:37:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 107401 states and 154579 transitions. [2020-12-09 05:37:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:37:03,654 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:03,654 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:37:03,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 05:37:03,655 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1859665560, now seen corresponding path program 1 times [2020-12-09 05:37:03,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:03,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932645869] [2020-12-09 05:37:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:37:03,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932645869] [2020-12-09 05:37:03,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:03,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:37:03,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796828345] [2020-12-09 05:37:03,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:37:03,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:37:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:37:03,693 INFO L87 Difference]: Start difference. First operand 107401 states and 154579 transitions. Second operand 3 states. [2020-12-09 05:37:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:06,982 INFO L93 Difference]: Finished difference Result 185007 states and 267730 transitions. [2020-12-09 05:37:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:37:06,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-09 05:37:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:37:07,106 INFO L225 Difference]: With dead ends: 185007 [2020-12-09 05:37:07,107 INFO L226 Difference]: Without dead ends: 107511 [2020-12-09 05:37:07,150 INFO L677 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 [2020-12-09 05:37:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107511 states. [2020-12-09 05:37:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107511 to 106141. [2020-12-09 05:37:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106141 states. [2020-12-09 05:37:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106141 states to 106141 states and 150163 transitions. [2020-12-09 05:37:11,007 INFO L78 Accepts]: Start accepts. Automaton has 106141 states and 150163 transitions. Word has length 98 [2020-12-09 05:37:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:11,008 INFO L481 AbstractCegarLoop]: Abstraction has 106141 states and 150163 transitions. [2020-12-09 05:37:11,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:37:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 106141 states and 150163 transitions. [2020-12-09 05:37:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:37:11,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:11,045 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:37:11,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 05:37:11,045 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -571471031, now seen corresponding path program 1 times [2020-12-09 05:37:11,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:11,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819244311] [2020-12-09 05:37:11,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 05:37:11,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819244311] [2020-12-09 05:37:11,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:11,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:37:11,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983138669] [2020-12-09 05:37:11,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:37:11,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:37:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:37:11,105 INFO L87 Difference]: Start difference. First operand 106141 states and 150163 transitions. Second operand 4 states. [2020-12-09 05:37:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:16,310 INFO L93 Difference]: Finished difference Result 261520 states and 368703 transitions. [2020-12-09 05:37:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:37:16,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-09 05:37:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:37:16,485 INFO L225 Difference]: With dead ends: 261520 [2020-12-09 05:37:16,485 INFO L226 Difference]: Without dead ends: 156007 [2020-12-09 05:37:16,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:37:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156007 states. [2020-12-09 05:37:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156007 to 126232. [2020-12-09 05:37:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126232 states. [2020-12-09 05:37:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126232 states to 126232 states and 177346 transitions. [2020-12-09 05:37:21,315 INFO L78 Accepts]: Start accepts. Automaton has 126232 states and 177346 transitions. Word has length 98 [2020-12-09 05:37:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:21,315 INFO L481 AbstractCegarLoop]: Abstraction has 126232 states and 177346 transitions. [2020-12-09 05:37:21,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:37:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 126232 states and 177346 transitions. [2020-12-09 05:37:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:37:21,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:21,351 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:37:21,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-09 05:37:21,351 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2133101288, now seen corresponding path program 1 times [2020-12-09 05:37:21,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:21,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068086913] [2020-12-09 05:37:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:37:21,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068086913] [2020-12-09 05:37:21,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:21,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:37:21,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658945641] [2020-12-09 05:37:21,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:37:21,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:37:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:37:21,382 INFO L87 Difference]: Start difference. First operand 126232 states and 177346 transitions. Second operand 3 states. [2020-12-09 05:37:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:25,514 INFO L93 Difference]: Finished difference Result 236709 states and 334659 transitions. [2020-12-09 05:37:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:37:25,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-09 05:37:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:37:25,654 INFO L225 Difference]: With dead ends: 236709 [2020-12-09 05:37:25,654 INFO L226 Difference]: Without dead ends: 111105 [2020-12-09 05:37:25,733 INFO L677 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 [2020-12-09 05:37:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111105 states. [2020-12-09 05:37:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111105 to 107650. [2020-12-09 05:37:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107650 states. [2020-12-09 05:37:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107650 states to 107650 states and 148741 transitions. [2020-12-09 05:37:30,078 INFO L78 Accepts]: Start accepts. Automaton has 107650 states and 148741 transitions. Word has length 98 [2020-12-09 05:37:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:30,078 INFO L481 AbstractCegarLoop]: Abstraction has 107650 states and 148741 transitions. [2020-12-09 05:37:30,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:37:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 107650 states and 148741 transitions. [2020-12-09 05:37:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-09 05:37:30,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:30,112 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:37:30,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-09 05:37:30,112 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1478851658, now seen corresponding path program 1 times [2020-12-09 05:37:30,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:30,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586800418] [2020-12-09 05:37:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:37:30,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586800418] [2020-12-09 05:37:30,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:30,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:37:30,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503605196] [2020-12-09 05:37:30,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:37:30,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:37:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:37:30,155 INFO L87 Difference]: Start difference. First operand 107650 states and 148741 transitions. Second operand 5 states. [2020-12-09 05:37:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:36,612 INFO L93 Difference]: Finished difference Result 252108 states and 346962 transitions. [2020-12-09 05:37:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:37:36,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-09 05:37:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:37:36,794 INFO L225 Difference]: With dead ends: 252108 [2020-12-09 05:37:36,794 INFO L226 Difference]: Without dead ends: 175564 [2020-12-09 05:37:36,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:37:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175564 states. [2020-12-09 05:37:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175564 to 124282. [2020-12-09 05:37:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124282 states. [2020-12-09 05:37:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124282 states to 124282 states and 169909 transitions. [2020-12-09 05:37:41,930 INFO L78 Accepts]: Start accepts. Automaton has 124282 states and 169909 transitions. Word has length 98 [2020-12-09 05:37:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:41,931 INFO L481 AbstractCegarLoop]: Abstraction has 124282 states and 169909 transitions. [2020-12-09 05:37:41,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:37:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124282 states and 169909 transitions. [2020-12-09 05:37:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-09 05:37:41,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:41,980 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:37:41,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-09 05:37:41,980 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -568403176, now seen corresponding path program 1 times [2020-12-09 05:37:41,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:41,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897609696] [2020-12-09 05:37:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:37:42,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897609696] [2020-12-09 05:37:42,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:42,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:37:42,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250479542] [2020-12-09 05:37:42,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:37:42,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:42,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:37:42,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:37:42,028 INFO L87 Difference]: Start difference. First operand 124282 states and 169909 transitions. Second operand 4 states. [2020-12-09 05:37:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:48,299 INFO L93 Difference]: Finished difference Result 241255 states and 330873 transitions. [2020-12-09 05:37:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:37:48,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-09 05:37:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:37:48,544 INFO L225 Difference]: With dead ends: 241255 [2020-12-09 05:37:48,544 INFO L226 Difference]: Without dead ends: 149713 [2020-12-09 05:37:48,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:37:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149713 states. [2020-12-09 05:37:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149713 to 124282. [2020-12-09 05:37:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124282 states. [2020-12-09 05:37:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124282 states to 124282 states and 168685 transitions. [2020-12-09 05:37:53,849 INFO L78 Accepts]: Start accepts. Automaton has 124282 states and 168685 transitions. Word has length 99 [2020-12-09 05:37:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:37:53,850 INFO L481 AbstractCegarLoop]: Abstraction has 124282 states and 168685 transitions. [2020-12-09 05:37:53,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:37:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 124282 states and 168685 transitions. [2020-12-09 05:37:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-09 05:37:53,902 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:37:53,902 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:37:53,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-09 05:37:53,903 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:37:53,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:37:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1222135007, now seen corresponding path program 1 times [2020-12-09 05:37:53,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:37:53,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446760337] [2020-12-09 05:37:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:37:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:37:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:37:53,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446760337] [2020-12-09 05:37:53,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:37:53,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:37:53,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150209650] [2020-12-09 05:37:53,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:37:53,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:37:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:37:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:37:53,943 INFO L87 Difference]: Start difference. First operand 124282 states and 168685 transitions. Second operand 4 states. [2020-12-09 05:37:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:37:59,925 INFO L93 Difference]: Finished difference Result 237651 states and 325344 transitions. [2020-12-09 05:37:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:37:59,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-09 05:37:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:00,085 INFO L225 Difference]: With dead ends: 237651 [2020-12-09 05:38:00,086 INFO L226 Difference]: Without dead ends: 144475 [2020-12-09 05:38:00,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:38:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144475 states. [2020-12-09 05:38:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144475 to 94975. [2020-12-09 05:38:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94975 states. [2020-12-09 05:38:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94975 states to 94975 states and 129853 transitions. [2020-12-09 05:38:04,624 INFO L78 Accepts]: Start accepts. Automaton has 94975 states and 129853 transitions. Word has length 99 [2020-12-09 05:38:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:04,624 INFO L481 AbstractCegarLoop]: Abstraction has 94975 states and 129853 transitions. [2020-12-09 05:38:04,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:38:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 94975 states and 129853 transitions. [2020-12-09 05:38:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-09 05:38:04,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:04,657 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:38:04,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-09 05:38:04,657 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash -309610494, now seen corresponding path program 1 times [2020-12-09 05:38:04,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:04,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611587909] [2020-12-09 05:38:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:38:04,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611587909] [2020-12-09 05:38:04,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:38:04,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:38:04,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168604848] [2020-12-09 05:38:04,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:38:04,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:38:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:38:04,696 INFO L87 Difference]: Start difference. First operand 94975 states and 129853 transitions. Second operand 4 states. [2020-12-09 05:38:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:38:12,199 INFO L93 Difference]: Finished difference Result 261598 states and 355195 transitions. [2020-12-09 05:38:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:38:12,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-09 05:38:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:12,398 INFO L225 Difference]: With dead ends: 261598 [2020-12-09 05:38:12,398 INFO L226 Difference]: Without dead ends: 180562 [2020-12-09 05:38:12,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:38:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180562 states. [2020-12-09 05:38:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180562 to 111620. [2020-12-09 05:38:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111620 states. [2020-12-09 05:38:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111620 states to 111620 states and 151328 transitions. [2020-12-09 05:38:18,009 INFO L78 Accepts]: Start accepts. Automaton has 111620 states and 151328 transitions. Word has length 100 [2020-12-09 05:38:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:18,009 INFO L481 AbstractCegarLoop]: Abstraction has 111620 states and 151328 transitions. [2020-12-09 05:38:18,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:38:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 111620 states and 151328 transitions. [2020-12-09 05:38:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-09 05:38:18,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:18,057 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:38:18,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 05:38:18,057 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 741838595, now seen corresponding path program 1 times [2020-12-09 05:38:18,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:18,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395362782] [2020-12-09 05:38:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:18,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395362782] [2020-12-09 05:38:18,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:38:18,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:38:18,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196261500] [2020-12-09 05:38:18,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:38:18,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:38:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:38:18,095 INFO L87 Difference]: Start difference. First operand 111620 states and 151328 transitions. Second operand 3 states. [2020-12-09 05:38:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:38:23,419 INFO L93 Difference]: Finished difference Result 209183 states and 284129 transitions. [2020-12-09 05:38:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:38:23,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-09 05:38:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:23,542 INFO L225 Difference]: With dead ends: 209183 [2020-12-09 05:38:23,542 INFO L226 Difference]: Without dead ends: 111486 [2020-12-09 05:38:23,592 INFO L677 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 [2020-12-09 05:38:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111486 states. [2020-12-09 05:38:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111486 to 110680. [2020-12-09 05:38:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110680 states. [2020-12-09 05:38:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110680 states to 110680 states and 147060 transitions. [2020-12-09 05:38:28,813 INFO L78 Accepts]: Start accepts. Automaton has 110680 states and 147060 transitions. Word has length 100 [2020-12-09 05:38:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:28,813 INFO L481 AbstractCegarLoop]: Abstraction has 110680 states and 147060 transitions. [2020-12-09 05:38:28,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:38:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 110680 states and 147060 transitions. [2020-12-09 05:38:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-09 05:38:28,851 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:28,851 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:38:28,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 05:38:28,851 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash 46052253, now seen corresponding path program 1 times [2020-12-09 05:38:28,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:28,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379086980] [2020-12-09 05:38:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:28,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379086980] [2020-12-09 05:38:28,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:38:28,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:38:28,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000035273] [2020-12-09 05:38:28,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:38:28,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:38:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:38:28,890 INFO L87 Difference]: Start difference. First operand 110680 states and 147060 transitions. Second operand 4 states. [2020-12-09 05:38:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:38:35,129 INFO L93 Difference]: Finished difference Result 220249 states and 292910 transitions. [2020-12-09 05:38:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:38:35,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-09 05:38:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:35,274 INFO L225 Difference]: With dead ends: 220249 [2020-12-09 05:38:35,274 INFO L226 Difference]: Without dead ends: 139384 [2020-12-09 05:38:35,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:38:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139384 states. [2020-12-09 05:38:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139384 to 119240. [2020-12-09 05:38:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119240 states. [2020-12-09 05:38:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119240 states to 119240 states and 157107 transitions. [2020-12-09 05:38:41,211 INFO L78 Accepts]: Start accepts. Automaton has 119240 states and 157107 transitions. Word has length 101 [2020-12-09 05:38:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:41,211 INFO L481 AbstractCegarLoop]: Abstraction has 119240 states and 157107 transitions. [2020-12-09 05:38:41,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:38:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 119240 states and 157107 transitions. [2020-12-09 05:38:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-09 05:38:41,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:41,244 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:38:41,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 05:38:41,245 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1092419655, now seen corresponding path program 1 times [2020-12-09 05:38:41,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:41,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517870785] [2020-12-09 05:38:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:41,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517870785] [2020-12-09 05:38:41,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:38:41,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:38:41,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873822620] [2020-12-09 05:38:41,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:38:41,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:38:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:38:41,286 INFO L87 Difference]: Start difference. First operand 119240 states and 157107 transitions. Second operand 3 states. [2020-12-09 05:38:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:38:46,500 INFO L93 Difference]: Finished difference Result 203251 states and 269076 transitions. [2020-12-09 05:38:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:38:46,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-09 05:38:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:46,614 INFO L225 Difference]: With dead ends: 203251 [2020-12-09 05:38:46,614 INFO L226 Difference]: Without dead ends: 98465 [2020-12-09 05:38:46,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:38:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98465 states. [2020-12-09 05:38:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98465 to 98465. [2020-12-09 05:38:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98465 states. [2020-12-09 05:38:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98465 states to 98465 states and 129278 transitions. [2020-12-09 05:38:51,905 INFO L78 Accepts]: Start accepts. Automaton has 98465 states and 129278 transitions. Word has length 101 [2020-12-09 05:38:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:51,905 INFO L481 AbstractCegarLoop]: Abstraction has 98465 states and 129278 transitions. [2020-12-09 05:38:51,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:38:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98465 states and 129278 transitions. [2020-12-09 05:38:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-09 05:38:51,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:51,931 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:38:51,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 05:38:51,931 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 186253695, now seen corresponding path program 1 times [2020-12-09 05:38:51,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:51,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669018412] [2020-12-09 05:38:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:51,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669018412] [2020-12-09 05:38:51,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735720404] [2020-12-09 05:38:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:38:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:52,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 05:38:52,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:38:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:52,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:38:52,241 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 05:38:52,242 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:38:52,243 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-12-09 05:38:52,243 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:38:52,244 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-12-09 05:38:52,245 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:38:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:38:52,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 05:38:52,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 12 [2020-12-09 05:38:52,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762547626] [2020-12-09 05:38:52,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:38:52,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:38:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:38:52,302 INFO L87 Difference]: Start difference. First operand 98465 states and 129278 transitions. Second operand 6 states. [2020-12-09 05:39:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:00,665 INFO L93 Difference]: Finished difference Result 210471 states and 278292 transitions. [2020-12-09 05:39:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:39:00,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2020-12-09 05:39:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:00,822 INFO L225 Difference]: With dead ends: 210471 [2020-12-09 05:39:00,823 INFO L226 Difference]: Without dead ends: 147365 [2020-12-09 05:39:00,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:39:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147365 states. [2020-12-09 05:39:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147365 to 119314. [2020-12-09 05:39:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119314 states. [2020-12-09 05:39:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119314 states to 119314 states and 156604 transitions. [2020-12-09 05:39:07,701 INFO L78 Accepts]: Start accepts. Automaton has 119314 states and 156604 transitions. Word has length 101 [2020-12-09 05:39:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:07,701 INFO L481 AbstractCegarLoop]: Abstraction has 119314 states and 156604 transitions. [2020-12-09 05:39:07,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:39:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 119314 states and 156604 transitions. [2020-12-09 05:39:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-09 05:39:07,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:07,725 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:39:07,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:39:07,926 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1341723612, now seen corresponding path program 1 times [2020-12-09 05:39:07,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:07,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517279991] [2020-12-09 05:39:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:07,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517279991] [2020-12-09 05:39:07,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:07,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:39:07,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554099651] [2020-12-09 05:39:07,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:39:07,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:39:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:39:07,964 INFO L87 Difference]: Start difference. First operand 119314 states and 156604 transitions. Second operand 3 states. [2020-12-09 05:39:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:14,612 INFO L93 Difference]: Finished difference Result 205516 states and 271200 transitions. [2020-12-09 05:39:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:39:14,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-09 05:39:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:14,736 INFO L225 Difference]: With dead ends: 205516 [2020-12-09 05:39:14,736 INFO L226 Difference]: Without dead ends: 119400 [2020-12-09 05:39:14,776 INFO L677 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 [2020-12-09 05:39:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119400 states. [2020-12-09 05:39:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119400 to 118380. [2020-12-09 05:39:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118380 states. [2020-12-09 05:39:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118380 states to 118380 states and 152806 transitions. [2020-12-09 05:39:21,436 INFO L78 Accepts]: Start accepts. Automaton has 118380 states and 152806 transitions. Word has length 102 [2020-12-09 05:39:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:21,436 INFO L481 AbstractCegarLoop]: Abstraction has 118380 states and 152806 transitions. [2020-12-09 05:39:21,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:39:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118380 states and 152806 transitions. [2020-12-09 05:39:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-09 05:39:21,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:21,459 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:39:21,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 05:39:21,459 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash 429747363, now seen corresponding path program 1 times [2020-12-09 05:39:21,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:21,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302982019] [2020-12-09 05:39:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:39:21,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302982019] [2020-12-09 05:39:21,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:21,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:39:21,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606030327] [2020-12-09 05:39:21,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:39:21,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:39:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:39:21,499 INFO L87 Difference]: Start difference. First operand 118380 states and 152806 transitions. Second operand 4 states. [2020-12-09 05:39:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:32,278 INFO L93 Difference]: Finished difference Result 277911 states and 356755 transitions. [2020-12-09 05:39:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:39:32,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-09 05:39:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:32,501 INFO L225 Difference]: With dead ends: 277911 [2020-12-09 05:39:32,501 INFO L226 Difference]: Without dead ends: 198113 [2020-12-09 05:39:32,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:39:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198113 states. [2020-12-09 05:39:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198113 to 119154. [2020-12-09 05:39:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119154 states. [2020-12-09 05:39:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119154 states to 119154 states and 153682 transitions. [2020-12-09 05:39:40,210 INFO L78 Accepts]: Start accepts. Automaton has 119154 states and 153682 transitions. Word has length 102 [2020-12-09 05:39:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:40,210 INFO L481 AbstractCegarLoop]: Abstraction has 119154 states and 153682 transitions. [2020-12-09 05:39:40,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:39:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 119154 states and 153682 transitions. [2020-12-09 05:39:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-09 05:39:40,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:40,234 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:39:40,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-09 05:39:40,234 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1582325723, now seen corresponding path program 1 times [2020-12-09 05:39:40,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:40,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536944746] [2020-12-09 05:39:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:40,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536944746] [2020-12-09 05:39:40,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024902022] [2020-12-09 05:39:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:39:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:40,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 05:39:40,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:39:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:40,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:39:40,548 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 05:39:40,548 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:39:40,549 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 05:39:40,549 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:39:40,550 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-12-09 05:39:40,551 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:39:40,551 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-12-09 05:39:40,551 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:39:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:40,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 05:39:40,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 13 [2020-12-09 05:39:40,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465787200] [2020-12-09 05:39:40,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:39:40,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:39:40,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-09 05:39:40,594 INFO L87 Difference]: Start difference. First operand 119154 states and 153682 transitions. Second operand 7 states. [2020-12-09 05:39:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:49,223 INFO L93 Difference]: Finished difference Result 198693 states and 258876 transitions. [2020-12-09 05:39:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:39:49,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2020-12-09 05:39:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:49,364 INFO L225 Difference]: With dead ends: 198693 [2020-12-09 05:39:49,364 INFO L226 Difference]: Without dead ends: 136019 [2020-12-09 05:39:49,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-12-09 05:39:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136019 states. [2020-12-09 05:39:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136019 to 111624. [2020-12-09 05:39:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111624 states. [2020-12-09 05:39:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111624 states to 111624 states and 144223 transitions. [2020-12-09 05:39:56,594 INFO L78 Accepts]: Start accepts. Automaton has 111624 states and 144223 transitions. Word has length 103 [2020-12-09 05:39:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:56,595 INFO L481 AbstractCegarLoop]: Abstraction has 111624 states and 144223 transitions. [2020-12-09 05:39:56,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:39:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111624 states and 144223 transitions. [2020-12-09 05:39:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-09 05:39:56,616 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:56,616 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:56,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-09 05:39:56,817 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1679966034, now seen corresponding path program 1 times [2020-12-09 05:39:56,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:56,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337563544] [2020-12-09 05:39:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:39:56,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337563544] [2020-12-09 05:39:56,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:56,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:39:56,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960055337] [2020-12-09 05:39:56,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:39:56,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:39:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:39:56,882 INFO L87 Difference]: Start difference. First operand 111624 states and 144223 transitions. Second operand 4 states. [2020-12-09 05:40:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:06,752 INFO L93 Difference]: Finished difference Result 236037 states and 302040 transitions. [2020-12-09 05:40:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:40:06,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2020-12-09 05:40:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:06,926 INFO L225 Difference]: With dead ends: 236037 [2020-12-09 05:40:06,926 INFO L226 Difference]: Without dead ends: 166322 [2020-12-09 05:40:06,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:40:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166322 states. [2020-12-09 05:40:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166322 to 119657. [2020-12-09 05:40:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119657 states. [2020-12-09 05:40:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119657 states to 119657 states and 153726 transitions. [2020-12-09 05:40:15,033 INFO L78 Accepts]: Start accepts. Automaton has 119657 states and 153726 transitions. Word has length 104 [2020-12-09 05:40:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:15,033 INFO L481 AbstractCegarLoop]: Abstraction has 119657 states and 153726 transitions. [2020-12-09 05:40:15,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:40:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 119657 states and 153726 transitions. [2020-12-09 05:40:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-09 05:40:15,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:15,057 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:40:15,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-09 05:40:15,057 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash 942483631, now seen corresponding path program 1 times [2020-12-09 05:40:15,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:15,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116313568] [2020-12-09 05:40:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:40:15,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116313568] [2020-12-09 05:40:15,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:40:15,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:40:15,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586232641] [2020-12-09 05:40:15,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:40:15,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:40:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:40:15,092 INFO L87 Difference]: Start difference. First operand 119657 states and 153726 transitions. Second operand 3 states. [2020-12-09 05:40:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:20,494 INFO L93 Difference]: Finished difference Result 195131 states and 251455 transitions. [2020-12-09 05:40:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:40:20,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-09 05:40:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:20,611 INFO L225 Difference]: With dead ends: 195131 [2020-12-09 05:40:20,611 INFO L226 Difference]: Without dead ends: 78623 [2020-12-09 05:40:20,657 INFO L677 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 [2020-12-09 05:40:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78623 states. [2020-12-09 05:40:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78623 to 77759. [2020-12-09 05:40:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77759 states. [2020-12-09 05:40:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77759 states to 77759 states and 97716 transitions. [2020-12-09 05:40:25,866 INFO L78 Accepts]: Start accepts. Automaton has 77759 states and 97716 transitions. Word has length 104 [2020-12-09 05:40:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:25,866 INFO L481 AbstractCegarLoop]: Abstraction has 77759 states and 97716 transitions. [2020-12-09 05:40:25,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:40:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77759 states and 97716 transitions. [2020-12-09 05:40:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-09 05:40:25,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:25,880 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:40:25,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-09 05:40:25,880 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 387705047, now seen corresponding path program 1 times [2020-12-09 05:40:25,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:25,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516065669] [2020-12-09 05:40:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:40:25,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516065669] [2020-12-09 05:40:25,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906885235] [2020-12-09 05:40:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:40:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:26,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 05:40:26,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:40:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:26,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:40:26,116 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:40:26,116 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:40:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:26,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:40:26,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 8 [2020-12-09 05:40:26,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755845797] [2020-12-09 05:40:26,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:40:26,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:26,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:40:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:40:26,201 INFO L87 Difference]: Start difference. First operand 77759 states and 97716 transitions. Second operand 6 states. [2020-12-09 05:40:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:31,301 INFO L93 Difference]: Finished difference Result 117704 states and 148141 transitions. [2020-12-09 05:40:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:40:31,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-12-09 05:40:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:31,372 INFO L225 Difference]: With dead ends: 117704 [2020-12-09 05:40:31,372 INFO L226 Difference]: Without dead ends: 74047 [2020-12-09 05:40:31,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:40:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74047 states. [2020-12-09 05:40:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74047 to 52260. [2020-12-09 05:40:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52260 states. [2020-12-09 05:40:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52260 states to 52260 states and 65097 transitions. [2020-12-09 05:40:35,789 INFO L78 Accepts]: Start accepts. Automaton has 52260 states and 65097 transitions. Word has length 105 [2020-12-09 05:40:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:35,789 INFO L481 AbstractCegarLoop]: Abstraction has 52260 states and 65097 transitions. [2020-12-09 05:40:35,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:40:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 52260 states and 65097 transitions. [2020-12-09 05:40:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-09 05:40:35,801 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:35,801 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:40:36,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:40:36,003 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:36,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1286974679, now seen corresponding path program 1 times [2020-12-09 05:40:36,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:36,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63761184] [2020-12-09 05:40:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:40:36,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63761184] [2020-12-09 05:40:36,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815768599] [2020-12-09 05:40:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:40:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:36,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:40:36,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:40:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:36,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:40:36,275 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:40:36,275 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:40:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:36,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:40:36,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2020-12-09 05:40:36,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947550081] [2020-12-09 05:40:36,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:40:36,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:40:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:40:36,328 INFO L87 Difference]: Start difference. First operand 52260 states and 65097 transitions. Second operand 4 states. [2020-12-09 05:40:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:40,881 INFO L93 Difference]: Finished difference Result 79510 states and 98826 transitions. [2020-12-09 05:40:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:40:40,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-09 05:40:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:40,923 INFO L225 Difference]: With dead ends: 79510 [2020-12-09 05:40:40,924 INFO L226 Difference]: Without dead ends: 49815 [2020-12-09 05:40:40,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:40:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49815 states. [2020-12-09 05:40:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49815 to 49769. [2020-12-09 05:40:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49769 states. [2020-12-09 05:40:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49769 states to 49769 states and 61805 transitions. [2020-12-09 05:40:45,198 INFO L78 Accepts]: Start accepts. Automaton has 49769 states and 61805 transitions. Word has length 105 [2020-12-09 05:40:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:45,198 INFO L481 AbstractCegarLoop]: Abstraction has 49769 states and 61805 transitions. [2020-12-09 05:40:45,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:40:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 49769 states and 61805 transitions. [2020-12-09 05:40:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 05:40:45,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:45,222 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:40:45,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 05:40:45,424 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1923560326, now seen corresponding path program 1 times [2020-12-09 05:40:45,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:45,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436561471] [2020-12-09 05:40:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:40:45,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436561471] [2020-12-09 05:40:45,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:40:45,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:40:45,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503806353] [2020-12-09 05:40:45,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:40:45,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:40:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:40:45,493 INFO L87 Difference]: Start difference. First operand 49769 states and 61805 transitions. Second operand 4 states. [2020-12-09 05:40:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:48,732 INFO L93 Difference]: Finished difference Result 82157 states and 101711 transitions. [2020-12-09 05:40:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:40:48,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2020-12-09 05:40:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:48,768 INFO L225 Difference]: With dead ends: 82157 [2020-12-09 05:40:48,768 INFO L226 Difference]: Without dead ends: 37806 [2020-12-09 05:40:48,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:40:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37806 states. [2020-12-09 05:40:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37806 to 31343. [2020-12-09 05:40:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31343 states. [2020-12-09 05:40:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31343 states to 31343 states and 37959 transitions. [2020-12-09 05:40:51,649 INFO L78 Accepts]: Start accepts. Automaton has 31343 states and 37959 transitions. Word has length 129 [2020-12-09 05:40:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:51,649 INFO L481 AbstractCegarLoop]: Abstraction has 31343 states and 37959 transitions. [2020-12-09 05:40:51,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:40:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 31343 states and 37959 transitions. [2020-12-09 05:40:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-09 05:40:51,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:51,661 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:40:51,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-09 05:40:51,661 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1971648733, now seen corresponding path program 1 times [2020-12-09 05:40:51,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:51,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873967272] [2020-12-09 05:40:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:51,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873967272] [2020-12-09 05:40:51,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:40:51,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:40:51,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375934709] [2020-12-09 05:40:51,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:40:51,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:51,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:40:51,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:40:51,702 INFO L87 Difference]: Start difference. First operand 31343 states and 37959 transitions. Second operand 3 states. [2020-12-09 05:40:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:54,576 INFO L93 Difference]: Finished difference Result 56670 states and 68698 transitions. [2020-12-09 05:40:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:40:54,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-09 05:40:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:54,601 INFO L225 Difference]: With dead ends: 56670 [2020-12-09 05:40:54,601 INFO L226 Difference]: Without dead ends: 31347 [2020-12-09 05:40:54,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:40:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31347 states. [2020-12-09 05:40:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31347 to 30451. [2020-12-09 05:40:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30451 states. [2020-12-09 05:40:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30451 states to 30451 states and 36634 transitions. [2020-12-09 05:40:57,356 INFO L78 Accepts]: Start accepts. Automaton has 30451 states and 36634 transitions. Word has length 133 [2020-12-09 05:40:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:57,356 INFO L481 AbstractCegarLoop]: Abstraction has 30451 states and 36634 transitions. [2020-12-09 05:40:57,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:40:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 30451 states and 36634 transitions. [2020-12-09 05:40:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-09 05:40:57,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:40:57,367 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-09 05:40:57,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-09 05:40:57,368 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:40:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:40:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1609481464, now seen corresponding path program 1 times [2020-12-09 05:40:57,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:40:57,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360370237] [2020-12-09 05:40:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:40:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:40:57,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360370237] [2020-12-09 05:40:57,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064907813] [2020-12-09 05:40:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:40:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:40:57,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:40:57,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:40:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:57,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:40:57,639 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:40:57,640 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:40:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:40:57,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:40:57,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [9] total 11 [2020-12-09 05:40:57,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969518509] [2020-12-09 05:40:57,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:40:57,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:40:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:40:57,689 INFO L87 Difference]: Start difference. First operand 30451 states and 36634 transitions. Second operand 4 states. [2020-12-09 05:41:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:41:00,388 INFO L93 Difference]: Finished difference Result 43935 states and 52685 transitions. [2020-12-09 05:41:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:41:00,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-12-09 05:41:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:41:00,417 INFO L225 Difference]: With dead ends: 43935 [2020-12-09 05:41:00,417 INFO L226 Difference]: Without dead ends: 28423 [2020-12-09 05:41:00,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:41:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28423 states. [2020-12-09 05:41:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28423 to 28199. [2020-12-09 05:41:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28199 states. [2020-12-09 05:41:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28199 states to 28199 states and 33886 transitions. [2020-12-09 05:41:03,085 INFO L78 Accepts]: Start accepts. Automaton has 28199 states and 33886 transitions. Word has length 134 [2020-12-09 05:41:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:41:03,086 INFO L481 AbstractCegarLoop]: Abstraction has 28199 states and 33886 transitions. [2020-12-09 05:41:03,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:41:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28199 states and 33886 transitions. [2020-12-09 05:41:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-09 05:41:03,096 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:41:03,097 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:41:03,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:41:03,298 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:41:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:41:03,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1194958877, now seen corresponding path program 1 times [2020-12-09 05:41:03,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:41:03,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286674322] [2020-12-09 05:41:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:41:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:41:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:41:03,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286674322] [2020-12-09 05:41:03,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:41:03,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:41:03,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489523941] [2020-12-09 05:41:03,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:41:03,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:41:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:41:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:41:03,375 INFO L87 Difference]: Start difference. First operand 28199 states and 33886 transitions. Second operand 4 states. [2020-12-09 05:41:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:41:05,577 INFO L93 Difference]: Finished difference Result 45849 states and 54687 transitions. [2020-12-09 05:41:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:41:05,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-09 05:41:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:41:05,593 INFO L225 Difference]: With dead ends: 45849 [2020-12-09 05:41:05,593 INFO L226 Difference]: Without dead ends: 21418 [2020-12-09 05:41:05,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:41:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21418 states. [2020-12-09 05:41:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21418 to 18706. [2020-12-09 05:41:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18706 states. [2020-12-09 05:41:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18706 states to 18706 states and 21790 transitions. [2020-12-09 05:41:07,455 INFO L78 Accepts]: Start accepts. Automaton has 18706 states and 21790 transitions. Word has length 159 [2020-12-09 05:41:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:41:07,455 INFO L481 AbstractCegarLoop]: Abstraction has 18706 states and 21790 transitions. [2020-12-09 05:41:07,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:41:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18706 states and 21790 transitions. [2020-12-09 05:41:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-09 05:41:07,462 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:41:07,462 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:41:07,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-09 05:41:07,462 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:41:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:41:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1353789114, now seen corresponding path program 1 times [2020-12-09 05:41:07,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:41:07,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869245391] [2020-12-09 05:41:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:41:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:41:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:41:07,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869245391] [2020-12-09 05:41:07,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278044395] [2020-12-09 05:41:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:41:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:41:07,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 05:41:07,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:41:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:41:07,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:41:07,785 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:41:07,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:41:07,844 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:41:07,845 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:41:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 05:41:07,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 05:41:07,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5] total 9 [2020-12-09 05:41:07,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508730592] [2020-12-09 05:41:07,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:41:07,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:41:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:41:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:41:07,893 INFO L87 Difference]: Start difference. First operand 18706 states and 21790 transitions. Second operand 3 states. [2020-12-09 05:41:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:41:09,748 INFO L93 Difference]: Finished difference Result 32634 states and 37970 transitions. [2020-12-09 05:41:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:41:09,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2020-12-09 05:41:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:41:09,762 INFO L225 Difference]: With dead ends: 32634 [2020-12-09 05:41:09,762 INFO L226 Difference]: Without dead ends: 18706 [2020-12-09 05:41:09,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:41:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18706 states. [2020-12-09 05:41:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18706 to 18706. [2020-12-09 05:41:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18706 states. [2020-12-09 05:41:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18706 states to 18706 states and 21746 transitions. [2020-12-09 05:41:11,683 INFO L78 Accepts]: Start accepts. Automaton has 18706 states and 21746 transitions. Word has length 188 [2020-12-09 05:41:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:41:11,683 INFO L481 AbstractCegarLoop]: Abstraction has 18706 states and 21746 transitions. [2020-12-09 05:41:11,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:41:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 18706 states and 21746 transitions. [2020-12-09 05:41:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-09 05:41:11,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:41:11,690 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:41:11,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:41:11,892 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:41:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:41:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1181062102, now seen corresponding path program 1 times [2020-12-09 05:41:11,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:41:11,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29042872] [2020-12-09 05:41:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:41:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:41:11,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:41:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:41:11,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:41:12,025 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 05:41:12,026 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 05:41:12,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-09 05:41:12,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:12 BoogieIcfgContainer [2020-12-09 05:41:12,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:41:12,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:41:12,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:41:12,181 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:41:12,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:35:51" (3/4) ... [2020-12-09 05:41:12,182 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 05:41:12,318 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2473cc57-b7b6-4b5a-a0c9-99a56a35cae8/bin/utaipan/witness.graphml [2020-12-09 05:41:12,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:41:12,320 INFO L168 Benchmark]: Toolchain (without parser) took 322891.18 ms. Allocated memory was 111.1 MB in the beginning and 7.6 GB in the end (delta: 7.5 GB). Free memory was 73.6 MB in the beginning and 5.8 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,320 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 111.1 MB. Free memory was 90.2 MB in the beginning and 90.1 MB in the end (delta: 78.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:41:12,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.24 ms. Allocated memory is still 111.1 MB. Free memory was 73.3 MB in the beginning and 81.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.39 ms. Allocated memory is still 111.1 MB. Free memory was 81.8 MB in the beginning and 76.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,321 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 111.1 MB. Free memory was 76.6 MB in the beginning and 72.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,322 INFO L168 Benchmark]: RCFGBuilder took 1835.73 ms. Allocated memory was 111.1 MB in the beginning and 186.6 MB in the end (delta: 75.5 MB). Free memory was 72.4 MB in the beginning and 152.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 74.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,322 INFO L168 Benchmark]: TraceAbstraction took 320566.99 ms. Allocated memory was 186.6 MB in the beginning and 7.6 GB in the end (delta: 7.4 GB). Free memory was 152.5 MB in the beginning and 5.8 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,322 INFO L168 Benchmark]: Witness Printer took 138.03 ms. Allocated memory is still 7.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 45.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:41:12,325 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 111.1 MB. Free memory was 90.2 MB in the beginning and 90.1 MB in the end (delta: 78.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 250.24 ms. Allocated memory is still 111.1 MB. Free memory was 73.3 MB in the beginning and 81.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.39 ms. Allocated memory is still 111.1 MB. Free memory was 81.8 MB in the beginning and 76.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 111.1 MB. Free memory was 76.6 MB in the beginning and 72.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1835.73 ms. Allocated memory was 111.1 MB in the beginning and 186.6 MB in the end (delta: 75.5 MB). Free memory was 72.4 MB in the beginning and 152.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 74.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 320566.99 ms. Allocated memory was 186.6 MB in the beginning and 7.6 GB in the end (delta: 7.4 GB). Free memory was 152.5 MB in the beginning and 5.8 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.1 GB. * Witness Printer took 138.03 ms. Allocated memory is still 7.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 45.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int t4_pc = 0; [L22] int t5_pc = 0; [L23] int m_st ; [L24] int t1_st ; [L25] int t2_st ; [L26] int t3_st ; [L27] int t4_st ; [L28] int t5_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int t2_i ; [L32] int t3_i ; [L33] int t4_i ; [L34] int t5_i ; [L35] int M_E = 2; [L36] int T1_E = 2; [L37] int T2_E = 2; [L38] int T3_E = 2; [L39] int T4_E = 2; [L40] int T5_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L44] int E_4 = 2; [L45] int E_5 = 2; [L937] int __retres1 ; [L848] m_i = 1 [L849] t1_i = 1 [L850] t2_i = 1 [L851] t3_i = 1 [L852] t4_i = 1 [L853] t5_i = 1 [L878] int kernel_st ; [L879] int tmp ; [L880] int tmp___0 ; [L884] kernel_st = 0 [L393] COND TRUE m_i == 1 [L394] m_st = 0 [L398] COND TRUE t1_i == 1 [L399] t1_st = 0 [L403] COND TRUE t2_i == 1 [L404] t2_st = 0 [L408] COND TRUE t3_i == 1 [L409] t3_st = 0 [L413] COND TRUE t4_i == 1 [L414] t4_st = 0 [L418] COND TRUE t5_i == 1 [L419] t5_st = 0 [L578] COND FALSE !(M_E == 0) [L583] COND FALSE !(T1_E == 0) [L588] COND FALSE !(T2_E == 0) [L593] COND FALSE !(T3_E == 0) [L598] COND FALSE !(T4_E == 0) [L603] COND FALSE !(T5_E == 0) [L608] COND FALSE !(E_1 == 0) [L613] COND FALSE !(E_2 == 0) [L618] COND FALSE !(E_3 == 0) [L623] COND FALSE !(E_4 == 0) [L628] COND FALSE !(E_5 == 0) [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L271] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L290] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND FALSE !(\read(tmp___0)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L309] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND FALSE !(\read(tmp___1)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L328] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND FALSE !(\read(tmp___2)) [L344] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L347] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L357] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND FALSE !(\read(tmp___3)) [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L366] COND FALSE !(t5_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L376] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND FALSE !(\read(tmp___4)) [L641] COND FALSE !(M_E == 1) [L646] COND FALSE !(T1_E == 1) [L651] COND FALSE !(T2_E == 1) [L656] COND FALSE !(T3_E == 1) [L661] COND FALSE !(T4_E == 1) [L666] COND FALSE !(T5_E == 1) [L671] COND FALSE !(E_1 == 1) [L676] COND FALSE !(E_2 == 1) [L681] COND FALSE !(E_3 == 1) [L686] COND FALSE !(E_4 == 1) [L691] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L892] COND TRUE 1 [L895] kernel_st = 1 [L469] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L473] COND TRUE 1 [L428] int __retres1 ; [L431] COND TRUE m_st == 0 [L432] __retres1 = 1 [L464] return (__retres1); [L476] tmp = exists_runnable_thread() [L478] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L483] COND TRUE m_st == 0 [L484] int tmp_ndt_1; [L485] tmp_ndt_1 = __VERIFIER_nondet_int() [L486] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L497] COND TRUE t1_st == 0 [L498] int tmp_ndt_2; [L499] tmp_ndt_2 = __VERIFIER_nondet_int() [L500] COND TRUE \read(tmp_ndt_2) [L502] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L109] COND TRUE 1 [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L511] COND TRUE t2_st == 0 [L512] int tmp_ndt_3; [L513] tmp_ndt_3 = __VERIFIER_nondet_int() [L514] COND TRUE \read(tmp_ndt_3) [L516] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L133] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L144] COND TRUE 1 [L146] t2_pc = 1 [L147] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L525] COND TRUE t3_st == 0 [L526] int tmp_ndt_4; [L527] tmp_ndt_4 = __VERIFIER_nondet_int() [L528] COND TRUE \read(tmp_ndt_4) [L530] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L168] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L179] COND TRUE 1 [L181] t3_pc = 1 [L182] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L539] COND TRUE t4_st == 0 [L540] int tmp_ndt_5; [L541] tmp_ndt_5 = __VERIFIER_nondet_int() [L542] COND TRUE \read(tmp_ndt_5) [L544] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L203] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L214] COND TRUE 1 [L216] t4_pc = 1 [L217] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=0] [L553] COND TRUE t5_st == 0 [L554] int tmp_ndt_6; [L555] tmp_ndt_6 = __VERIFIER_nondet_int() [L556] COND TRUE \read(tmp_ndt_6) [L558] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1] [L238] COND TRUE t5_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1] [L249] COND TRUE 1 [L251] t5_pc = 1 [L252] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L473] COND TRUE 1 [L428] int __retres1 ; [L431] COND TRUE m_st == 0 [L432] __retres1 = 1 [L464] return (__retres1); [L476] tmp = exists_runnable_thread() [L478] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L483] COND TRUE m_st == 0 [L484] int tmp_ndt_1; [L485] tmp_ndt_1 = __VERIFIER_nondet_int() [L486] COND TRUE \read(tmp_ndt_1) [L488] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L57] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L68] COND TRUE 1 [L71] E_1 = 1 [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L271] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L281] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L290] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L291] COND TRUE E_1 == 1 [L292] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND TRUE \read(tmp___0) [L721] t1_st = 0 [L306] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L309] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L310] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L319] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND FALSE !(\read(tmp___1)) [L325] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L328] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L329] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L338] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND FALSE !(\read(tmp___2)) [L344] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L347] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L348] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L357] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND FALSE !(\read(tmp___3)) [L363] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L366] COND TRUE t5_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L367] COND FALSE !(E_5 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L376] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND FALSE !(\read(tmp___4)) [L73] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L76] COND TRUE 1 [L78] m_pc = 1 [L79] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L497] COND TRUE t1_st == 0 [L498] int tmp_ndt_2; [L499] tmp_ndt_2 = __VERIFIER_nondet_int() [L500] COND TRUE \read(tmp_ndt_2) [L502] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L101] COND TRUE t1_pc == 1 [L117] E_2 = 1 [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L271] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L272] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L281] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L290] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L291] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L300] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND FALSE !(\read(tmp___0)) [L306] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L309] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L310] COND TRUE E_2 == 1 [L311] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND TRUE \read(tmp___1) [L729] t2_st = 0 [L325] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L328] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L329] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L338] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND FALSE !(\read(tmp___2)) [L344] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L347] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L348] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L357] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND FALSE !(\read(tmp___3)) [L363] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L366] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L367] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L376] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND FALSE !(\read(tmp___4)) [L119] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L109] COND TRUE 1 [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L511] COND TRUE t2_st == 0 [L512] int tmp_ndt_3; [L513] tmp_ndt_3 = __VERIFIER_nondet_int() [L514] COND TRUE \read(tmp_ndt_3) [L516] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L133] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L136] COND TRUE t2_pc == 1 [L152] E_3 = 1 [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L271] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L272] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L290] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L291] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND FALSE !(\read(tmp___0)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L309] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L310] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND FALSE !(\read(tmp___1)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L328] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L329] COND TRUE E_3 == 1 [L330] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND TRUE \read(tmp___2) [L737] t3_st = 0 [L344] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L347] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L348] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L357] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND FALSE !(\read(tmp___3)) [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L366] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L367] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L376] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND FALSE !(\read(tmp___4)) [L154] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L144] COND TRUE 1 [L146] t2_pc = 1 [L147] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L525] COND TRUE t3_st == 0 [L526] int tmp_ndt_4; [L527] tmp_ndt_4 = __VERIFIER_nondet_int() [L528] COND TRUE \read(tmp_ndt_4) [L530] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L168] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L171] COND TRUE t3_pc == 1 [L187] E_4 = 1 [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L271] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L272] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L290] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L291] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND FALSE !(\read(tmp___0)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L309] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L310] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND FALSE !(\read(tmp___1)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L328] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L329] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND FALSE !(\read(tmp___2)) [L344] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L347] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L348] COND TRUE E_4 == 1 [L349] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND TRUE \read(tmp___3) [L745] t4_st = 0 [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L366] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L367] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L376] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND FALSE !(\read(tmp___4)) [L189] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L179] COND TRUE 1 [L181] t3_pc = 1 [L182] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L539] COND TRUE t4_st == 0 [L540] int tmp_ndt_5; [L541] tmp_ndt_5 = __VERIFIER_nondet_int() [L542] COND TRUE \read(tmp_ndt_5) [L544] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L203] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L206] COND TRUE t4_pc == 1 [L222] E_5 = 1 [L701] int tmp ; [L702] int tmp___0 ; [L703] int tmp___1 ; [L704] int tmp___2 ; [L705] int tmp___3 ; [L706] int tmp___4 ; [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L271] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L272] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L283] return (__retres1); [L710] tmp = is_master_triggered() [L712] COND FALSE !(\read(tmp)) [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L290] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L291] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L302] return (__retres1); [L718] tmp___0 = is_transmit1_triggered() [L720] COND FALSE !(\read(tmp___0)) [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L309] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L310] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L321] return (__retres1); [L726] tmp___1 = is_transmit2_triggered() [L728] COND FALSE !(\read(tmp___1)) [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L328] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L329] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L340] return (__retres1); [L734] tmp___2 = is_transmit3_triggered() [L736] COND FALSE !(\read(tmp___2)) [L344] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L347] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L348] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L357] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L359] return (__retres1); [L742] tmp___3 = is_transmit4_triggered() [L744] COND FALSE !(\read(tmp___3)) [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L366] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L367] COND TRUE E_5 == 1 [L368] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2] [L378] return (__retres1); [L750] tmp___4 = is_transmit5_triggered() [L752] COND TRUE \read(tmp___4) [L753] t5_st = 0 [L224] E_5 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0] [L214] COND TRUE 1 [L216] t4_pc = 1 [L217] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=0] [L553] COND TRUE t5_st == 0 [L554] int tmp_ndt_6; [L555] tmp_ndt_6 = __VERIFIER_nondet_int() [L556] COND TRUE \read(tmp_ndt_6) [L558] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1] [L238] COND FALSE !(t5_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1] [L241] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 235 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 320.3s, OverallIterations: 44, TraceHistogramMax: 3, AutomataDifference: 167.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17737 SDtfs, 16469 SDslu, 19058 SDs, 0 SdLazy, 1976 SolverSat, 497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1810 GetRequests, 1679 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164542occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 146.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 630904 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4742 NumberOfCodeBlocks, 4742 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5307 ConstructedInterpolants, 0 QuantifiedInterpolants, 1367895 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3668 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 57 InterpolantComputations, 47 PerfectInterpolantSequences, 874/932 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...