./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG --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 f94af16423e70ac832692bc3dd00d5592aa958be278f5f5974191233d98edf62 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1-dev-b2eff8b [2021-10-29 05:20:17,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:20:17,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:20:17,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:20:17,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:20:17,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:20:17,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:20:17,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:20:17,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:20:17,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:20:17,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:20:17,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:20:17,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:20:17,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:20:17,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:20:17,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:20:17,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:20:17,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:20:17,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:20:17,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:20:17,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:20:17,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:20:17,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:20:17,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:20:17,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:20:17,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:20:17,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:20:17,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:20:17,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:20:17,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:20:17,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:20:17,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:20:17,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:20:17,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:20:17,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:20:17,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:20:17,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:20:17,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:20:17,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:20:17,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:20:17,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:20:17,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:20:17,699 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:20:17,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:20:17,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:20:17,701 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:20:17,702 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:20:17,702 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:20:17,702 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:20:17,703 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:20:17,703 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:20:17,703 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:20:17,704 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:20:17,704 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:20:17,705 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:20:17,705 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:20:17,705 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:20:17,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:20:17,707 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:20:17,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:20:17,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:20:17,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:20:17,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:20:17,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:20:17,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:20:17,710 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:20:17,710 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:20:17,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:20:17,711 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:20:17,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:20:17,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:20:17,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:20:17,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:20:17,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:20:17,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:20:17,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:20:17,713 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:20:17,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:20:17,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:20:17,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:20:17,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:20:17,714 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_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/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_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG 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 -> f94af16423e70ac832692bc3dd00d5592aa958be278f5f5974191233d98edf62 [2021-10-29 05:20:18,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:20:18,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:20:18,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:20:18,052 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:20:18,053 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:20:18,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-29 05:20:18,117 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/data/3591251ae/88bc656516194ae3b590da4537f99d17/FLAG254dbb4fb [2021-10-29 05:20:18,603 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:20:18,604 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-29 05:20:18,627 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/data/3591251ae/88bc656516194ae3b590da4537f99d17/FLAG254dbb4fb [2021-10-29 05:20:18,974 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/data/3591251ae/88bc656516194ae3b590da4537f99d17 [2021-10-29 05:20:18,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:20:18,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:20:18,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:20:18,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:20:18,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:20:18,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:20:18" (1/1) ... [2021-10-29 05:20:18,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179469bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:18, skipping insertion in model container [2021-10-29 05:20:18,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:20:18" (1/1) ... [2021-10-29 05:20:18,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:20:19,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:20:19,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-29 05:20:19,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:20:19,290 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:20:19,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-29 05:20:19,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:20:19,377 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:20:19,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19 WrapperNode [2021-10-29 05:20:19,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:20:19,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:20:19,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:20:19,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:20:19,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:20:19,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:20:19,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:20:19,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:20:19,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:20:19,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:20:19,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:20:19,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:20:19,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (1/1) ... [2021-10-29 05:20:19,589 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:20:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:20:19,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:20:19,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:20:19,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:20:19,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:20:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:20:19,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:20:21,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:20:21,593 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-10-29 05:20:21,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:20:21 BoogieIcfgContainer [2021-10-29 05:20:21,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:20:21,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:20:21,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:20:21,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:20:21,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:20:18" (1/3) ... [2021-10-29 05:20:21,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2058a1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:20:21, skipping insertion in model container [2021-10-29 05:20:21,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:20:19" (2/3) ... [2021-10-29 05:20:21,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2058a1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:20:21, skipping insertion in model container [2021-10-29 05:20:21,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:20:21" (3/3) ... [2021-10-29 05:20:21,608 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-10-29 05:20:21,613 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:20:21,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-29 05:20:21,673 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:20:21,682 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:20:21,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-29 05:20:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:20:21,715 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:21,716 INFO L513 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] [2021-10-29 05:20:21,716 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1681053004, now seen corresponding path program 1 times [2021-10-29 05:20:21,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:21,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550731965] [2021-10-29 05:20:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:21,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:21,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:21,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550731965] [2021-10-29 05:20:21,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550731965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:21,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:21,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:20:21,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852462309] [2021-10-29 05:20:21,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:21,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:21,977 INFO L87 Difference]: Start difference. First operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:22,131 INFO L93 Difference]: Finished difference Result 415 states and 637 transitions. [2021-10-29 05:20:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:20:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:22,157 INFO L225 Difference]: With dead ends: 415 [2021-10-29 05:20:22,158 INFO L226 Difference]: Without dead ends: 263 [2021-10-29 05:20:22,163 INFO L786 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 [2021-10-29 05:20:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-29 05:20:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2021-10-29 05:20:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 248 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2021-10-29 05:20:22,248 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 22 [2021-10-29 05:20:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:22,249 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2021-10-29 05:20:22,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2021-10-29 05:20:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:20:22,259 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:22,259 INFO L513 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] [2021-10-29 05:20:22,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:20:22,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -15810102, now seen corresponding path program 1 times [2021-10-29 05:20:22,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:22,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692891128] [2021-10-29 05:20:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:22,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:20:22,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:22,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692891128] [2021-10-29 05:20:22,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692891128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:22,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:22,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:22,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939759115] [2021-10-29 05:20:22,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:22,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:22,398 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:22,537 INFO L93 Difference]: Finished difference Result 789 states and 1161 transitions. [2021-10-29 05:20:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 05:20:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:22,542 INFO L225 Difference]: With dead ends: 789 [2021-10-29 05:20:22,542 INFO L226 Difference]: Without dead ends: 549 [2021-10-29 05:20:22,548 INFO L786 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 [2021-10-29 05:20:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-10-29 05:20:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 435. [2021-10-29 05:20:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 433 states have (on average 1.466512702078522) internal successors, (635), 434 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 635 transitions. [2021-10-29 05:20:22,602 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 635 transitions. Word has length 43 [2021-10-29 05:20:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 635 transitions. [2021-10-29 05:20:22,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 635 transitions. [2021-10-29 05:20:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:20:22,606 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:22,606 INFO L513 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] [2021-10-29 05:20:22,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:20:22,607 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1780626711, now seen corresponding path program 1 times [2021-10-29 05:20:22,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:22,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127978833] [2021-10-29 05:20:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:22,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:20:22,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:22,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127978833] [2021-10-29 05:20:22,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127978833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:22,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:22,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:20:22,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922398325] [2021-10-29 05:20:22,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:22,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:22,680 INFO L87 Difference]: Start difference. First operand 435 states and 635 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:22,736 INFO L93 Difference]: Finished difference Result 1201 states and 1753 transitions. [2021-10-29 05:20:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 05:20:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:22,741 INFO L225 Difference]: With dead ends: 1201 [2021-10-29 05:20:22,742 INFO L226 Difference]: Without dead ends: 778 [2021-10-29 05:20:22,743 INFO L786 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 [2021-10-29 05:20:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-10-29 05:20:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 770. [2021-10-29 05:20:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 1.4401041666666667) internal successors, (1106), 769 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1106 transitions. [2021-10-29 05:20:22,772 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1106 transitions. Word has length 43 [2021-10-29 05:20:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:22,772 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1106 transitions. [2021-10-29 05:20:22,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1106 transitions. [2021-10-29 05:20:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:20:22,775 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:22,775 INFO L513 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] [2021-10-29 05:20:22,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:20:22,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -66578295, now seen corresponding path program 1 times [2021-10-29 05:20:22,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:22,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830507427] [2021-10-29 05:20:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:22,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:22,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:22,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830507427] [2021-10-29 05:20:22,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830507427] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:22,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:22,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:22,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864932371] [2021-10-29 05:20:22,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:22,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:22,911 INFO L87 Difference]: Start difference. First operand 770 states and 1106 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:23,086 INFO L93 Difference]: Finished difference Result 2528 states and 3592 transitions. [2021-10-29 05:20:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:23,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 05:20:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:23,098 INFO L225 Difference]: With dead ends: 2528 [2021-10-29 05:20:23,099 INFO L226 Difference]: Without dead ends: 1763 [2021-10-29 05:20:23,101 INFO L786 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 [2021-10-29 05:20:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-10-29 05:20:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1369. [2021-10-29 05:20:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 1.415508412582297) internal successors, (1935), 1368 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1935 transitions. [2021-10-29 05:20:23,168 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1935 transitions. Word has length 43 [2021-10-29 05:20:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:23,169 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1935 transitions. [2021-10-29 05:20:23,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1935 transitions. [2021-10-29 05:20:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:20:23,171 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:23,171 INFO L513 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] [2021-10-29 05:20:23,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:20:23,172 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 594755496, now seen corresponding path program 1 times [2021-10-29 05:20:23,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:23,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075577347] [2021-10-29 05:20:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:23,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:23,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:23,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075577347] [2021-10-29 05:20:23,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075577347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:23,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:23,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:23,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053743657] [2021-10-29 05:20:23,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:23,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:23,229 INFO L87 Difference]: Start difference. First operand 1369 states and 1935 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:23,311 INFO L93 Difference]: Finished difference Result 2373 states and 3433 transitions. [2021-10-29 05:20:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:23,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 05:20:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:23,321 INFO L225 Difference]: With dead ends: 2373 [2021-10-29 05:20:23,321 INFO L226 Difference]: Without dead ends: 1589 [2021-10-29 05:20:23,323 INFO L786 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 [2021-10-29 05:20:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-10-29 05:20:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1501. [2021-10-29 05:20:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1499 states have (on average 1.4402935290193462) internal successors, (2159), 1500 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2159 transitions. [2021-10-29 05:20:23,412 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2159 transitions. Word has length 43 [2021-10-29 05:20:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:23,412 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2159 transitions. [2021-10-29 05:20:23,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2159 transitions. [2021-10-29 05:20:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-29 05:20:23,416 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:23,416 INFO L513 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] [2021-10-29 05:20:23,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:20:23,417 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1551422771, now seen corresponding path program 1 times [2021-10-29 05:20:23,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:23,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251421654] [2021-10-29 05:20:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:23,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:23,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:23,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251421654] [2021-10-29 05:20:23,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251421654] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:23,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:23,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:23,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056533204] [2021-10-29 05:20:23,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:23,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:23,482 INFO L87 Difference]: Start difference. First operand 1501 states and 2159 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:23,563 INFO L93 Difference]: Finished difference Result 2517 states and 3645 transitions. [2021-10-29 05:20:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-29 05:20:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:23,573 INFO L225 Difference]: With dead ends: 2517 [2021-10-29 05:20:23,573 INFO L226 Difference]: Without dead ends: 1601 [2021-10-29 05:20:23,575 INFO L786 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 [2021-10-29 05:20:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2021-10-29 05:20:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1501. [2021-10-29 05:20:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1499 states have (on average 1.4056037358238826) internal successors, (2107), 1500 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2107 transitions. [2021-10-29 05:20:23,673 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2107 transitions. Word has length 62 [2021-10-29 05:20:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:23,674 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2107 transitions. [2021-10-29 05:20:23,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2107 transitions. [2021-10-29 05:20:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-29 05:20:23,678 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:23,678 INFO L513 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] [2021-10-29 05:20:23,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:20:23,678 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1153149548, now seen corresponding path program 1 times [2021-10-29 05:20:23,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:23,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934245640] [2021-10-29 05:20:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:23,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:20:23,759 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:23,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934245640] [2021-10-29 05:20:23,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934245640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:23,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:23,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:23,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075647949] [2021-10-29 05:20:23,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:23,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:23,762 INFO L87 Difference]: Start difference. First operand 1501 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:24,011 INFO L93 Difference]: Finished difference Result 5161 states and 7285 transitions. [2021-10-29 05:20:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-29 05:20:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:24,034 INFO L225 Difference]: With dead ends: 5161 [2021-10-29 05:20:24,034 INFO L226 Difference]: Without dead ends: 3673 [2021-10-29 05:20:24,064 INFO L786 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 [2021-10-29 05:20:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2021-10-29 05:20:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 2785. [2021-10-29 05:20:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.393819619116062) internal successors, (3879), 2784 states have internal predecessors, (3879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3879 transitions. [2021-10-29 05:20:24,216 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3879 transitions. Word has length 62 [2021-10-29 05:20:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:24,216 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 3879 transitions. [2021-10-29 05:20:24,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3879 transitions. [2021-10-29 05:20:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-29 05:20:24,222 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:24,222 INFO L513 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] [2021-10-29 05:20:24,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:20:24,223 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2017211270, now seen corresponding path program 1 times [2021-10-29 05:20:24,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:24,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370791887] [2021-10-29 05:20:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:24,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:24,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:24,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370791887] [2021-10-29 05:20:24,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370791887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:24,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:24,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:20:24,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349163444] [2021-10-29 05:20:24,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:24,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:24,294 INFO L87 Difference]: Start difference. First operand 2785 states and 3879 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:24,562 INFO L93 Difference]: Finished difference Result 6061 states and 8622 transitions. [2021-10-29 05:20:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:20:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-29 05:20:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:24,584 INFO L225 Difference]: With dead ends: 6061 [2021-10-29 05:20:24,584 INFO L226 Difference]: Without dead ends: 3289 [2021-10-29 05:20:24,590 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-10-29 05:20:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2258. [2021-10-29 05:20:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2256 states have (on average 1.4184397163120568) internal successors, (3200), 2257 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3200 transitions. [2021-10-29 05:20:24,733 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3200 transitions. Word has length 63 [2021-10-29 05:20:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:24,734 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3200 transitions. [2021-10-29 05:20:24,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3200 transitions. [2021-10-29 05:20:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-29 05:20:24,740 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:24,740 INFO L513 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] [2021-10-29 05:20:24,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:20:24,740 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1454758849, now seen corresponding path program 1 times [2021-10-29 05:20:24,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:24,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371200870] [2021-10-29 05:20:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:24,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:24,842 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:24,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371200870] [2021-10-29 05:20:24,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371200870] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:24,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:24,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:24,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171272089] [2021-10-29 05:20:24,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:24,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:24,849 INFO L87 Difference]: Start difference. First operand 2258 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:24,987 INFO L93 Difference]: Finished difference Result 4502 states and 6386 transitions. [2021-10-29 05:20:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-29 05:20:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:25,006 INFO L225 Difference]: With dead ends: 4502 [2021-10-29 05:20:25,007 INFO L226 Difference]: Without dead ends: 2258 [2021-10-29 05:20:25,014 INFO L786 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 [2021-10-29 05:20:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2021-10-29 05:20:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2021-10-29 05:20:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2256 states have (on average 1.400709219858156) internal successors, (3160), 2257 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3160 transitions. [2021-10-29 05:20:25,142 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3160 transitions. Word has length 65 [2021-10-29 05:20:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:25,143 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3160 transitions. [2021-10-29 05:20:25,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3160 transitions. [2021-10-29 05:20:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-29 05:20:25,148 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:25,149 INFO L513 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] [2021-10-29 05:20:25,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:20:25,149 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 481269890, now seen corresponding path program 1 times [2021-10-29 05:20:25,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:25,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812943072] [2021-10-29 05:20:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:25,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:25,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:25,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812943072] [2021-10-29 05:20:25,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812943072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:25,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:25,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:25,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232197273] [2021-10-29 05:20:25,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:25,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:25,231 INFO L87 Difference]: Start difference. First operand 2258 states and 3160 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:25,371 INFO L93 Difference]: Finished difference Result 3860 states and 5419 transitions. [2021-10-29 05:20:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-29 05:20:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:25,382 INFO L225 Difference]: With dead ends: 3860 [2021-10-29 05:20:25,383 INFO L226 Difference]: Without dead ends: 1616 [2021-10-29 05:20:25,386 INFO L786 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 [2021-10-29 05:20:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2021-10-29 05:20:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1597. [2021-10-29 05:20:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.3692789968652037) internal successors, (2184), 1596 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2184 transitions. [2021-10-29 05:20:25,485 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2184 transitions. Word has length 65 [2021-10-29 05:20:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:25,486 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2184 transitions. [2021-10-29 05:20:25,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2184 transitions. [2021-10-29 05:20:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-29 05:20:25,494 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:25,495 INFO L513 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] [2021-10-29 05:20:25,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:20:25,495 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1578794294, now seen corresponding path program 1 times [2021-10-29 05:20:25,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:25,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820186607] [2021-10-29 05:20:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:25,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:20:25,615 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:25,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820186607] [2021-10-29 05:20:25,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820186607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:25,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:25,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:25,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630324287] [2021-10-29 05:20:25,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:25,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:25,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:25,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:25,619 INFO L87 Difference]: Start difference. First operand 1597 states and 2184 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:25,728 INFO L93 Difference]: Finished difference Result 2657 states and 3657 transitions. [2021-10-29 05:20:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-10-29 05:20:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:25,738 INFO L225 Difference]: With dead ends: 2657 [2021-10-29 05:20:25,739 INFO L226 Difference]: Without dead ends: 1670 [2021-10-29 05:20:25,741 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-10-29 05:20:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1597. [2021-10-29 05:20:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.3510971786833856) internal successors, (2155), 1596 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2155 transitions. [2021-10-29 05:20:25,854 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2155 transitions. Word has length 66 [2021-10-29 05:20:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:25,854 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2155 transitions. [2021-10-29 05:20:25,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2155 transitions. [2021-10-29 05:20:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-29 05:20:25,861 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:25,861 INFO L513 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] [2021-10-29 05:20:25,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:20:25,862 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash 617875508, now seen corresponding path program 1 times [2021-10-29 05:20:25,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:25,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400646258] [2021-10-29 05:20:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:25,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:20:25,923 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:25,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400646258] [2021-10-29 05:20:25,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400646258] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:25,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:25,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:20:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102975811] [2021-10-29 05:20:25,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:25,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:25,926 INFO L87 Difference]: Start difference. First operand 1597 states and 2155 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:26,099 INFO L93 Difference]: Finished difference Result 2888 states and 3904 transitions. [2021-10-29 05:20:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-10-29 05:20:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:26,110 INFO L225 Difference]: With dead ends: 2888 [2021-10-29 05:20:26,110 INFO L226 Difference]: Without dead ends: 1901 [2021-10-29 05:20:26,113 INFO L786 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 [2021-10-29 05:20:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2021-10-29 05:20:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1722. [2021-10-29 05:20:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1720 states have (on average 1.316860465116279) internal successors, (2265), 1721 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2265 transitions. [2021-10-29 05:20:26,240 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2265 transitions. Word has length 67 [2021-10-29 05:20:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:26,241 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 2265 transitions. [2021-10-29 05:20:26,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2265 transitions. [2021-10-29 05:20:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-29 05:20:26,247 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:26,248 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:26,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:20:26,248 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1755670380, now seen corresponding path program 1 times [2021-10-29 05:20:26,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:26,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904232102] [2021-10-29 05:20:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:26,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:26,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:26,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904232102] [2021-10-29 05:20:26,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904232102] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:20:26,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691135091] [2021-10-29 05:20:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:26,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:20:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:20:26,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:20:26,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 05:20:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:26,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 05:20:26,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:20:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:26,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:20:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:26,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691135091] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:26,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:20:26,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 05:20:26,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663210989] [2021-10-29 05:20:26,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:26,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:26,790 INFO L87 Difference]: Start difference. First operand 1722 states and 2265 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:26,967 INFO L93 Difference]: Finished difference Result 3545 states and 4707 transitions. [2021-10-29 05:20:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:26,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-29 05:20:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:26,981 INFO L225 Difference]: With dead ends: 3545 [2021-10-29 05:20:26,981 INFO L226 Difference]: Without dead ends: 2385 [2021-10-29 05:20:26,984 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2021-10-29 05:20:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1893. [2021-10-29 05:20:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 1.337916446324696) internal successors, (2530), 1892 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2530 transitions. [2021-10-29 05:20:27,135 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2530 transitions. Word has length 70 [2021-10-29 05:20:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:27,136 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2530 transitions. [2021-10-29 05:20:27,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2530 transitions. [2021-10-29 05:20:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-29 05:20:27,140 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:27,141 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:27,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 05:20:27,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-29 05:20:27,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1855930243, now seen corresponding path program 1 times [2021-10-29 05:20:27,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:27,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814637967] [2021-10-29 05:20:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:27,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:20:27,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:27,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814637967] [2021-10-29 05:20:27,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814637967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:27,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:27,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:27,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450917068] [2021-10-29 05:20:27,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:27,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:27,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:27,403 INFO L87 Difference]: Start difference. First operand 1893 states and 2530 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:27,604 INFO L93 Difference]: Finished difference Result 4413 states and 5975 transitions. [2021-10-29 05:20:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-29 05:20:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:27,619 INFO L225 Difference]: With dead ends: 4413 [2021-10-29 05:20:27,620 INFO L226 Difference]: Without dead ends: 2534 [2021-10-29 05:20:27,623 INFO L786 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 [2021-10-29 05:20:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2021-10-29 05:20:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2261. [2021-10-29 05:20:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2259 states have (on average 1.372731297034086) internal successors, (3101), 2260 states have internal predecessors, (3101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3101 transitions. [2021-10-29 05:20:27,769 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3101 transitions. Word has length 70 [2021-10-29 05:20:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:27,769 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 3101 transitions. [2021-10-29 05:20:27,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3101 transitions. [2021-10-29 05:20:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 05:20:27,775 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:27,775 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:27,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:20:27,775 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 229338890, now seen corresponding path program 1 times [2021-10-29 05:20:27,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:27,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390546141] [2021-10-29 05:20:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:27,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:27,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:27,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390546141] [2021-10-29 05:20:27,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390546141] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:27,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:27,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:27,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466445068] [2021-10-29 05:20:27,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:27,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:27,852 INFO L87 Difference]: Start difference. First operand 2261 states and 3101 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:28,007 INFO L93 Difference]: Finished difference Result 3881 states and 5364 transitions. [2021-10-29 05:20:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-10-29 05:20:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:28,032 INFO L225 Difference]: With dead ends: 3881 [2021-10-29 05:20:28,033 INFO L226 Difference]: Without dead ends: 2268 [2021-10-29 05:20:28,036 INFO L786 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 [2021-10-29 05:20:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2021-10-29 05:20:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2236. [2021-10-29 05:20:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2234 states have (on average 1.3307967770814682) internal successors, (2973), 2235 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2973 transitions. [2021-10-29 05:20:28,191 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2973 transitions. Word has length 71 [2021-10-29 05:20:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:28,191 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2973 transitions. [2021-10-29 05:20:28,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2973 transitions. [2021-10-29 05:20:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 05:20:28,197 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:28,197 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:28,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:20:28,197 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1517533419, now seen corresponding path program 1 times [2021-10-29 05:20:28,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:28,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094437315] [2021-10-29 05:20:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:28,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:20:28,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:28,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094437315] [2021-10-29 05:20:28,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094437315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:28,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:28,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:20:28,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349825713] [2021-10-29 05:20:28,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:28,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:28,250 INFO L87 Difference]: Start difference. First operand 2236 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:28,433 INFO L93 Difference]: Finished difference Result 3819 states and 5096 transitions. [2021-10-29 05:20:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:28,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-10-29 05:20:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:28,440 INFO L225 Difference]: With dead ends: 3819 [2021-10-29 05:20:28,441 INFO L226 Difference]: Without dead ends: 2236 [2021-10-29 05:20:28,444 INFO L786 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 [2021-10-29 05:20:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-10-29 05:20:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2021-10-29 05:20:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2234 states have (on average 1.311996418979409) internal successors, (2931), 2235 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2931 transitions. [2021-10-29 05:20:28,604 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2931 transitions. Word has length 71 [2021-10-29 05:20:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:28,605 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2931 transitions. [2021-10-29 05:20:28,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2931 transitions. [2021-10-29 05:20:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-29 05:20:28,611 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:28,611 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:28,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:20:28,611 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 6215176, now seen corresponding path program 1 times [2021-10-29 05:20:28,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:28,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462277083] [2021-10-29 05:20:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:28,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:28,697 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:28,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462277083] [2021-10-29 05:20:28,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462277083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:28,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:28,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:20:28,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785549612] [2021-10-29 05:20:28,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:28,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:28,700 INFO L87 Difference]: Start difference. First operand 2236 states and 2931 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:29,002 INFO L93 Difference]: Finished difference Result 5080 states and 6591 transitions. [2021-10-29 05:20:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-10-29 05:20:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:29,012 INFO L225 Difference]: With dead ends: 5080 [2021-10-29 05:20:29,012 INFO L226 Difference]: Without dead ends: 3497 [2021-10-29 05:20:29,017 INFO L786 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 [2021-10-29 05:20:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-10-29 05:20:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2822. [2021-10-29 05:20:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2820 states have (on average 1.275886524822695) internal successors, (3598), 2821 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3598 transitions. [2021-10-29 05:20:29,232 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3598 transitions. Word has length 73 [2021-10-29 05:20:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:29,233 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 3598 transitions. [2021-10-29 05:20:29,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3598 transitions. [2021-10-29 05:20:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 05:20:29,240 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:29,240 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:29,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:20:29,242 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 543746611, now seen corresponding path program 1 times [2021-10-29 05:20:29,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:29,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705046617] [2021-10-29 05:20:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:29,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:29,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:29,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705046617] [2021-10-29 05:20:29,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705046617] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:20:29,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075510960] [2021-10-29 05:20:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:29,304 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:20:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:20:29,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:20:29,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 05:20:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:29,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 05:20:29,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:20:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:29,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:20:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:29,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075510960] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:29,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:20:29,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 05:20:29,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594488898] [2021-10-29 05:20:29,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:29,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:29,970 INFO L87 Difference]: Start difference. First operand 2822 states and 3598 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:30,214 INFO L93 Difference]: Finished difference Result 6264 states and 7985 transitions. [2021-10-29 05:20:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-10-29 05:20:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:30,223 INFO L225 Difference]: With dead ends: 6264 [2021-10-29 05:20:30,223 INFO L226 Difference]: Without dead ends: 3498 [2021-10-29 05:20:30,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-10-29 05:20:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2965. [2021-10-29 05:20:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2963 states have (on average 1.2824839689503882) internal successors, (3800), 2964 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3800 transitions. [2021-10-29 05:20:30,412 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3800 transitions. Word has length 91 [2021-10-29 05:20:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:30,412 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3800 transitions. [2021-10-29 05:20:30,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3800 transitions. [2021-10-29 05:20:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-29 05:20:30,418 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:30,419 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:30,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 05:20:30,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-29 05:20:30,646 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1830675513, now seen corresponding path program 1 times [2021-10-29 05:20:30,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:30,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839947158] [2021-10-29 05:20:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:30,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:20:30,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:30,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839947158] [2021-10-29 05:20:30,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839947158] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:20:30,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17283515] [2021-10-29 05:20:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:30,704 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:20:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:20:30,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:20:30,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 05:20:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:30,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 05:20:30,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:20:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:20:31,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:20:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:20:31,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17283515] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:31,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:20:31,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 5 [2021-10-29 05:20:31,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879133787] [2021-10-29 05:20:31,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:31,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:31,396 INFO L87 Difference]: Start difference. First operand 2965 states and 3800 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:31,614 INFO L93 Difference]: Finished difference Result 5794 states and 7406 transitions. [2021-10-29 05:20:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-29 05:20:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:31,622 INFO L225 Difference]: With dead ends: 5794 [2021-10-29 05:20:31,622 INFO L226 Difference]: Without dead ends: 3003 [2021-10-29 05:20:31,626 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2021-10-29 05:20:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2965. [2021-10-29 05:20:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2963 states have (on average 1.2645966925413432) internal successors, (3747), 2964 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3747 transitions. [2021-10-29 05:20:31,807 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3747 transitions. Word has length 93 [2021-10-29 05:20:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:31,807 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 3747 transitions. [2021-10-29 05:20:31,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3747 transitions. [2021-10-29 05:20:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 05:20:31,813 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:31,813 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:31,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 05:20:32,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:20:32,028 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -767543943, now seen corresponding path program 1 times [2021-10-29 05:20:32,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:32,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9601865] [2021-10-29 05:20:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:32,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:32,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:32,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9601865] [2021-10-29 05:20:32,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9601865] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:32,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:32,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:20:32,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3433302] [2021-10-29 05:20:32,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:20:32,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:32,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:20:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:20:32,077 INFO L87 Difference]: Start difference. First operand 2965 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:32,245 INFO L93 Difference]: Finished difference Result 5141 states and 6501 transitions. [2021-10-29 05:20:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:20:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-29 05:20:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:32,252 INFO L225 Difference]: With dead ends: 5141 [2021-10-29 05:20:32,252 INFO L226 Difference]: Without dead ends: 2358 [2021-10-29 05:20:32,257 INFO L786 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 [2021-10-29 05:20:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-10-29 05:20:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2326. [2021-10-29 05:20:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2324 states have (on average 1.2220309810671257) internal successors, (2840), 2325 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2840 transitions. [2021-10-29 05:20:32,526 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2840 transitions. Word has length 94 [2021-10-29 05:20:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:32,526 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 2840 transitions. [2021-10-29 05:20:32,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2840 transitions. [2021-10-29 05:20:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 05:20:32,531 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:32,532 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:32,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:20:32,532 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 707507586, now seen corresponding path program 1 times [2021-10-29 05:20:32,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:32,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127893741] [2021-10-29 05:20:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:32,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:32,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:32,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127893741] [2021-10-29 05:20:32,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127893741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:32,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:32,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:20:32,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232539976] [2021-10-29 05:20:32,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:32,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:20:32,595 INFO L87 Difference]: Start difference. First operand 2326 states and 2840 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:32,838 INFO L93 Difference]: Finished difference Result 5014 states and 6029 transitions. [2021-10-29 05:20:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:32,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-10-29 05:20:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:32,847 INFO L225 Difference]: With dead ends: 5014 [2021-10-29 05:20:32,847 INFO L226 Difference]: Without dead ends: 3299 [2021-10-29 05:20:32,851 INFO L786 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 [2021-10-29 05:20:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-10-29 05:20:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2750. [2021-10-29 05:20:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2748 states have (on average 1.1812227074235808) internal successors, (3246), 2749 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3246 transitions. [2021-10-29 05:20:33,085 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3246 transitions. Word has length 96 [2021-10-29 05:20:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:33,086 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 3246 transitions. [2021-10-29 05:20:33,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3246 transitions. [2021-10-29 05:20:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-29 05:20:33,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:33,093 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:33,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:20:33,094 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash -32283515, now seen corresponding path program 1 times [2021-10-29 05:20:33,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:33,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39282752] [2021-10-29 05:20:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:33,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:33,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:33,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39282752] [2021-10-29 05:20:33,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39282752] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:20:33,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177923381] [2021-10-29 05:20:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:33,176 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:20:33,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:20:33,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:20:33,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 05:20:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:33,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 05:20:33,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:20:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:33,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:20:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:34,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177923381] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:34,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:20:34,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 05:20:34,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721171666] [2021-10-29 05:20:34,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:20:34,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:20:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:34,041 INFO L87 Difference]: Start difference. First operand 2750 states and 3246 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:34,341 INFO L93 Difference]: Finished difference Result 5976 states and 7105 transitions. [2021-10-29 05:20:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:20:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-10-29 05:20:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:34,351 INFO L225 Difference]: With dead ends: 5976 [2021-10-29 05:20:34,351 INFO L226 Difference]: Without dead ends: 3464 [2021-10-29 05:20:34,355 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:20:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2021-10-29 05:20:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3037. [2021-10-29 05:20:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3035 states have (on average 1.2125205930807248) internal successors, (3680), 3036 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3680 transitions. [2021-10-29 05:20:34,522 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3680 transitions. Word has length 115 [2021-10-29 05:20:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:34,523 INFO L470 AbstractCegarLoop]: Abstraction has 3037 states and 3680 transitions. [2021-10-29 05:20:34,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3680 transitions. [2021-10-29 05:20:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-29 05:20:34,529 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:34,529 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:34,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 05:20:34,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-29 05:20:34,758 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1918626126, now seen corresponding path program 1 times [2021-10-29 05:20:34,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:34,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37280150] [2021-10-29 05:20:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:34,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:20:34,861 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:34,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37280150] [2021-10-29 05:20:34,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37280150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:34,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:34,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:20:34,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189838711] [2021-10-29 05:20:34,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:20:34,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:20:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:20:34,863 INFO L87 Difference]: Start difference. First operand 3037 states and 3680 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:35,567 INFO L93 Difference]: Finished difference Result 11425 states and 13837 transitions. [2021-10-29 05:20:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:20:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-10-29 05:20:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:35,591 INFO L225 Difference]: With dead ends: 11425 [2021-10-29 05:20:35,591 INFO L226 Difference]: Without dead ends: 10209 [2021-10-29 05:20:35,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:20:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10209 states. [2021-10-29 05:20:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10209 to 5303. [2021-10-29 05:20:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 5301 states have (on average 1.1992076966610075) internal successors, (6357), 5302 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 6357 transitions. [2021-10-29 05:20:36,038 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 6357 transitions. Word has length 118 [2021-10-29 05:20:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:36,038 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 6357 transitions. [2021-10-29 05:20:36,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:20:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 6357 transitions. [2021-10-29 05:20:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-29 05:20:36,049 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:36,050 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:20:36,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:20:36,050 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:20:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash 638708002, now seen corresponding path program 1 times [2021-10-29 05:20:36,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:36,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766643452] [2021-10-29 05:20:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:36,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:20:36,083 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:20:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:20:36,172 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:20:36,173 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:20:36,173 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:36,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:36,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:20:36,179 INFO L731 BasicCegarLoop]: Path program 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] [2021-10-29 05:20:36,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:20:36,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:20:36 BoogieIcfgContainer [2021-10-29 05:20:36,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:20:36,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:20:36,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:20:36,384 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:20:36,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:20:21" (3/4) ... [2021-10-29 05:20:36,387 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:20:36,584 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:20:36,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:20:36,586 INFO L168 Benchmark]: Toolchain (without parser) took 17607.06 ms. Allocated memory was 88.1 MB in the beginning and 589.3 MB in the end (delta: 501.2 MB). Free memory was 49.0 MB in the beginning and 292.0 MB in the end (delta: -243.0 MB). Peak memory consumption was 259.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,586 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 88.1 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:20:36,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.96 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 48.8 MB in the beginning and 86.5 MB in the end (delta: -37.7 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.47 ms. Allocated memory is still 117.4 MB. Free memory was 86.5 MB in the beginning and 83.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,588 INFO L168 Benchmark]: Boogie Preprocessor took 110.31 ms. Allocated memory is still 117.4 MB. Free memory was 82.8 MB in the beginning and 79.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,588 INFO L168 Benchmark]: RCFGBuilder took 2034.69 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 70.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 62.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,589 INFO L168 Benchmark]: TraceAbstraction took 14783.84 ms. Allocated memory was 117.4 MB in the beginning and 589.3 MB in the end (delta: 471.9 MB). Free memory was 70.6 MB in the beginning and 316.4 MB in the end (delta: -245.8 MB). Peak memory consumption was 226.0 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,589 INFO L168 Benchmark]: Witness Printer took 200.12 ms. Allocated memory is still 589.3 MB. Free memory was 316.4 MB in the beginning and 292.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:36,591 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.18 ms. Allocated memory is still 88.1 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 402.96 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 48.8 MB in the beginning and 86.5 MB in the end (delta: -37.7 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.47 ms. Allocated memory is still 117.4 MB. Free memory was 86.5 MB in the beginning and 83.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 110.31 ms. Allocated memory is still 117.4 MB. Free memory was 82.8 MB in the beginning and 79.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2034.69 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 70.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 62.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14783.84 ms. Allocated memory was 117.4 MB in the beginning and 589.3 MB in the end (delta: 471.9 MB). Free memory was 70.6 MB in the beginning and 316.4 MB in the end (delta: -245.8 MB). Peak memory consumption was 226.0 MB. Max. memory is 16.1 GB. * Witness Printer took 200.12 ms. Allocated memory is still 589.3 MB. Free memory was 316.4 MB in the beginning and 292.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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 m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 [L296] COND TRUE m_i == 1 [L297] m_st = 0 [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 [L433] COND FALSE !(M_E == 0) [L438] COND FALSE !(T1_E == 0) [L443] COND FALSE !(T2_E == 0) [L448] COND FALSE !(T3_E == 0) [L453] COND FALSE !(E_M == 0) [L458] COND FALSE !(E_1 == 0) [L463] COND FALSE !(E_2 == 0) [L468] COND FALSE !(E_3 == 0) [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L481] COND FALSE !(M_E == 1) [L486] COND FALSE !(T1_E == 1) [L491] COND FALSE !(T2_E == 1) [L496] COND FALSE !(T3_E == 1) [L501] COND FALSE !(E_M == 1) [L506] COND FALSE !(E_1 == 1) [L511] COND FALSE !(E_2 == 1) [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L682] COND TRUE 1 [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L59] COND TRUE 1 [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L107] COND TRUE t1_pc == 1 [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L143] COND TRUE t2_pc == 1 [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L179] COND TRUE t3_pc == 1 [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L73] COND FALSE !(token != local + 3) [L78] COND TRUE tmp_var <= 5 [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6172 SDtfs, 4837 SDslu, 6567 SDs, 0 SdLazy, 780 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5303occurred in iteration=23, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 10865 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2313 ConstructedInterpolants, 0 QuantifiedInterpolants, 4259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 482/494 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 05:20:36,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2a2e78-5126-48d9-90f2-1b07bc24696b/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...