./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.04.cil-2.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_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.04.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 37c2f037dea88b70ca73720b5945796ac3b5419f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:45:48,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 04:45:48,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 04:45:49,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 04:45:49,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 04:45:49,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 04:45:49,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 04:45:49,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 04:45:49,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 04:45:49,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 04:45:49,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 04:45:49,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 04:45:49,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 04:45:49,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 04:45:49,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 04:45:49,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 04:45:49,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 04:45:49,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 04:45:49,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 04:45:49,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 04:45:49,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 04:45:49,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 04:45:49,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 04:45:49,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 04:45:49,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 04:45:49,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 04:45:49,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 04:45:49,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 04:45:49,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 04:45:49,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 04:45:49,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 04:45:49,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 04:45:49,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 04:45:49,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 04:45:49,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 04:45:49,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 04:45:49,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 04:45:49,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 04:45:49,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 04:45:49,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 04:45:49,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 04:45:49,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 04:45:49,051 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 04:45:49,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 04:45:49,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 04:45:49,052 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 04:45:49,052 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 04:45:49,052 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 04:45:49,052 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 04:45:49,053 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 04:45:49,053 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 04:45:49,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 04:45:49,054 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 04:45:49,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 04:45:49,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 04:45:49,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 04:45:49,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 04:45:49,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 04:45:49,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 04:45:49,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 04:45:49,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 04:45:49,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 04:45:49,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 04:45:49,057 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_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 -> 37c2f037dea88b70ca73720b5945796ac3b5419f [2020-12-09 04:45:49,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 04:45:49,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 04:45:49,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 04:45:49,251 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 04:45:49,252 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 04:45:49,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2020-12-09 04:45:49,294 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/data/67d72ed5e/101d3aec991d464cb329f32a067e1adb/FLAG608122a34 [2020-12-09 04:45:49,666 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 04:45:49,667 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2020-12-09 04:45:49,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/data/67d72ed5e/101d3aec991d464cb329f32a067e1adb/FLAG608122a34 [2020-12-09 04:45:49,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/data/67d72ed5e/101d3aec991d464cb329f32a067e1adb [2020-12-09 04:45:49,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 04:45:49,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 04:45:49,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 04:45:49,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 04:45:49,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 04:45:49,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:49,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b3df24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49, skipping insertion in model container [2020-12-09 04:45:49,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:49,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 04:45:49,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 04:45:49,836 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_c38eb266-22e8-4c86-9fc1-425fbd297c6c/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[366,379] [2020-12-09 04:45:49,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:45:49,889 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 04:45:49,897 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_c38eb266-22e8-4c86-9fc1-425fbd297c6c/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[366,379] [2020-12-09 04:45:49,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:45:49,939 INFO L208 MainTranslator]: Completed translation [2020-12-09 04:45:49,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49 WrapperNode [2020-12-09 04:45:49,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 04:45:49,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 04:45:49,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 04:45:49,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 04:45:49,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:49,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:49,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 04:45:49,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 04:45:49,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 04:45:49,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 04:45:49,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:49,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... [2020-12-09 04:45:50,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 04:45:50,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 04:45:50,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 04:45:50,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 04:45:50,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:45:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 04:45:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 04:45:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 04:45:50,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 04:45:51,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 04:45:51,665 INFO L299 CfgBuilder]: Removed 163 assume(true) statements. [2020-12-09 04:45:51,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:45:51 BoogieIcfgContainer [2020-12-09 04:45:51,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 04:45:51,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 04:45:51,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 04:45:51,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 04:45:51,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:45:49" (1/3) ... [2020-12-09 04:45:51,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eaccb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:45:51, skipping insertion in model container [2020-12-09 04:45:51,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:45:49" (2/3) ... [2020-12-09 04:45:51,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eaccb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:45:51, skipping insertion in model container [2020-12-09 04:45:51,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:45:51" (3/3) ... [2020-12-09 04:45:51,674 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2020-12-09 04:45:51,684 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 04:45:51,686 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 04:45:51,693 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-09 04:45:51,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 04:45:51,710 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 04:45:51,711 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 04:45:51,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 04:45:51,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 04:45:51,711 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 04:45:51,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 04:45:51,711 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 04:45:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states. [2020-12-09 04:45:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 04:45:51,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:51,728 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] [2020-12-09 04:45:51,728 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash -198187330, now seen corresponding path program 1 times [2020-12-09 04:45:51,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:51,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787224491] [2020-12-09 04:45:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:51,863 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 04:45:51,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787224491] [2020-12-09 04:45:51,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:51,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:45:51,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657616109] [2020-12-09 04:45:51,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:51,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:51,878 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 3 states. [2020-12-09 04:45:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:51,962 INFO L93 Difference]: Finished difference Result 569 states and 872 transitions. [2020-12-09 04:45:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:51,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-09 04:45:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:51,978 INFO L225 Difference]: With dead ends: 569 [2020-12-09 04:45:51,978 INFO L226 Difference]: Without dead ends: 364 [2020-12-09 04:45:51,982 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 04:45:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-12-09 04:45:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 346. [2020-12-09 04:45:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-12-09 04:45:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 516 transitions. [2020-12-09 04:45:52,029 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 516 transitions. Word has length 25 [2020-12-09 04:45:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:52,030 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 516 transitions. [2020-12-09 04:45:52,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 516 transitions. [2020-12-09 04:45:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 04:45:52,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:52,033 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:52,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 04:45:52,033 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 970939071, now seen corresponding path program 1 times [2020-12-09 04:45:52,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:52,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260371940] [2020-12-09 04:45:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 04:45:52,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260371940] [2020-12-09 04:45:52,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:52,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:52,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978728319] [2020-12-09 04:45:52,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:52,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:45:52,097 INFO L87 Difference]: Start difference. First operand 346 states and 516 transitions. Second operand 4 states. [2020-12-09 04:45:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:52,201 INFO L93 Difference]: Finished difference Result 1117 states and 1656 transitions. [2020-12-09 04:45:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:52,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-09 04:45:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:52,206 INFO L225 Difference]: With dead ends: 1117 [2020-12-09 04:45:52,206 INFO L226 Difference]: Without dead ends: 780 [2020-12-09 04:45:52,208 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 04:45:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-12-09 04:45:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 615. [2020-12-09 04:45:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2020-12-09 04:45:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 905 transitions. [2020-12-09 04:45:52,244 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 905 transitions. Word has length 50 [2020-12-09 04:45:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:52,244 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 905 transitions. [2020-12-09 04:45:52,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:45:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 905 transitions. [2020-12-09 04:45:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 04:45:52,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:52,248 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:52,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 04:45:52,248 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1895980417, now seen corresponding path program 1 times [2020-12-09 04:45:52,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:52,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082880490] [2020-12-09 04:45:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 04:45:52,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082880490] [2020-12-09 04:45:52,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:52,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:45:52,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187867840] [2020-12-09 04:45:52,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:52,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:52,296 INFO L87 Difference]: Start difference. First operand 615 states and 905 transitions. Second operand 3 states. [2020-12-09 04:45:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:52,345 INFO L93 Difference]: Finished difference Result 1713 states and 2519 transitions. [2020-12-09 04:45:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:52,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-09 04:45:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:52,350 INFO L225 Difference]: With dead ends: 1713 [2020-12-09 04:45:52,350 INFO L226 Difference]: Without dead ends: 1114 [2020-12-09 04:45:52,351 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 04:45:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2020-12-09 04:45:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1106. [2020-12-09 04:45:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2020-12-09 04:45:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1604 transitions. [2020-12-09 04:45:52,383 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1604 transitions. Word has length 50 [2020-12-09 04:45:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:52,383 INFO L481 AbstractCegarLoop]: Abstraction has 1106 states and 1604 transitions. [2020-12-09 04:45:52,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1604 transitions. [2020-12-09 04:45:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 04:45:52,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:52,387 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:52,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 04:45:52,387 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1950816707, now seen corresponding path program 1 times [2020-12-09 04:45:52,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:52,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980475791] [2020-12-09 04:45:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:45:52,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980475791] [2020-12-09 04:45:52,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:52,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:52,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406630416] [2020-12-09 04:45:52,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:52,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:52,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:52,442 INFO L87 Difference]: Start difference. First operand 1106 states and 1604 transitions. Second operand 3 states. [2020-12-09 04:45:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:52,523 INFO L93 Difference]: Finished difference Result 3214 states and 4642 transitions. [2020-12-09 04:45:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:52,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-09 04:45:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:52,532 INFO L225 Difference]: With dead ends: 3214 [2020-12-09 04:45:52,532 INFO L226 Difference]: Without dead ends: 2113 [2020-12-09 04:45:52,534 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 04:45:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2020-12-09 04:45:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1997. [2020-12-09 04:45:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2020-12-09 04:45:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2853 transitions. [2020-12-09 04:45:52,592 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2853 transitions. Word has length 50 [2020-12-09 04:45:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:52,593 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2853 transitions. [2020-12-09 04:45:52,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2853 transitions. [2020-12-09 04:45:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 04:45:52,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:52,595 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:52,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 04:45:52,595 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 360421730, now seen corresponding path program 1 times [2020-12-09 04:45:52,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:52,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650007386] [2020-12-09 04:45:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:45:52,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650007386] [2020-12-09 04:45:52,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:52,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:52,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469676408] [2020-12-09 04:45:52,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:52,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:45:52,668 INFO L87 Difference]: Start difference. First operand 1997 states and 2853 transitions. Second operand 4 states. [2020-12-09 04:45:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:52,848 INFO L93 Difference]: Finished difference Result 6869 states and 9871 transitions. [2020-12-09 04:45:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:52,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-09 04:45:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:52,868 INFO L225 Difference]: With dead ends: 6869 [2020-12-09 04:45:52,868 INFO L226 Difference]: Without dead ends: 4889 [2020-12-09 04:45:52,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:45:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2020-12-09 04:45:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 3769. [2020-12-09 04:45:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2020-12-09 04:45:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5369 transitions. [2020-12-09 04:45:52,984 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5369 transitions. Word has length 50 [2020-12-09 04:45:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:52,984 INFO L481 AbstractCegarLoop]: Abstraction has 3769 states and 5369 transitions. [2020-12-09 04:45:52,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:45:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5369 transitions. [2020-12-09 04:45:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-09 04:45:52,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:52,987 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:52,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 04:45:52,988 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -459367821, now seen corresponding path program 1 times [2020-12-09 04:45:52,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:52,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29303237] [2020-12-09 04:45:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:45:53,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29303237] [2020-12-09 04:45:53,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:53,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:53,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158128341] [2020-12-09 04:45:53,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:53,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:53,040 INFO L87 Difference]: Start difference. First operand 3769 states and 5369 transitions. Second operand 3 states. [2020-12-09 04:45:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:53,161 INFO L93 Difference]: Finished difference Result 6433 states and 9343 transitions. [2020-12-09 04:45:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:53,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-09 04:45:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:53,179 INFO L225 Difference]: With dead ends: 6433 [2020-12-09 04:45:53,179 INFO L226 Difference]: Without dead ends: 4309 [2020-12-09 04:45:53,182 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 04:45:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2020-12-09 04:45:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4085. [2020-12-09 04:45:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2020-12-09 04:45:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5905 transitions. [2020-12-09 04:45:53,335 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5905 transitions. Word has length 51 [2020-12-09 04:45:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:53,335 INFO L481 AbstractCegarLoop]: Abstraction has 4085 states and 5905 transitions. [2020-12-09 04:45:53,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5905 transitions. [2020-12-09 04:45:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-09 04:45:53,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:53,341 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 04:45:53,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 04:45:53,341 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1843807405, now seen corresponding path program 1 times [2020-12-09 04:45:53,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:53,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016072702] [2020-12-09 04:45:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:45:53,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016072702] [2020-12-09 04:45:53,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:53,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:45:53,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816928931] [2020-12-09 04:45:53,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:53,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:53,388 INFO L87 Difference]: Start difference. First operand 4085 states and 5905 transitions. Second operand 3 states. [2020-12-09 04:45:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:53,627 INFO L93 Difference]: Finished difference Result 11482 states and 16578 transitions. [2020-12-09 04:45:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:53,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-09 04:45:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:53,657 INFO L225 Difference]: With dead ends: 11482 [2020-12-09 04:45:53,657 INFO L226 Difference]: Without dead ends: 7408 [2020-12-09 04:45:53,662 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 04:45:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2020-12-09 04:45:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7356. [2020-12-09 04:45:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2020-12-09 04:45:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 10466 transitions. [2020-12-09 04:45:53,891 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 10466 transitions. Word has length 70 [2020-12-09 04:45:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:53,891 INFO L481 AbstractCegarLoop]: Abstraction has 7356 states and 10466 transitions. [2020-12-09 04:45:53,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 10466 transitions. [2020-12-09 04:45:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-09 04:45:53,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:53,901 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:53,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 04:45:53,902 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1155791311, now seen corresponding path program 1 times [2020-12-09 04:45:53,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:53,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197363203] [2020-12-09 04:45:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:45:53,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197363203] [2020-12-09 04:45:53,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:53,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:53,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809041579] [2020-12-09 04:45:53,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:45:53,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:45:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:45:53,964 INFO L87 Difference]: Start difference. First operand 7356 states and 10466 transitions. Second operand 3 states. [2020-12-09 04:45:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:54,196 INFO L93 Difference]: Finished difference Result 12316 states and 17624 transitions. [2020-12-09 04:45:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:45:54,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-09 04:45:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:54,225 INFO L225 Difference]: With dead ends: 12316 [2020-12-09 04:45:54,225 INFO L226 Difference]: Without dead ends: 7868 [2020-12-09 04:45:54,230 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 04:45:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2020-12-09 04:45:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7356. [2020-12-09 04:45:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2020-12-09 04:45:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 10250 transitions. [2020-12-09 04:45:54,488 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 10250 transitions. Word has length 73 [2020-12-09 04:45:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:54,489 INFO L481 AbstractCegarLoop]: Abstraction has 7356 states and 10250 transitions. [2020-12-09 04:45:54,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:45:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 10250 transitions. [2020-12-09 04:45:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-09 04:45:54,505 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:54,505 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:54,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 04:45:54,506 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1466658354, now seen corresponding path program 1 times [2020-12-09 04:45:54,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:54,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009859622] [2020-12-09 04:45:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:45:54,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009859622] [2020-12-09 04:45:54,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:54,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:54,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77815474] [2020-12-09 04:45:54,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:54,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:45:54,583 INFO L87 Difference]: Start difference. First operand 7356 states and 10250 transitions. Second operand 4 states. [2020-12-09 04:45:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:54,971 INFO L93 Difference]: Finished difference Result 20984 states and 29344 transitions. [2020-12-09 04:45:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-09 04:45:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:54,990 INFO L225 Difference]: With dead ends: 20984 [2020-12-09 04:45:54,990 INFO L226 Difference]: Without dead ends: 13644 [2020-12-09 04:45:54,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:45:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13644 states. [2020-12-09 04:45:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13644 to 10652. [2020-12-09 04:45:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10652 states. [2020-12-09 04:45:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10652 states to 10652 states and 14834 transitions. [2020-12-09 04:45:55,234 INFO L78 Accepts]: Start accepts. Automaton has 10652 states and 14834 transitions. Word has length 73 [2020-12-09 04:45:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:55,234 INFO L481 AbstractCegarLoop]: Abstraction has 10652 states and 14834 transitions. [2020-12-09 04:45:55,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:45:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 10652 states and 14834 transitions. [2020-12-09 04:45:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 04:45:55,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:55,259 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:55,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 04:45:55,259 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1510619171, now seen corresponding path program 1 times [2020-12-09 04:45:55,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:55,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188856219] [2020-12-09 04:45:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:45:55,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188856219] [2020-12-09 04:45:55,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:55,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:55,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874003707] [2020-12-09 04:45:55,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:55,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:45:55,326 INFO L87 Difference]: Start difference. First operand 10652 states and 14834 transitions. Second operand 4 states. [2020-12-09 04:45:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:55,907 INFO L93 Difference]: Finished difference Result 30280 states and 42256 transitions. [2020-12-09 04:45:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:55,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-09 04:45:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:55,933 INFO L225 Difference]: With dead ends: 30280 [2020-12-09 04:45:55,933 INFO L226 Difference]: Without dead ends: 19644 [2020-12-09 04:45:55,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:45:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19644 states. [2020-12-09 04:45:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19644 to 15366. [2020-12-09 04:45:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15366 states. [2020-12-09 04:45:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15366 states to 15366 states and 21348 transitions. [2020-12-09 04:45:56,291 INFO L78 Accepts]: Start accepts. Automaton has 15366 states and 21348 transitions. Word has length 74 [2020-12-09 04:45:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:56,291 INFO L481 AbstractCegarLoop]: Abstraction has 15366 states and 21348 transitions. [2020-12-09 04:45:56,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:45:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15366 states and 21348 transitions. [2020-12-09 04:45:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-09 04:45:56,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:56,305 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:56,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 04:45:56,305 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2023073124, now seen corresponding path program 1 times [2020-12-09 04:45:56,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:56,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539145435] [2020-12-09 04:45:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:45:56,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539145435] [2020-12-09 04:45:56,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:45:56,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:45:56,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464586845] [2020-12-09 04:45:56,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:56,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:45:56,347 INFO L87 Difference]: Start difference. First operand 15366 states and 21348 transitions. Second operand 4 states. [2020-12-09 04:45:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:57,254 INFO L93 Difference]: Finished difference Result 53392 states and 74208 transitions. [2020-12-09 04:45:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:57,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-09 04:45:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:57,293 INFO L225 Difference]: With dead ends: 53392 [2020-12-09 04:45:57,294 INFO L226 Difference]: Without dead ends: 38042 [2020-12-09 04:45:57,311 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 04:45:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38042 states. [2020-12-09 04:45:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38042 to 28636. [2020-12-09 04:45:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28636 states. [2020-12-09 04:45:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28636 states to 28636 states and 39402 transitions. [2020-12-09 04:45:57,990 INFO L78 Accepts]: Start accepts. Automaton has 28636 states and 39402 transitions. Word has length 75 [2020-12-09 04:45:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:45:57,990 INFO L481 AbstractCegarLoop]: Abstraction has 28636 states and 39402 transitions. [2020-12-09 04:45:57,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:45:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28636 states and 39402 transitions. [2020-12-09 04:45:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-09 04:45:58,014 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:45:58,014 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:58,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 04:45:58,014 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:45:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:45:58,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1824596327, now seen corresponding path program 1 times [2020-12-09 04:45:58,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:45:58,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613438784] [2020-12-09 04:45:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:45:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:45:58,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613438784] [2020-12-09 04:45:58,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679938487] [2020-12-09 04:45:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:45:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:45:58,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 04:45:58,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:45:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:45:58,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:45:58,350 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 04:45:58,351 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 04:45:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:45:58,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:45:58,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2020-12-09 04:45:58,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517684680] [2020-12-09 04:45:58,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:45:58,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:45:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:45:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:45:58,428 INFO L87 Difference]: Start difference. First operand 28636 states and 39402 transitions. Second operand 4 states. [2020-12-09 04:45:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:45:59,285 INFO L93 Difference]: Finished difference Result 46604 states and 64520 transitions. [2020-12-09 04:45:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:45:59,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-09 04:45:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:45:59,324 INFO L225 Difference]: With dead ends: 46604 [2020-12-09 04:45:59,324 INFO L226 Difference]: Without dead ends: 29388 [2020-12-09 04:45:59,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 1 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 04:45:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29388 states. [2020-12-09 04:46:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29388 to 28636. [2020-12-09 04:46:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28636 states. [2020-12-09 04:46:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28636 states to 28636 states and 38850 transitions. [2020-12-09 04:46:00,253 INFO L78 Accepts]: Start accepts. Automaton has 28636 states and 38850 transitions. Word has length 76 [2020-12-09 04:46:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:00,253 INFO L481 AbstractCegarLoop]: Abstraction has 28636 states and 38850 transitions. [2020-12-09 04:46:00,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:46:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28636 states and 38850 transitions. [2020-12-09 04:46:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-09 04:46:00,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:00,293 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:00,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 04:46:00,495 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -976345729, now seen corresponding path program 1 times [2020-12-09 04:46:00,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:00,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470093427] [2020-12-09 04:46:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:46:00,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470093427] [2020-12-09 04:46:00,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359913304] [2020-12-09 04:46:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:46:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:00,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 04:46:00,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:46:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:00,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:46:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:00,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 04:46:00,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2020-12-09 04:46:00,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548701687] [2020-12-09 04:46:00,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:46:00,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:46:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-09 04:46:00,854 INFO L87 Difference]: Start difference. First operand 28636 states and 38850 transitions. Second operand 5 states. [2020-12-09 04:46:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:01,860 INFO L93 Difference]: Finished difference Result 51763 states and 70234 transitions. [2020-12-09 04:46:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 04:46:01,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-12-09 04:46:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:01,892 INFO L225 Difference]: With dead ends: 51763 [2020-12-09 04:46:01,892 INFO L226 Difference]: Without dead ends: 34547 [2020-12-09 04:46:01,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-09 04:46:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34547 states. [2020-12-09 04:46:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34547 to 28636. [2020-12-09 04:46:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28636 states. [2020-12-09 04:46:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28636 states to 28636 states and 38778 transitions. [2020-12-09 04:46:02,615 INFO L78 Accepts]: Start accepts. Automaton has 28636 states and 38778 transitions. Word has length 77 [2020-12-09 04:46:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:02,616 INFO L481 AbstractCegarLoop]: Abstraction has 28636 states and 38778 transitions. [2020-12-09 04:46:02,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:46:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28636 states and 38778 transitions. [2020-12-09 04:46:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 04:46:02,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:02,632 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:02,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 04:46:02,833 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1130961340, now seen corresponding path program 1 times [2020-12-09 04:46:02,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:02,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162771686] [2020-12-09 04:46:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:46:02,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162771686] [2020-12-09 04:46:02,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235048083] [2020-12-09 04:46:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:46:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:02,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 04:46:02,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:46:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:46:03,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:46:03,101 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 04:46:03,101 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 04:46:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:46:03,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:46:03,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 8 [2020-12-09 04:46:03,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534301542] [2020-12-09 04:46:03,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:46:03,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:46:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:46:03,133 INFO L87 Difference]: Start difference. First operand 28636 states and 38778 transitions. Second operand 6 states. [2020-12-09 04:46:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:03,845 INFO L93 Difference]: Finished difference Result 57556 states and 77936 transitions. [2020-12-09 04:46:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:46:03,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-12-09 04:46:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:03,873 INFO L225 Difference]: With dead ends: 57556 [2020-12-09 04:46:03,873 INFO L226 Difference]: Without dead ends: 28936 [2020-12-09 04:46:03,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:46:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28936 states. [2020-12-09 04:46:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28936 to 28636. [2020-12-09 04:46:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28636 states. [2020-12-09 04:46:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28636 states to 28636 states and 38250 transitions. [2020-12-09 04:46:04,662 INFO L78 Accepts]: Start accepts. Automaton has 28636 states and 38250 transitions. Word has length 79 [2020-12-09 04:46:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:04,663 INFO L481 AbstractCegarLoop]: Abstraction has 28636 states and 38250 transitions. [2020-12-09 04:46:04,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:46:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 28636 states and 38250 transitions. [2020-12-09 04:46:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 04:46:04,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:04,679 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:04,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 04:46:04,880 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 157472381, now seen corresponding path program 1 times [2020-12-09 04:46:04,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:04,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582089158] [2020-12-09 04:46:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:04,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582089158] [2020-12-09 04:46:04,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:46:04,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:46:04,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842666215] [2020-12-09 04:46:04,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:46:04,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:46:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:46:04,944 INFO L87 Difference]: Start difference. First operand 28636 states and 38250 transitions. Second operand 3 states. [2020-12-09 04:46:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:05,533 INFO L93 Difference]: Finished difference Result 50820 states and 67921 transitions. [2020-12-09 04:46:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:46:05,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-09 04:46:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:05,554 INFO L225 Difference]: With dead ends: 50820 [2020-12-09 04:46:05,554 INFO L226 Difference]: Without dead ends: 22200 [2020-12-09 04:46:05,572 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 04:46:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22200 states. [2020-12-09 04:46:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22200 to 22052. [2020-12-09 04:46:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22052 states. [2020-12-09 04:46:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22052 states to 22052 states and 28761 transitions. [2020-12-09 04:46:06,347 INFO L78 Accepts]: Start accepts. Automaton has 22052 states and 28761 transitions. Word has length 79 [2020-12-09 04:46:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:06,347 INFO L481 AbstractCegarLoop]: Abstraction has 22052 states and 28761 transitions. [2020-12-09 04:46:06,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:46:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22052 states and 28761 transitions. [2020-12-09 04:46:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-09 04:46:06,361 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:06,362 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:06,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 04:46:06,362 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1876604100, now seen corresponding path program 1 times [2020-12-09 04:46:06,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:06,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918357106] [2020-12-09 04:46:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:46:06,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918357106] [2020-12-09 04:46:06,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74631804] [2020-12-09 04:46:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:46:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:06,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 04:46:06,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:46:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:06,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:46:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:06,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 04:46:06,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 12 [2020-12-09 04:46:06,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523272181] [2020-12-09 04:46:06,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:46:06,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:46:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-12-09 04:46:06,640 INFO L87 Difference]: Start difference. First operand 22052 states and 28761 transitions. Second operand 6 states. [2020-12-09 04:46:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:07,408 INFO L93 Difference]: Finished difference Result 34074 states and 44382 transitions. [2020-12-09 04:46:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 04:46:07,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2020-12-09 04:46:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:07,434 INFO L225 Difference]: With dead ends: 34074 [2020-12-09 04:46:07,434 INFO L226 Difference]: Without dead ends: 25056 [2020-12-09 04:46:07,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-12-09 04:46:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25056 states. [2020-12-09 04:46:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25056 to 22523. [2020-12-09 04:46:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22523 states. [2020-12-09 04:46:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22523 states to 22523 states and 29439 transitions. [2020-12-09 04:46:08,073 INFO L78 Accepts]: Start accepts. Automaton has 22523 states and 29439 transitions. Word has length 80 [2020-12-09 04:46:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:08,073 INFO L481 AbstractCegarLoop]: Abstraction has 22523 states and 29439 transitions. [2020-12-09 04:46:08,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:46:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22523 states and 29439 transitions. [2020-12-09 04:46:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-09 04:46:08,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:08,084 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:08,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:46:08,286 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash 798050551, now seen corresponding path program 1 times [2020-12-09 04:46:08,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:08,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889227078] [2020-12-09 04:46:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:08,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889227078] [2020-12-09 04:46:08,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:46:08,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:46:08,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519507778] [2020-12-09 04:46:08,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:46:08,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:46:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:46:08,349 INFO L87 Difference]: Start difference. First operand 22523 states and 29439 transitions. Second operand 3 states. [2020-12-09 04:46:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:08,910 INFO L93 Difference]: Finished difference Result 38209 states and 50249 transitions. [2020-12-09 04:46:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:46:08,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-09 04:46:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:08,929 INFO L225 Difference]: With dead ends: 38209 [2020-12-09 04:46:08,929 INFO L226 Difference]: Without dead ends: 22599 [2020-12-09 04:46:08,940 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 04:46:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22599 states. [2020-12-09 04:46:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22599 to 22427. [2020-12-09 04:46:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22427 states. [2020-12-09 04:46:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22427 states to 22427 states and 28539 transitions. [2020-12-09 04:46:09,587 INFO L78 Accepts]: Start accepts. Automaton has 22427 states and 28539 transitions. Word has length 82 [2020-12-09 04:46:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:09,587 INFO L481 AbstractCegarLoop]: Abstraction has 22427 states and 28539 transitions. [2020-12-09 04:46:09,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:46:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22427 states and 28539 transitions. [2020-12-09 04:46:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-09 04:46:09,598 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:09,598 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:09,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 04:46:09,599 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -342301160, now seen corresponding path program 1 times [2020-12-09 04:46:09,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:09,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915486584] [2020-12-09 04:46:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:46:09,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915486584] [2020-12-09 04:46:09,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011759524] [2020-12-09 04:46:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:46:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:09,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 04:46:09,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:46:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:09,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:46:09,818 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-12-09 04:46:09,818 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 04:46:09,820 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-12-09 04:46:09,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 04:46:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:09,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:46:09,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [4] total 8 [2020-12-09 04:46:09,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558673309] [2020-12-09 04:46:09,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:46:09,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:46:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 04:46:09,857 INFO L87 Difference]: Start difference. First operand 22427 states and 28539 transitions. Second operand 6 states. [2020-12-09 04:46:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:11,022 INFO L93 Difference]: Finished difference Result 58994 states and 76006 transitions. [2020-12-09 04:46:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 04:46:11,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-12-09 04:46:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:11,058 INFO L225 Difference]: With dead ends: 58994 [2020-12-09 04:46:11,058 INFO L226 Difference]: Without dead ends: 36583 [2020-12-09 04:46:11,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-09 04:46:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36583 states. [2020-12-09 04:46:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36583 to 21456. [2020-12-09 04:46:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21456 states. [2020-12-09 04:46:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 27742 transitions. [2020-12-09 04:46:11,834 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 27742 transitions. Word has length 82 [2020-12-09 04:46:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:11,835 INFO L481 AbstractCegarLoop]: Abstraction has 21456 states and 27742 transitions. [2020-12-09 04:46:11,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:46:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 27742 transitions. [2020-12-09 04:46:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-09 04:46:11,845 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:11,845 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:12,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 04:46:12,047 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1679233347, now seen corresponding path program 1 times [2020-12-09 04:46:12,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:12,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291050772] [2020-12-09 04:46:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:12,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291050772] [2020-12-09 04:46:12,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:46:12,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:46:12,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900047807] [2020-12-09 04:46:12,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:46:12,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:46:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:46:12,111 INFO L87 Difference]: Start difference. First operand 21456 states and 27742 transitions. Second operand 3 states. [2020-12-09 04:46:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:12,775 INFO L93 Difference]: Finished difference Result 42895 states and 55467 transitions. [2020-12-09 04:46:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:46:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-09 04:46:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:12,794 INFO L225 Difference]: With dead ends: 42895 [2020-12-09 04:46:12,794 INFO L226 Difference]: Without dead ends: 21456 [2020-12-09 04:46:12,808 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 04:46:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21456 states. [2020-12-09 04:46:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21456 to 21456. [2020-12-09 04:46:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21456 states. [2020-12-09 04:46:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 27418 transitions. [2020-12-09 04:46:13,648 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 27418 transitions. Word has length 84 [2020-12-09 04:46:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:13,649 INFO L481 AbstractCegarLoop]: Abstraction has 21456 states and 27418 transitions. [2020-12-09 04:46:13,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:46:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 27418 transitions. [2020-12-09 04:46:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-09 04:46:13,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:13,663 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:13,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 04:46:13,663 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash -378370684, now seen corresponding path program 1 times [2020-12-09 04:46:13,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:13,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827039477] [2020-12-09 04:46:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:13,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827039477] [2020-12-09 04:46:13,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:46:13,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:46:13,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308309694] [2020-12-09 04:46:13,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:46:13,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:46:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:46:13,705 INFO L87 Difference]: Start difference. First operand 21456 states and 27418 transitions. Second operand 3 states. [2020-12-09 04:46:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:14,285 INFO L93 Difference]: Finished difference Result 36123 states and 46346 transitions. [2020-12-09 04:46:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:46:14,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-09 04:46:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:14,299 INFO L225 Difference]: With dead ends: 36123 [2020-12-09 04:46:14,299 INFO L226 Difference]: Without dead ends: 14684 [2020-12-09 04:46:14,310 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 04:46:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2020-12-09 04:46:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14555. [2020-12-09 04:46:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14555 states. [2020-12-09 04:46:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 18260 transitions. [2020-12-09 04:46:14,793 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 18260 transitions. Word has length 84 [2020-12-09 04:46:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:14,793 INFO L481 AbstractCegarLoop]: Abstraction has 14555 states and 18260 transitions. [2020-12-09 04:46:14,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:46:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 18260 transitions. [2020-12-09 04:46:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 04:46:14,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:14,800 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:46:14,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 04:46:14,800 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash -389342395, now seen corresponding path program 1 times [2020-12-09 04:46:14,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:14,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466519022] [2020-12-09 04:46:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:46:14,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466519022] [2020-12-09 04:46:14,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:46:14,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:46:14,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450603021] [2020-12-09 04:46:14,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:46:14,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:46:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:46:14,824 INFO L87 Difference]: Start difference. First operand 14555 states and 18260 transitions. Second operand 3 states. [2020-12-09 04:46:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:46:15,535 INFO L93 Difference]: Finished difference Result 33536 states and 42396 transitions. [2020-12-09 04:46:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:46:15,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-09 04:46:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:46:15,550 INFO L225 Difference]: With dead ends: 33536 [2020-12-09 04:46:15,550 INFO L226 Difference]: Without dead ends: 18998 [2020-12-09 04:46:15,557 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 04:46:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-12-09 04:46:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 17195. [2020-12-09 04:46:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17195 states. [2020-12-09 04:46:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17195 states to 17195 states and 22009 transitions. [2020-12-09 04:46:16,182 INFO L78 Accepts]: Start accepts. Automaton has 17195 states and 22009 transitions. Word has length 85 [2020-12-09 04:46:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:46:16,182 INFO L481 AbstractCegarLoop]: Abstraction has 17195 states and 22009 transitions. [2020-12-09 04:46:16,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:46:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17195 states and 22009 transitions. [2020-12-09 04:46:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 04:46:16,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:46:16,191 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:16,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 04:46:16,191 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:46:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:46:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 589772888, now seen corresponding path program 1 times [2020-12-09 04:46:16,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:46:16,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730098072] [2020-12-09 04:46:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:46:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:16,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730098072] [2020-12-09 04:46:16,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652014062] [2020-12-09 04:46:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:46:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:46:16,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 04:46:16,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:46:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:16,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:46:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:46:16,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765268530] [2020-12-09 04:46:16,536 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2020-12-09 04:46:16,536 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:46:16,539 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:46:16,543 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:46:16,543 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:46:19,077 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 253 [2020-12-09 04:46:19,716 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:46:19,918 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2020-12-09 04:46:20,163 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2020-12-09 04:46:20,419 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2020-12-09 04:46:20,708 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-12-09 04:46:21,019 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 116 [2020-12-09 04:46:21,394 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2020-12-09 04:46:21,761 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 122 [2020-12-09 04:46:22,206 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 124 [2020-12-09 04:46:22,624 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 128 [2020-12-09 04:46:23,146 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 130 [2020-12-09 04:46:23,516 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 04:46:25,644 WARN L197 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 273 DAG size of output: 223 [2020-12-09 04:46:27,925 WARN L197 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 216 DAG size of output: 214 [2020-12-09 04:46:28,720 WARN L197 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 168 [2020-12-09 04:46:29,469 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 166 [2020-12-09 04:46:30,297 WARN L197 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 172 [2020-12-09 04:46:31,034 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 149 [2020-12-09 04:46:31,820 WARN L197 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 151 [2020-12-09 04:46:32,886 WARN L197 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 154 [2020-12-09 04:46:34,150 WARN L197 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 156 [2020-12-09 04:46:34,889 WARN L197 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 152 [2020-12-09 04:46:35,873 WARN L197 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 154 [2020-12-09 04:46:36,573 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 152 [2020-12-09 04:46:37,507 WARN L197 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 154 [2020-12-09 04:46:38,241 WARN L197 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 153 [2020-12-09 04:46:39,134 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 155 [2020-12-09 04:46:39,937 WARN L197 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 160 [2020-12-09 04:46:40,751 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 162 [2020-12-09 04:46:41,582 WARN L197 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 164 [2020-12-09 04:46:42,607 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 163 [2020-12-09 04:46:43,459 WARN L197 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 165 [2020-12-09 04:46:44,342 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 167 [2020-12-09 04:46:45,409 WARN L197 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 166 [2020-12-09 04:46:46,309 WARN L197 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 168 [2020-12-09 04:46:47,237 WARN L197 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 170 [2020-12-09 04:46:48,399 WARN L197 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 169 [2020-12-09 04:46:49,367 WARN L197 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2020-12-09 04:46:49,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:46:49,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [4, 7, 8] total 53 [2020-12-09 04:46:49,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61074241] [2020-12-09 04:46:49,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 04:46:49,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:46:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 04:46:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2020-12-09 04:46:49,371 INFO L87 Difference]: Start difference. First operand 17195 states and 22009 transitions. Second operand 39 states. [2020-12-09 04:46:50,722 WARN L197 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 160 [2020-12-09 04:46:53,156 WARN L197 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 233 DAG size of output: 226 [2020-12-09 04:46:55,020 WARN L197 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2020-12-09 04:47:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:07,408 INFO L93 Difference]: Finished difference Result 35426 states and 45408 transitions. [2020-12-09 04:47:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 04:47:07,409 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2020-12-09 04:47:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:07,425 INFO L225 Difference]: With dead ends: 35426 [2020-12-09 04:47:07,425 INFO L226 Difference]: Without dead ends: 18133 [2020-12-09 04:47:07,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 193 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=644, Invalid=2548, Unknown=0, NotChecked=0, Total=3192 [2020-12-09 04:47:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18133 states. [2020-12-09 04:47:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18133 to 17804. [2020-12-09 04:47:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17804 states. [2020-12-09 04:47:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17804 states to 17804 states and 22837 transitions. [2020-12-09 04:47:08,325 INFO L78 Accepts]: Start accepts. Automaton has 17804 states and 22837 transitions. Word has length 85 [2020-12-09 04:47:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:08,325 INFO L481 AbstractCegarLoop]: Abstraction has 17804 states and 22837 transitions. [2020-12-09 04:47:08,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 04:47:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 17804 states and 22837 transitions. [2020-12-09 04:47:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 04:47:08,334 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:08,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:08,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:08,535 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash 317537978, now seen corresponding path program 1 times [2020-12-09 04:47:08,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:08,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429701072] [2020-12-09 04:47:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:08,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429701072] [2020-12-09 04:47:08,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383285577] [2020-12-09 04:47:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/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 04:47:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:08,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 04:47:08,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:08,705 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 04:47:08,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:08,757 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 04:47:08,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:08,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 04:47:08,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652569971] [2020-12-09 04:47:08,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:08,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:08,758 INFO L87 Difference]: Start difference. First operand 17804 states and 22837 transitions. Second operand 4 states. [2020-12-09 04:47:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:09,758 INFO L93 Difference]: Finished difference Result 34081 states and 43886 transitions. [2020-12-09 04:47:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:09,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2020-12-09 04:47:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:09,778 INFO L225 Difference]: With dead ends: 34081 [2020-12-09 04:47:09,778 INFO L226 Difference]: Without dead ends: 22179 [2020-12-09 04:47:09,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22179 states. [2020-12-09 04:47:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22179 to 19613. [2020-12-09 04:47:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19613 states. [2020-12-09 04:47:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19613 states to 19613 states and 25340 transitions. [2020-12-09 04:47:10,758 INFO L78 Accepts]: Start accepts. Automaton has 19613 states and 25340 transitions. Word has length 85 [2020-12-09 04:47:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:10,758 INFO L481 AbstractCegarLoop]: Abstraction has 19613 states and 25340 transitions. [2020-12-09 04:47:10,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 19613 states and 25340 transitions. [2020-12-09 04:47:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 04:47:10,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:10,767 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:10,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:10,969 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1488378919, now seen corresponding path program 1 times [2020-12-09 04:47:10,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:10,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963603491] [2020-12-09 04:47:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:11,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963603491] [2020-12-09 04:47:11,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354600992] [2020-12-09 04:47:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:11,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 04:47:11,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:11,132 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 04:47:11,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:11,185 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 04:47:11,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:11,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 04:47:11,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635520271] [2020-12-09 04:47:11,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:11,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:11,186 INFO L87 Difference]: Start difference. First operand 19613 states and 25340 transitions. Second operand 4 states. [2020-12-09 04:47:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:12,289 INFO L93 Difference]: Finished difference Result 36581 states and 47443 transitions. [2020-12-09 04:47:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:12,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-12-09 04:47:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:12,309 INFO L225 Difference]: With dead ends: 36581 [2020-12-09 04:47:12,309 INFO L226 Difference]: Without dead ends: 23303 [2020-12-09 04:47:12,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23303 states. [2020-12-09 04:47:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23303 to 21241. [2020-12-09 04:47:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21241 states. [2020-12-09 04:47:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21241 states to 21241 states and 27671 transitions. [2020-12-09 04:47:13,318 INFO L78 Accepts]: Start accepts. Automaton has 21241 states and 27671 transitions. Word has length 86 [2020-12-09 04:47:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:13,318 INFO L481 AbstractCegarLoop]: Abstraction has 21241 states and 27671 transitions. [2020-12-09 04:47:13,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21241 states and 27671 transitions. [2020-12-09 04:47:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 04:47:13,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:13,328 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:13,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2020-12-09 04:47:13,529 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1269662128, now seen corresponding path program 1 times [2020-12-09 04:47:13,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:13,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587456809] [2020-12-09 04:47:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 04:47:13,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587456809] [2020-12-09 04:47:13,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:13,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:47:13,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254415427] [2020-12-09 04:47:13,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:13,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:47:13,583 INFO L87 Difference]: Start difference. First operand 21241 states and 27671 transitions. Second operand 4 states. [2020-12-09 04:47:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:15,421 INFO L93 Difference]: Finished difference Result 52089 states and 68618 transitions. [2020-12-09 04:47:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:15,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-12-09 04:47:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:15,459 INFO L225 Difference]: With dead ends: 52089 [2020-12-09 04:47:15,459 INFO L226 Difference]: Without dead ends: 37007 [2020-12-09 04:47:15,475 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 04:47:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37007 states. [2020-12-09 04:47:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37007 to 21241. [2020-12-09 04:47:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21241 states. [2020-12-09 04:47:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21241 states to 21241 states and 27430 transitions. [2020-12-09 04:47:16,788 INFO L78 Accepts]: Start accepts. Automaton has 21241 states and 27430 transitions. Word has length 86 [2020-12-09 04:47:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:16,788 INFO L481 AbstractCegarLoop]: Abstraction has 21241 states and 27430 transitions. [2020-12-09 04:47:16,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21241 states and 27430 transitions. [2020-12-09 04:47:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 04:47:16,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:16,798 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:16,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2020-12-09 04:47:16,799 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1106727568, now seen corresponding path program 1 times [2020-12-09 04:47:16,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:16,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31620106] [2020-12-09 04:47:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:16,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31620106] [2020-12-09 04:47:16,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:16,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:47:16,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099327859] [2020-12-09 04:47:16,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:47:16,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:47:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:47:16,823 INFO L87 Difference]: Start difference. First operand 21241 states and 27430 transitions. Second operand 3 states. [2020-12-09 04:47:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:17,983 INFO L93 Difference]: Finished difference Result 36333 states and 47017 transitions. [2020-12-09 04:47:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:47:17,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-09 04:47:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:18,004 INFO L225 Difference]: With dead ends: 36333 [2020-12-09 04:47:18,004 INFO L226 Difference]: Without dead ends: 21251 [2020-12-09 04:47:18,017 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 04:47:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21251 states. [2020-12-09 04:47:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21251 to 20883. [2020-12-09 04:47:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20883 states. [2020-12-09 04:47:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20883 states to 20883 states and 26297 transitions. [2020-12-09 04:47:19,262 INFO L78 Accepts]: Start accepts. Automaton has 20883 states and 26297 transitions. Word has length 86 [2020-12-09 04:47:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:19,262 INFO L481 AbstractCegarLoop]: Abstraction has 20883 states and 26297 transitions. [2020-12-09 04:47:19,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:47:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20883 states and 26297 transitions. [2020-12-09 04:47:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-09 04:47:19,271 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:19,272 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:47:19,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2020-12-09 04:47:19,272 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 210473045, now seen corresponding path program 1 times [2020-12-09 04:47:19,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:19,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23694165] [2020-12-09 04:47:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:19,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23694165] [2020-12-09 04:47:19,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461044288] [2020-12-09 04:47:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:19,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 04:47:19,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:19,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:19,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:19,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2020-12-09 04:47:19,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253964009] [2020-12-09 04:47:19,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:19,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:19,532 INFO L87 Difference]: Start difference. First operand 20883 states and 26297 transitions. Second operand 4 states. [2020-12-09 04:47:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:20,730 INFO L93 Difference]: Finished difference Result 31848 states and 39957 transitions. [2020-12-09 04:47:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:20,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-12-09 04:47:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:20,748 INFO L225 Difference]: With dead ends: 31848 [2020-12-09 04:47:20,748 INFO L226 Difference]: Without dead ends: 20929 [2020-12-09 04:47:20,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20929 states. [2020-12-09 04:47:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20929 to 20883. [2020-12-09 04:47:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20883 states. [2020-12-09 04:47:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20883 states to 20883 states and 26261 transitions. [2020-12-09 04:47:21,934 INFO L78 Accepts]: Start accepts. Automaton has 20883 states and 26261 transitions. Word has length 87 [2020-12-09 04:47:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:21,934 INFO L481 AbstractCegarLoop]: Abstraction has 20883 states and 26261 transitions. [2020-12-09 04:47:21,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20883 states and 26261 transitions. [2020-12-09 04:47:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-09 04:47:21,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:21,944 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:47:22,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2020-12-09 04:47:22,145 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1243861783, now seen corresponding path program 1 times [2020-12-09 04:47:22,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:22,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246866871] [2020-12-09 04:47:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:22,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246866871] [2020-12-09 04:47:22,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049139956] [2020-12-09 04:47:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:22,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 04:47:22,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:22,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:22,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:22,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2020-12-09 04:47:22,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339624188] [2020-12-09 04:47:22,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:22,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:22,469 INFO L87 Difference]: Start difference. First operand 20883 states and 26261 transitions. Second operand 4 states. [2020-12-09 04:47:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:23,693 INFO L93 Difference]: Finished difference Result 35198 states and 44323 transitions. [2020-12-09 04:47:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:23,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-09 04:47:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:23,711 INFO L225 Difference]: With dead ends: 35198 [2020-12-09 04:47:23,711 INFO L226 Difference]: Without dead ends: 21107 [2020-12-09 04:47:23,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21107 states. [2020-12-09 04:47:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21107 to 20883. [2020-12-09 04:47:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20883 states. [2020-12-09 04:47:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20883 states to 20883 states and 25988 transitions. [2020-12-09 04:47:24,973 INFO L78 Accepts]: Start accepts. Automaton has 20883 states and 25988 transitions. Word has length 88 [2020-12-09 04:47:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:24,973 INFO L481 AbstractCegarLoop]: Abstraction has 20883 states and 25988 transitions. [2020-12-09 04:47:24,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20883 states and 25988 transitions. [2020-12-09 04:47:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-09 04:47:24,983 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:24,983 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:25,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:25,184 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2037746734, now seen corresponding path program 1 times [2020-12-09 04:47:25,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:25,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736322063] [2020-12-09 04:47:25,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:25,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736322063] [2020-12-09 04:47:25,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:25,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:47:25,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416344147] [2020-12-09 04:47:25,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:25,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:25,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:47:25,220 INFO L87 Difference]: Start difference. First operand 20883 states and 25988 transitions. Second operand 4 states. [2020-12-09 04:47:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:26,716 INFO L93 Difference]: Finished difference Result 38639 states and 47775 transitions. [2020-12-09 04:47:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:26,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-09 04:47:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:26,736 INFO L225 Difference]: With dead ends: 38639 [2020-12-09 04:47:26,736 INFO L226 Difference]: Without dead ends: 24458 [2020-12-09 04:47:26,744 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 04:47:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24458 states. [2020-12-09 04:47:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24458 to 20175. [2020-12-09 04:47:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20175 states. [2020-12-09 04:47:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20175 states to 20175 states and 24723 transitions. [2020-12-09 04:47:27,937 INFO L78 Accepts]: Start accepts. Automaton has 20175 states and 24723 transitions. Word has length 88 [2020-12-09 04:47:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:27,937 INFO L481 AbstractCegarLoop]: Abstraction has 20175 states and 24723 transitions. [2020-12-09 04:47:27,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 20175 states and 24723 transitions. [2020-12-09 04:47:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-09 04:47:27,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:27,942 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:47:27,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-12-09 04:47:27,943 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -62992106, now seen corresponding path program 1 times [2020-12-09 04:47:27,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:27,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389603425] [2020-12-09 04:47:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:27,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389603425] [2020-12-09 04:47:27,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520198159] [2020-12-09 04:47:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:28,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 04:47:28,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:28,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:47:28,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:28,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2020-12-09 04:47:28,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352547752] [2020-12-09 04:47:28,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:47:28,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:47:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 04:47:28,221 INFO L87 Difference]: Start difference. First operand 20175 states and 24723 transitions. Second operand 6 states. [2020-12-09 04:47:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:29,648 INFO L93 Difference]: Finished difference Result 34449 states and 41812 transitions. [2020-12-09 04:47:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:47:29,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2020-12-09 04:47:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:29,668 INFO L225 Difference]: With dead ends: 34449 [2020-12-09 04:47:29,668 INFO L226 Difference]: Without dead ends: 22851 [2020-12-09 04:47:29,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 04:47:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22851 states. [2020-12-09 04:47:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22851 to 22133. [2020-12-09 04:47:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22133 states. [2020-12-09 04:47:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22133 states to 22133 states and 26537 transitions. [2020-12-09 04:47:31,006 INFO L78 Accepts]: Start accepts. Automaton has 22133 states and 26537 transitions. Word has length 89 [2020-12-09 04:47:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:31,006 INFO L481 AbstractCegarLoop]: Abstraction has 22133 states and 26537 transitions. [2020-12-09 04:47:31,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:47:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22133 states and 26537 transitions. [2020-12-09 04:47:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-09 04:47:31,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:31,013 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:31,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2020-12-09 04:47:31,214 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2077492318, now seen corresponding path program 1 times [2020-12-09 04:47:31,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:31,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257882141] [2020-12-09 04:47:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:31,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257882141] [2020-12-09 04:47:31,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:31,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:47:31,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527478596] [2020-12-09 04:47:31,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:31,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:47:31,284 INFO L87 Difference]: Start difference. First operand 22133 states and 26537 transitions. Second operand 4 states. [2020-12-09 04:47:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:32,739 INFO L93 Difference]: Finished difference Result 43298 states and 51494 transitions. [2020-12-09 04:47:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:32,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-09 04:47:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:32,758 INFO L225 Difference]: With dead ends: 43298 [2020-12-09 04:47:32,759 INFO L226 Difference]: Without dead ends: 24431 [2020-12-09 04:47:32,768 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 04:47:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2020-12-09 04:47:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 20592. [2020-12-09 04:47:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20592 states. [2020-12-09 04:47:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20592 states to 20592 states and 24071 transitions. [2020-12-09 04:47:33,945 INFO L78 Accepts]: Start accepts. Automaton has 20592 states and 24071 transitions. Word has length 112 [2020-12-09 04:47:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:33,946 INFO L481 AbstractCegarLoop]: Abstraction has 20592 states and 24071 transitions. [2020-12-09 04:47:33,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20592 states and 24071 transitions. [2020-12-09 04:47:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-09 04:47:33,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:33,955 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 04:47:33,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2020-12-09 04:47:33,955 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1147105421, now seen corresponding path program 1 times [2020-12-09 04:47:33,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:33,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677559642] [2020-12-09 04:47:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:34,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677559642] [2020-12-09 04:47:34,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:34,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:47:34,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101380864] [2020-12-09 04:47:34,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:34,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:47:34,007 INFO L87 Difference]: Start difference. First operand 20592 states and 24071 transitions. Second operand 4 states. [2020-12-09 04:47:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:35,568 INFO L93 Difference]: Finished difference Result 44156 states and 51654 transitions. [2020-12-09 04:47:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:35,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2020-12-09 04:47:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:35,591 INFO L225 Difference]: With dead ends: 44156 [2020-12-09 04:47:35,591 INFO L226 Difference]: Without dead ends: 25448 [2020-12-09 04:47:35,603 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 04:47:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25448 states. [2020-12-09 04:47:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25448 to 22033. [2020-12-09 04:47:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22033 states. [2020-12-09 04:47:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22033 states to 22033 states and 25332 transitions. [2020-12-09 04:47:36,912 INFO L78 Accepts]: Start accepts. Automaton has 22033 states and 25332 transitions. Word has length 138 [2020-12-09 04:47:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:36,912 INFO L481 AbstractCegarLoop]: Abstraction has 22033 states and 25332 transitions. [2020-12-09 04:47:36,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22033 states and 25332 transitions. [2020-12-09 04:47:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-09 04:47:36,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:36,919 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:36,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2020-12-09 04:47:36,919 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -684747794, now seen corresponding path program 1 times [2020-12-09 04:47:36,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:36,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664742985] [2020-12-09 04:47:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:36,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664742985] [2020-12-09 04:47:36,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814870395] [2020-12-09 04:47:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:37,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 04:47:37,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:47:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:37,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:47:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:47:37,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 04:47:37,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 04:47:37,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34274017] [2020-12-09 04:47:37,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:47:37,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:47:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:37,240 INFO L87 Difference]: Start difference. First operand 22033 states and 25332 transitions. Second operand 4 states. [2020-12-09 04:47:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:38,500 INFO L93 Difference]: Finished difference Result 43530 states and 50370 transitions. [2020-12-09 04:47:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:47:38,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2020-12-09 04:47:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:38,516 INFO L225 Difference]: With dead ends: 43530 [2020-12-09 04:47:38,516 INFO L226 Difference]: Without dead ends: 22086 [2020-12-09 04:47:38,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22086 states. [2020-12-09 04:47:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22086 to 19403. [2020-12-09 04:47:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19403 states. [2020-12-09 04:47:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19403 states to 19403 states and 22697 transitions. [2020-12-09 04:47:39,620 INFO L78 Accepts]: Start accepts. Automaton has 19403 states and 22697 transitions. Word has length 161 [2020-12-09 04:47:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:39,620 INFO L481 AbstractCegarLoop]: Abstraction has 19403 states and 22697 transitions. [2020-12-09 04:47:39,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:47:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19403 states and 22697 transitions. [2020-12-09 04:47:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-12-09 04:47:39,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:39,623 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:39,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:47:39,825 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1989811870, now seen corresponding path program 1 times [2020-12-09 04:47:39,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:39,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336988446] [2020-12-09 04:47:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:47:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 04:47:39,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336988446] [2020-12-09 04:47:39,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:47:39,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 04:47:39,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119540252] [2020-12-09 04:47:39,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 04:47:39,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:47:39,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 04:47:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:39,965 INFO L87 Difference]: Start difference. First operand 19403 states and 22697 transitions. Second operand 7 states. [2020-12-09 04:47:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:47:43,667 INFO L93 Difference]: Finished difference Result 72273 states and 83615 transitions. [2020-12-09 04:47:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 04:47:43,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2020-12-09 04:47:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:47:43,728 INFO L225 Difference]: With dead ends: 72273 [2020-12-09 04:47:43,728 INFO L226 Difference]: Without dead ends: 61054 [2020-12-09 04:47:43,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:47:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61054 states. [2020-12-09 04:47:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61054 to 42865. [2020-12-09 04:47:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42865 states. [2020-12-09 04:47:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42865 states to 42865 states and 49527 transitions. [2020-12-09 04:47:46,455 INFO L78 Accepts]: Start accepts. Automaton has 42865 states and 49527 transitions. Word has length 165 [2020-12-09 04:47:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:47:46,455 INFO L481 AbstractCegarLoop]: Abstraction has 42865 states and 49527 transitions. [2020-12-09 04:47:46,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 04:47:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42865 states and 49527 transitions. [2020-12-09 04:47:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-12-09 04:47:46,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:47:46,460 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:47:46,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2020-12-09 04:47:46,460 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:47:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:47:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash 671270977, now seen corresponding path program 1 times [2020-12-09 04:47:46,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:47:46,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542078303] [2020-12-09 04:47:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:47:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 04:47:46,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 04:47:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 04:47:46,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 04:47:46,572 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 04:47:46,573 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 04:47:46,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2020-12-09 04:47:46,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:47:46 BoogieIcfgContainer [2020-12-09 04:47:46,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 04:47:46,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 04:47:46,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 04:47:46,718 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 04:47:46,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:45:51" (3/4) ... [2020-12-09 04:47:46,719 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 04:47:46,859 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c38eb266-22e8-4c86-9fc1-425fbd297c6c/bin/utaipan/witness.graphml [2020-12-09 04:47:46,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 04:47:46,860 INFO L168 Benchmark]: Toolchain (without parser) took 117172.12 ms. Allocated memory was 90.2 MB in the beginning and 2.9 GB in the end (delta: 2.9 GB). Free memory was 53.8 MB in the beginning and 873.9 MB in the end (delta: -820.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,860 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 90.2 MB. Free memory was 70.4 MB in the beginning and 70.3 MB in the end (delta: 59.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 04:47:46,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.21 ms. Allocated memory is still 90.2 MB. Free memory was 53.6 MB in the beginning and 62.3 MB in the end (delta: -8.7 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.77 ms. Allocated memory is still 90.2 MB. Free memory was 62.1 MB in the beginning and 57.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,860 INFO L168 Benchmark]: Boogie Preprocessor took 43.37 ms. Allocated memory is still 90.2 MB. Free memory was 57.7 MB in the beginning and 53.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,861 INFO L168 Benchmark]: RCFGBuilder took 1633.23 ms. Allocated memory was 90.2 MB in the beginning and 134.2 MB in the end (delta: 44.0 MB). Free memory was 53.7 MB in the beginning and 103.3 MB in the end (delta: -49.6 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,861 INFO L168 Benchmark]: TraceAbstraction took 115048.38 ms. Allocated memory was 134.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 103.3 MB in the beginning and 911.7 MB in the end (delta: -808.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,861 INFO L168 Benchmark]: Witness Printer took 141.46 ms. Allocated memory is still 2.9 GB. Free memory was 911.7 MB in the beginning and 873.9 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-12-09 04:47:46,863 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.12 ms. Allocated memory is still 90.2 MB. Free memory was 70.4 MB in the beginning and 70.3 MB in the end (delta: 59.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 251.21 ms. Allocated memory is still 90.2 MB. Free memory was 53.6 MB in the beginning and 62.3 MB in the end (delta: -8.7 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.77 ms. Allocated memory is still 90.2 MB. Free memory was 62.1 MB in the beginning and 57.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.37 ms. Allocated memory is still 90.2 MB. Free memory was 57.7 MB in the beginning and 53.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1633.23 ms. Allocated memory was 90.2 MB in the beginning and 134.2 MB in the end (delta: 44.0 MB). Free memory was 53.7 MB in the beginning and 103.3 MB in the end (delta: -49.6 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 115048.38 ms. Allocated memory was 134.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 103.3 MB in the beginning and 911.7 MB in the end (delta: -808.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. * Witness Printer took 141.46 ms. Allocated memory is still 2.9 GB. Free memory was 911.7 MB in the beginning and 873.9 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int t3_pc = 0; [L20] int t4_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int t4_st ; [L26] int m_i ; [L27] int t1_i ; [L28] int t2_i ; [L29] int t3_i ; [L30] int t4_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int T2_E = 2; [L34] int T3_E = 2; [L35] int T4_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L39] int E_3 = 2; [L40] int E_4 = 2; [L47] int token ; [L49] int local ; [L852] int __retres1 ; [L764] m_i = 1 [L765] t1_i = 1 [L766] t2_i = 1 [L767] t3_i = 1 [L768] t4_i = 1 [L793] int kernel_st ; [L794] int tmp ; [L795] int tmp___0 ; [L799] kernel_st = 0 [L357] COND TRUE m_i == 1 [L358] m_st = 0 [L362] COND TRUE t1_i == 1 [L363] t1_st = 0 [L367] COND TRUE t2_i == 1 [L368] t2_st = 0 [L372] COND TRUE t3_i == 1 [L373] t3_st = 0 [L377] COND TRUE t4_i == 1 [L378] t4_st = 0 [L518] COND FALSE !(M_E == 0) [L523] COND FALSE !(T1_E == 0) [L528] COND FALSE !(T2_E == 0) [L533] COND FALSE !(T3_E == 0) [L538] COND FALSE !(T4_E == 0) [L543] COND FALSE !(E_M == 0) [L548] COND FALSE !(E_1 == 0) [L553] COND FALSE !(E_2 == 0) [L558] COND FALSE !(E_3 == 0) [L563] COND FALSE !(E_4 == 0) [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L254] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND FALSE !(\read(tmp)) [L270] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L273] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L283] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND FALSE !(\read(tmp___0)) [L289] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L292] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L302] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND FALSE !(\read(tmp___1)) [L308] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L311] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L321] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND FALSE !(\read(tmp___2)) [L327] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L330] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L340] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND FALSE !(\read(tmp___3)) [L576] COND FALSE !(M_E == 1) [L581] COND FALSE !(T1_E == 1) [L586] COND FALSE !(T2_E == 1) [L591] COND FALSE !(T3_E == 1) [L596] COND FALSE !(T4_E == 1) [L601] COND FALSE !(E_M == 1) [L606] COND FALSE !(E_1 == 1) [L611] COND FALSE !(E_2 == 1) [L616] COND FALSE !(E_3 == 1) [L621] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L807] COND TRUE 1 [L810] kernel_st = 1 [L423] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L427] COND TRUE 1 [L387] int __retres1 ; [L390] COND TRUE m_st == 0 [L391] __retres1 = 1 [L418] return (__retres1); [L430] tmp = exists_runnable_thread() [L432] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L437] COND TRUE m_st == 0 [L438] int tmp_ndt_1; [L439] tmp_ndt_1 = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L451] COND TRUE t1_st == 0 [L452] int tmp_ndt_2; [L453] tmp_ndt_2 = __VERIFIER_nondet_int() [L454] COND TRUE \read(tmp_ndt_2) [L456] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L110] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L121] COND TRUE 1 [L123] t1_pc = 1 [L124] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L465] COND TRUE t2_st == 0 [L466] int tmp_ndt_3; [L467] tmp_ndt_3 = __VERIFIER_nondet_int() [L468] COND TRUE \read(tmp_ndt_3) [L470] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L146] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L157] COND TRUE 1 [L159] t2_pc = 1 [L160] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L479] COND TRUE t3_st == 0 [L480] int tmp_ndt_4; [L481] tmp_ndt_4 = __VERIFIER_nondet_int() [L482] COND TRUE \read(tmp_ndt_4) [L484] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L182] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L193] COND TRUE 1 [L195] t3_pc = 1 [L196] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L493] COND TRUE t4_st == 0 [L494] int tmp_ndt_5; [L495] tmp_ndt_5 = __VERIFIER_nondet_int() [L496] COND TRUE \read(tmp_ndt_5) [L498] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L218] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L229] COND TRUE 1 [L231] t4_pc = 1 [L232] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L427] COND TRUE 1 [L387] int __retres1 ; [L390] COND TRUE m_st == 0 [L391] __retres1 = 1 [L418] return (__retres1); [L430] tmp = exists_runnable_thread() [L432] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L437] COND TRUE m_st == 0 [L438] int tmp_ndt_1; [L439] tmp_ndt_1 = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp_ndt_1) [L442] m_st = 1 [L52] int tmp_var = __VERIFIER_nondet_int(); [L54] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L65] COND TRUE 1 [L68] token = __VERIFIER_nondet_int() [L69] local = token [L70] E_1 = 1 [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L254] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L264] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND FALSE !(\read(tmp)) [L270] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L273] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L274] COND TRUE E_1 == 1 [L275] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND TRUE \read(tmp___0) [L650] t1_st = 0 [L289] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L292] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L293] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L302] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND FALSE !(\read(tmp___1)) [L308] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L311] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L312] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L321] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND FALSE !(\read(tmp___2)) [L327] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L330] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L331] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L340] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND FALSE !(\read(tmp___3)) [L72] E_1 = 2 [L73] m_pc = 1 [L74] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L451] COND TRUE t1_st == 0 [L452] int tmp_ndt_2; [L453] tmp_ndt_2 = __VERIFIER_nondet_int() [L454] COND TRUE \read(tmp_ndt_2) [L456] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L110] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=6] [L113] COND TRUE t1_pc == 1 [L129] token += 1 [L130] E_2 = 1 [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L254] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L255] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L264] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND FALSE !(\read(tmp)) [L270] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L273] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L274] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L283] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND FALSE !(\read(tmp___0)) [L289] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L292] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L293] COND TRUE E_2 == 1 [L294] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND TRUE \read(tmp___1) [L658] t2_st = 0 [L308] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L311] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L312] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L321] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND FALSE !(\read(tmp___2)) [L327] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L330] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L331] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L340] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND FALSE !(\read(tmp___3)) [L132] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L121] COND TRUE 1 [L123] t1_pc = 1 [L124] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L465] COND TRUE t2_st == 0 [L466] int tmp_ndt_3; [L467] tmp_ndt_3 = __VERIFIER_nondet_int() [L468] COND TRUE \read(tmp_ndt_3) [L470] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L146] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=7] [L149] COND TRUE t2_pc == 1 [L165] token += 1 [L166] E_3 = 1 [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L254] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L255] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND FALSE !(\read(tmp)) [L270] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L273] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L274] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L283] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND FALSE !(\read(tmp___0)) [L289] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L292] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L293] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L302] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND FALSE !(\read(tmp___1)) [L308] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L311] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L312] COND TRUE E_3 == 1 [L313] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND TRUE \read(tmp___2) [L666] t3_st = 0 [L327] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L330] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L331] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L340] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=6, 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, token=8] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND FALSE !(\read(tmp___3)) [L168] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=8] [L157] COND TRUE 1 [L159] t2_pc = 1 [L160] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=8] [L479] COND TRUE t3_st == 0 [L480] int tmp_ndt_4; [L481] tmp_ndt_4 = __VERIFIER_nondet_int() [L482] COND TRUE \read(tmp_ndt_4) [L484] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=8] [L182] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=8] [L185] COND TRUE t3_pc == 1 [L201] token += 1 [L202] E_4 = 1 [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L254] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L255] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND FALSE !(\read(tmp)) [L270] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L273] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L274] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L283] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND FALSE !(\read(tmp___0)) [L289] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L292] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L293] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L302] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND FALSE !(\read(tmp___1)) [L308] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L311] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L312] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L321] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND FALSE !(\read(tmp___2)) [L327] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L330] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L331] COND TRUE E_4 == 1 [L332] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=6, 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, token=9] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND TRUE \read(tmp___3) [L674] t4_st = 0 [L204] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=9] [L193] COND TRUE 1 [L195] t3_pc = 1 [L196] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=9] [L493] COND TRUE t4_st == 0 [L494] int tmp_ndt_5; [L495] tmp_ndt_5 = __VERIFIER_nondet_int() [L496] COND TRUE \read(tmp_ndt_5) [L498] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=9] [L218] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, 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, token=9] [L221] COND TRUE t4_pc == 1 [L237] token += 1 [L238] E_M = 1 [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L635] int tmp___3 ; [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, 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, token=10] [L254] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, 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, token=10] [L255] COND TRUE E_M == 1 [L256] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, 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, token=10] [L266] return (__retres1); [L639] tmp = is_master_triggered() [L641] COND TRUE \read(tmp) [L642] m_st = 0 [L270] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L273] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L274] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L283] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L285] return (__retres1); [L647] tmp___0 = is_transmit1_triggered() [L649] COND FALSE !(\read(tmp___0)) [L289] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L292] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L293] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L302] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L304] return (__retres1); [L655] tmp___1 = is_transmit2_triggered() [L657] COND FALSE !(\read(tmp___1)) [L308] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L311] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L312] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L321] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L323] return (__retres1); [L663] tmp___2 = is_transmit3_triggered() [L665] COND FALSE !(\read(tmp___2)) [L327] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L330] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L331] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L340] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L342] return (__retres1); [L671] tmp___3 = is_transmit4_triggered() [L673] COND FALSE !(\read(tmp___3)) [L240] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=10] [L229] COND TRUE 1 [L231] t4_pc = 1 [L232] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L427] COND TRUE 1 [L387] int __retres1 ; [L390] COND TRUE m_st == 0 [L391] __retres1 = 1 [L418] return (__retres1); [L430] tmp = exists_runnable_thread() [L432] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L437] COND TRUE m_st == 0 [L438] int tmp_ndt_1; [L439] tmp_ndt_1 = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp_ndt_1) [L442] m_st = 1 [L52] int tmp_var = __VERIFIER_nondet_int(); [L54] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L57] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L79] COND FALSE !(token != local + 4) [L84] COND TRUE tmp_var <= 5 [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L90] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L91] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L92] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 203 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 114.8s, OverallIterations: 35, TraceHistogramMax: 3, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12290 SDtfs, 10685 SDslu, 16939 SDs, 0 SdLazy, 8575 SolverSat, 437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2387 GetRequests, 2201 SyntacticMatches, 18 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 35.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42865occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 100254 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4048 NumberOfCodeBlocks, 4048 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 4897 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063565 SizeOfPredicates, 51 NumberOfNonLiveVariables, 5183 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 58 InterpolantComputations, 42 PerfectInterpolantSequences, 725/758 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: OVERALL_TIME[ms]: 3181, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 65, DAG_INTERPRETER_EARLY_EXITS: 5, TOOLS_POST_APPLICATIONS: 194, TOOLS_POST_TIME[ms]: 882, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 159, TOOLS_QUANTIFIERELIM_TIME[ms]: 842, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 120, FLUID_QUERY_TIME[ms]: 9, FLUID_QUERIES: 255, FLUID_YES_ANSWERS: 3, DOMAIN_JOIN_APPLICATIONS: 12, DOMAIN_JOIN_TIME[ms]: 1766, DOMAIN_ALPHA_APPLICATIONS: 3, DOMAIN_ALPHA_TIME[ms]: 183, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 65, DOMAIN_ISBOTTOM_TIME[ms]: 144, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 328, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 328, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 7, DAG_COMPRESSION_TIME[ms]: 154, DAG_COMPRESSION_PROCESSED_NODES: 10327, DAG_COMPRESSION_RETAINED_NODES: 309, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...