./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 19:05:56,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 19:05:56,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 19:05:56,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 19:05:56,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 19:05:56,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 19:05:56,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 19:05:56,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 19:05:56,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 19:05:56,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 19:05:56,716 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 19:05:56,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 19:05:56,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 19:05:56,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 19:05:56,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 19:05:56,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 19:05:56,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 19:05:56,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 19:05:56,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 19:05:56,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 19:05:56,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 19:05:56,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 19:05:56,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 19:05:56,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 19:05:56,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 19:05:56,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 19:05:56,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 19:05:56,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 19:05:56,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 19:05:56,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 19:05:56,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 19:05:56,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 19:05:56,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 19:05:56,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 19:05:56,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 19:05:56,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 19:05:56,726 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 19:05:56,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 19:05:56,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 19:05:56,734 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 19:05:56,734 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 19:05:56,734 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 19:05:56,734 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 19:05:56,734 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 19:05:56,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 19:05:56,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 19:05:56,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 19:05:56,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:05:56,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 19:05:56,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2018-12-02 19:05:56,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 19:05:56,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 19:05:56,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 19:05:56,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 19:05:56,768 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 19:05:56,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-12-02 19:05:56,814 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/data/f47931415/d88ba372f7c54d5aae7fcf6c2b688d8b/FLAG9d4e2ddef [2018-12-02 19:05:57,124 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 19:05:57,124 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-12-02 19:05:57,129 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/data/f47931415/d88ba372f7c54d5aae7fcf6c2b688d8b/FLAG9d4e2ddef [2018-12-02 19:05:57,140 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/data/f47931415/d88ba372f7c54d5aae7fcf6c2b688d8b [2018-12-02 19:05:57,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 19:05:57,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 19:05:57,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 19:05:57,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 19:05:57,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 19:05:57,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706fcb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57, skipping insertion in model container [2018-12-02 19:05:57,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 19:05:57,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 19:05:57,298 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:05:57,303 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 19:05:57,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:05:57,341 INFO L195 MainTranslator]: Completed translation [2018-12-02 19:05:57,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57 WrapperNode [2018-12-02 19:05:57,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 19:05:57,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 19:05:57,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 19:05:57,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 19:05:57,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 19:05:57,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 19:05:57,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 19:05:57,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 19:05:57,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... [2018-12-02 19:05:57,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 19:05:57,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 19:05:57,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 19:05:57,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 19:05:57,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:05:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-02 19:05:57,444 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-02 19:05:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-02 19:05:57,444 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-02 19:05:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-02 19:05:57,444 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-02 19:05:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-02 19:05:57,444 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-02 19:05:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 19:05:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 19:05:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 19:05:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 19:05:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-02 19:05:57,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-02 19:05:57,447 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-02 19:05:57,447 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-02 19:05:57,663 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 19:05:57,663 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 19:05:57,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:05:57 BoogieIcfgContainer [2018-12-02 19:05:57,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 19:05:57,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 19:05:57,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 19:05:57,667 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 19:05:57,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:05:57" (1/3) ... [2018-12-02 19:05:57,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c7f2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:05:57, skipping insertion in model container [2018-12-02 19:05:57,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:05:57" (2/3) ... [2018-12-02 19:05:57,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c7f2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:05:57, skipping insertion in model container [2018-12-02 19:05:57,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:05:57" (3/3) ... [2018-12-02 19:05:57,670 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2018-12-02 19:05:57,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 19:05:57,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 19:05:57,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 19:05:57,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 19:05:57,707 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 19:05:57,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 19:05:57,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 19:05:57,708 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 19:05:57,708 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 19:05:57,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 19:05:57,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 19:05:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-12-02 19:05:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 19:05:57,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:57,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:57,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:57,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -20311146, now seen corresponding path program 1 times [2018-12-02 19:05:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:57,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:57,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:57,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:57,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:05:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:05:57,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:57,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:05:57,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:05:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:05:57,904 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2018-12-02 19:05:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:58,149 INFO L93 Difference]: Finished difference Result 286 states and 405 transitions. [2018-12-02 19:05:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:05:58,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 19:05:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:58,159 INFO L225 Difference]: With dead ends: 286 [2018-12-02 19:05:58,159 INFO L226 Difference]: Without dead ends: 154 [2018-12-02 19:05:58,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:05:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-02 19:05:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-12-02 19:05:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 19:05:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2018-12-02 19:05:58,204 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 75 [2018-12-02 19:05:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:58,205 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2018-12-02 19:05:58,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:05:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2018-12-02 19:05:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 19:05:58,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:58,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:58,208 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:58,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash 423589528, now seen corresponding path program 1 times [2018-12-02 19:05:58,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:58,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:58,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:05:58,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:58,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:05:58,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:58,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:05:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:05:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:05:58,277 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 5 states. [2018-12-02 19:05:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:58,474 INFO L93 Difference]: Finished difference Result 279 states and 374 transitions. [2018-12-02 19:05:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:05:58,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 19:05:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:58,476 INFO L225 Difference]: With dead ends: 279 [2018-12-02 19:05:58,476 INFO L226 Difference]: Without dead ends: 168 [2018-12-02 19:05:58,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:05:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-02 19:05:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2018-12-02 19:05:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 19:05:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2018-12-02 19:05:58,491 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 75 [2018-12-02 19:05:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:58,491 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2018-12-02 19:05:58,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:05:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2018-12-02 19:05:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 19:05:58,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:58,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:58,493 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:58,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1961929558, now seen corresponding path program 1 times [2018-12-02 19:05:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:05:58,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:58,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:05:58,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:58,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:05:58,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:05:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:05:58,548 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand 4 states. [2018-12-02 19:05:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:58,644 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2018-12-02 19:05:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:05:58,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-02 19:05:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:58,646 INFO L225 Difference]: With dead ends: 339 [2018-12-02 19:05:58,646 INFO L226 Difference]: Without dead ends: 229 [2018-12-02 19:05:58,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:05:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-02 19:05:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2018-12-02 19:05:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-02 19:05:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2018-12-02 19:05:58,664 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 75 [2018-12-02 19:05:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:58,664 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2018-12-02 19:05:58,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:05:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2018-12-02 19:05:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 19:05:58,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:58,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:58,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:58,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1088451863, now seen corresponding path program 1 times [2018-12-02 19:05:58,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:05:58,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:58,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:05:58,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:58,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:05:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:05:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:05:58,703 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand 6 states. [2018-12-02 19:05:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:58,750 INFO L93 Difference]: Finished difference Result 438 states and 566 transitions. [2018-12-02 19:05:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:05:58,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-02 19:05:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:58,752 INFO L225 Difference]: With dead ends: 438 [2018-12-02 19:05:58,752 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 19:05:58,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:05:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 19:05:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-12-02 19:05:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-02 19:05:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2018-12-02 19:05:58,768 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 75 [2018-12-02 19:05:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:58,768 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2018-12-02 19:05:58,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:05:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2018-12-02 19:05:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 19:05:58,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:58,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:58,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:58,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -756915303, now seen corresponding path program 1 times [2018-12-02 19:05:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:05:58,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:58,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:05:58,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:58,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:05:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:05:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:05:58,833 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand 4 states. [2018-12-02 19:05:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:58,936 INFO L93 Difference]: Finished difference Result 633 states and 828 transitions. [2018-12-02 19:05:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:05:58,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-02 19:05:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:58,938 INFO L225 Difference]: With dead ends: 633 [2018-12-02 19:05:58,938 INFO L226 Difference]: Without dead ends: 424 [2018-12-02 19:05:58,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:05:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-02 19:05:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2018-12-02 19:05:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-02 19:05:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 525 transitions. [2018-12-02 19:05:58,959 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 525 transitions. Word has length 75 [2018-12-02 19:05:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:58,960 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 525 transitions. [2018-12-02 19:05:58,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:05:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 525 transitions. [2018-12-02 19:05:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 19:05:58,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:58,961 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:58,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:58,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash 4572085, now seen corresponding path program 1 times [2018-12-02 19:05:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:58,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 19:05:58,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:58,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:05:58,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:58,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:05:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:05:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:05:58,994 INFO L87 Difference]: Start difference. First operand 421 states and 525 transitions. Second operand 6 states. [2018-12-02 19:05:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:59,026 INFO L93 Difference]: Finished difference Result 836 states and 1062 transitions. [2018-12-02 19:05:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:05:59,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 19:05:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:59,028 INFO L225 Difference]: With dead ends: 836 [2018-12-02 19:05:59,028 INFO L226 Difference]: Without dead ends: 435 [2018-12-02 19:05:59,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:05:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-02 19:05:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-12-02 19:05:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-02 19:05:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 533 transitions. [2018-12-02 19:05:59,052 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 533 transitions. Word has length 93 [2018-12-02 19:05:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:59,052 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 533 transitions. [2018-12-02 19:05:59,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:05:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 533 transitions. [2018-12-02 19:05:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 19:05:59,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:59,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:59,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:59,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1943734131, now seen corresponding path program 1 times [2018-12-02 19:05:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 19:05:59,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:59,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:05:59,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:59,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:05:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:05:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:05:59,100 INFO L87 Difference]: Start difference. First operand 431 states and 533 transitions. Second operand 5 states. [2018-12-02 19:05:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:59,266 INFO L93 Difference]: Finished difference Result 841 states and 1048 transitions. [2018-12-02 19:05:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:05:59,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 19:05:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:59,268 INFO L225 Difference]: With dead ends: 841 [2018-12-02 19:05:59,269 INFO L226 Difference]: Without dead ends: 431 [2018-12-02 19:05:59,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:05:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-02 19:05:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-12-02 19:05:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-02 19:05:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2018-12-02 19:05:59,296 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 93 [2018-12-02 19:05:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:59,296 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2018-12-02 19:05:59,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:05:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2018-12-02 19:05:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 19:05:59,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:59,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:59,297 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:59,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1046340853, now seen corresponding path program 1 times [2018-12-02 19:05:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 19:05:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:05:59,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:05:59,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:05:59,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:05:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:05:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:05:59,355 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand 5 states. [2018-12-02 19:05:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:05:59,597 INFO L93 Difference]: Finished difference Result 908 states and 1116 transitions. [2018-12-02 19:05:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:05:59,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 19:05:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:05:59,600 INFO L225 Difference]: With dead ends: 908 [2018-12-02 19:05:59,600 INFO L226 Difference]: Without dead ends: 498 [2018-12-02 19:05:59,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:05:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-02 19:05:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2018-12-02 19:05:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-02 19:05:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 589 transitions. [2018-12-02 19:05:59,621 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 589 transitions. Word has length 93 [2018-12-02 19:05:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:05:59,621 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 589 transitions. [2018-12-02 19:05:59,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:05:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 589 transitions. [2018-12-02 19:05:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 19:05:59,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:05:59,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:05:59,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:05:59,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1294487347, now seen corresponding path program 1 times [2018-12-02 19:05:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:05:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:05:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:05:59,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:05:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:05:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 19:05:59,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:05:59,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 19:05:59,647 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-12-02 19:05:59,649 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [20], [22], [25], [36], [38], [44], [47], [50], [59], [60], [65], [71], [77], [79], [80], [90], [92], [94], [95], [98], [104], [108], [109], [114], [161], [162], [174], [183], [186], [189], [204], [208], [211], [223], [237], [239], [273], [279], [285], [287], [288], [289], [299], [301], [303], [304], [327], [328], [329], [330], [331], [332], [333], [337], [338], [339], [345], [346], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [381], [382], [383] [2018-12-02 19:05:59,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 19:05:59,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 19:05:59,818 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 19:05:59,819 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Performed 323 root evaluator evaluations with a maximum evaluation depth of 3. Performed 323 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-12-02 19:05:59,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:05:59,825 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 19:05:59,943 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 69.71% of their original sizes. [2018-12-02 19:05:59,943 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 19:06:00,095 INFO L418 sIntCurrentIteration]: We unified 92 AI predicates to 92 [2018-12-02 19:06:00,095 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 19:06:00,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 19:06:00,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [3] total 23 [2018-12-02 19:06:00,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:06:00,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 19:06:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 19:06:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-02 19:06:00,097 INFO L87 Difference]: Start difference. First operand 494 states and 589 transitions. Second operand 22 states. [2018-12-02 19:06:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:06:01,240 INFO L93 Difference]: Finished difference Result 941 states and 1129 transitions. [2018-12-02 19:06:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 19:06:01,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-12-02 19:06:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:06:01,241 INFO L225 Difference]: With dead ends: 941 [2018-12-02 19:06:01,241 INFO L226 Difference]: Without dead ends: 462 [2018-12-02 19:06:01,243 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 19:06:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-02 19:06:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2018-12-02 19:06:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-12-02 19:06:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 533 transitions. [2018-12-02 19:06:01,259 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 533 transitions. Word has length 93 [2018-12-02 19:06:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:06:01,259 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 533 transitions. [2018-12-02 19:06:01,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 19:06:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 533 transitions. [2018-12-02 19:06:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:06:01,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:06:01,259 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:06:01,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:06:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:06:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 518158297, now seen corresponding path program 1 times [2018-12-02 19:06:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:06:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:06:01,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:06:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:06:01,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:06:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:06:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 19:06:01,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 19:06:01,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 19:06:01,281 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-12-02 19:06:01,281 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [20], [22], [25], [36], [38], [44], [47], [50], [59], [60], [65], [71], [77], [79], [80], [90], [92], [94], [95], [98], [104], [108], [109], [114], [161], [162], [174], [183], [186], [189], [195], [201], [204], [208], [211], [223], [237], [239], [273], [279], [285], [287], [288], [289], [299], [301], [303], [304], [327], [328], [329], [330], [331], [332], [333], [337], [338], [339], [345], [346], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [381], [382], [383] [2018-12-02 19:06:01,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 19:06:01,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 19:06:01,311 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 19:06:01,311 INFO L272 AbstractInterpreter]: Visited 79 different actions 92 times. Merged at 7 different actions 7 times. Never widened. Performed 505 root evaluator evaluations with a maximum evaluation depth of 3. Performed 505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 19:06:01,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:06:01,314 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 19:06:01,360 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 72.77% of their original sizes. [2018-12-02 19:06:01,360 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 19:06:01,531 INFO L418 sIntCurrentIteration]: We unified 93 AI predicates to 93 [2018-12-02 19:06:01,531 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 19:06:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 19:06:01,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [3] total 29 [2018-12-02 19:06:01,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:06:01,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 19:06:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 19:06:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-12-02 19:06:01,532 INFO L87 Difference]: Start difference. First operand 459 states and 533 transitions. Second operand 28 states. [2018-12-02 19:06:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:06:04,332 INFO L93 Difference]: Finished difference Result 1346 states and 1723 transitions. [2018-12-02 19:06:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 19:06:04,332 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-12-02 19:06:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:06:04,333 INFO L225 Difference]: With dead ends: 1346 [2018-12-02 19:06:04,333 INFO L226 Difference]: Without dead ends: 347 [2018-12-02 19:06:04,335 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=623, Invalid=2457, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 19:06:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-02 19:06:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 335. [2018-12-02 19:06:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-02 19:06:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 387 transitions. [2018-12-02 19:06:04,348 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 387 transitions. Word has length 94 [2018-12-02 19:06:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:06:04,348 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 387 transitions. [2018-12-02 19:06:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 19:06:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 387 transitions. [2018-12-02 19:06:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 19:06:04,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:06:04,349 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:06:04,349 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:06:04,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:06:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash -249854126, now seen corresponding path program 1 times [2018-12-02 19:06:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:06:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:06:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:06:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:06:04,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:06:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:06:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:06:04,387 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 19:06:04,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:06:04 BoogieIcfgContainer [2018-12-02 19:06:04,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 19:06:04,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 19:06:04,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 19:06:04,430 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 19:06:04,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:05:57" (3/4) ... [2018-12-02 19:06:04,432 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 19:06:04,479 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8a6b5315-dd16-47a1-ad85-0cd2644a22d1/bin-2019/utaipan/witness.graphml [2018-12-02 19:06:04,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 19:06:04,480 INFO L168 Benchmark]: Toolchain (without parser) took 7337.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,481 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:06:04,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.64 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 938.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:06:04,481 INFO L168 Benchmark]: Boogie Preprocessor took 54.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 938.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,481 INFO L168 Benchmark]: RCFGBuilder took 252.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,482 INFO L168 Benchmark]: TraceAbstraction took 6765.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,482 INFO L168 Benchmark]: Witness Printer took 49.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-02 19:06:04,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.64 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 938.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 938.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6765.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=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, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. UNSAFE Result, 6.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1976 SDtfs, 2834 SDslu, 4393 SDs, 0 SdLazy, 1902 SolverSat, 1005 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 296 GetRequests, 162 SyntacticMatches, 14 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9793677888414732 AbsIntWeakeningRatio, 0.5135135135135135 AbsIntAvgWeakeningVarsNumRemoved, 9.81081081081081 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 98 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 99359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 64/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...