./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/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 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 09:46:32,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:46:32,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:46:32,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:46:32,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:46:32,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:46:32,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:46:32,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:46:32,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:46:32,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:46:32,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:46:32,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:46:32,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:46:32,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:46:32,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:46:32,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:46:32,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:46:32,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:46:32,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:46:32,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:46:32,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:46:32,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:46:32,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:46:32,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:46:32,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:46:32,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:46:32,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:46:32,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:46:32,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:46:32,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:46:32,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:46:32,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:46:32,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:46:32,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:46:32,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:46:32,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:46:32,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:46:32,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:46:32,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:46:32,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:46:32,895 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:46:32,895 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:46:32,896 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:46:32,896 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:46:32,897 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:46:32,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:46:32,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:46:32,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:46:32,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:46:32,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:46:32,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:46:32,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:46:32,900 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:46:32,901 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_8c61e85e-1698-4dec-8bf3-48d0fd024713/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 -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2018-11-18 09:46:32,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:46:32,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:46:32,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:46:32,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:46:32,936 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:46:32,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c [2018-11-18 09:46:32,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/data/15cd19b38/61f8d3d148974cf7972ae6cc38ccfec3/FLAG4344bcf32 [2018-11-18 09:46:33,394 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:46:33,395 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c [2018-11-18 09:46:33,403 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/data/15cd19b38/61f8d3d148974cf7972ae6cc38ccfec3/FLAG4344bcf32 [2018-11-18 09:46:33,415 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/data/15cd19b38/61f8d3d148974cf7972ae6cc38ccfec3 [2018-11-18 09:46:33,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:46:33,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:46:33,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:33,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:46:33,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:46:33,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33, skipping insertion in model container [2018-11-18 09:46:33,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:46:33,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:46:33,608 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:33,612 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:46:33,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:33,650 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:46:33,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33 WrapperNode [2018-11-18 09:46:33,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:33,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:46:33,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:46:33,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:46:33,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:46:33,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:46:33,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:46:33,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:46:33,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... [2018-11-18 09:46:33,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:46:33,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:46:33,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:46:33,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:46:33,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/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-11-18 09:46:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 09:46:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 09:46:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-18 09:46:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-18 09:46:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:46:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:46:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 09:46:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 09:46:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 09:46:33,770 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 09:46:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-18 09:46:33,770 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-18 09:46:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 09:46:33,770 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 09:46:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 09:46:33,770 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 09:46:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 09:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 09:46:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 09:46:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 09:46:34,159 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:46:34,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:34 BoogieIcfgContainer [2018-11-18 09:46:34,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:46:34,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:46:34,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:46:34,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:46:34,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:46:33" (1/3) ... [2018-11-18 09:46:34,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c90b1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:34, skipping insertion in model container [2018-11-18 09:46:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:33" (2/3) ... [2018-11-18 09:46:34,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c90b1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:34, skipping insertion in model container [2018-11-18 09:46:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:34" (3/3) ... [2018-11-18 09:46:34,164 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_false-unreach-call_false-termination.cil.c [2018-11-18 09:46:34,171 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:46:34,176 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:46:34,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:46:34,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:46:34,206 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:46:34,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:46:34,206 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:46:34,206 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:46:34,206 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:46:34,206 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:46:34,206 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:46:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2018-11-18 09:46:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:34,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:34,231 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:34,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:34,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash -443050728, now seen corresponding path program 1 times [2018-11-18 09:46:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:34,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:34,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:46:34,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:46:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:46:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:34,445 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 4 states. [2018-11-18 09:46:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:34,610 INFO L93 Difference]: Finished difference Result 353 states and 504 transitions. [2018-11-18 09:46:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:46:34,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-18 09:46:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:34,623 INFO L225 Difference]: With dead ends: 353 [2018-11-18 09:46:34,623 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 09:46:34,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 09:46:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-18 09:46:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2018-11-18 09:46:34,665 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 94 [2018-11-18 09:46:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:34,666 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2018-11-18 09:46:34,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:46:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2018-11-18 09:46:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:34,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:34,668 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:34,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:34,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1634286170, now seen corresponding path program 1 times [2018-11-18 09:46:34,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:34,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:34,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:34,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:34,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:34,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:34,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:34,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:34,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:34,767 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand 5 states. [2018-11-18 09:46:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:35,092 INFO L93 Difference]: Finished difference Result 365 states and 510 transitions. [2018-11-18 09:46:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:35,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 09:46:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:35,094 INFO L225 Difference]: With dead ends: 365 [2018-11-18 09:46:35,094 INFO L226 Difference]: Without dead ends: 208 [2018-11-18 09:46:35,095 INFO L604 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-11-18 09:46:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-18 09:46:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 177. [2018-11-18 09:46:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 238 transitions. [2018-11-18 09:46:35,112 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 238 transitions. Word has length 94 [2018-11-18 09:46:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:35,113 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 238 transitions. [2018-11-18 09:46:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 238 transitions. [2018-11-18 09:46:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:35,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:35,114 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:35,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:35,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 666935516, now seen corresponding path program 1 times [2018-11-18 09:46:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:35,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:35,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:35,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:35,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:35,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:35,189 INFO L87 Difference]: Start difference. First operand 177 states and 238 transitions. Second operand 5 states. [2018-11-18 09:46:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:35,456 INFO L93 Difference]: Finished difference Result 363 states and 504 transitions. [2018-11-18 09:46:35,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:35,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 09:46:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:35,458 INFO L225 Difference]: With dead ends: 363 [2018-11-18 09:46:35,458 INFO L226 Difference]: Without dead ends: 206 [2018-11-18 09:46:35,459 INFO L604 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-11-18 09:46:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-18 09:46:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2018-11-18 09:46:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2018-11-18 09:46:35,477 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 94 [2018-11-18 09:46:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:35,478 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2018-11-18 09:46:35,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2018-11-18 09:46:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:35,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:35,480 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:35,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:35,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1719573990, now seen corresponding path program 1 times [2018-11-18 09:46:35,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:35,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:35,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:35,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:35,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:35,550 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 5 states. [2018-11-18 09:46:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:35,816 INFO L93 Difference]: Finished difference Result 382 states and 532 transitions. [2018-11-18 09:46:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:35,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 09:46:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:35,819 INFO L225 Difference]: With dead ends: 382 [2018-11-18 09:46:35,819 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 09:46:35,820 INFO L604 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-11-18 09:46:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 09:46:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 177. [2018-11-18 09:46:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2018-11-18 09:46:35,837 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 94 [2018-11-18 09:46:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:35,837 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2018-11-18 09:46:35,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2018-11-18 09:46:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:35,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:35,838 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:35,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:35,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2082767132, now seen corresponding path program 1 times [2018-11-18 09:46:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:35,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:35,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-11-18 09:46:35,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:35,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:35,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:35,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:35,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:35,891 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand 5 states. [2018-11-18 09:46:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:36,106 INFO L93 Difference]: Finished difference Result 375 states and 520 transitions. [2018-11-18 09:46:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:36,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 09:46:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:36,108 INFO L225 Difference]: With dead ends: 375 [2018-11-18 09:46:36,108 INFO L226 Difference]: Without dead ends: 218 [2018-11-18 09:46:36,108 INFO L604 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-11-18 09:46:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-18 09:46:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2018-11-18 09:46:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 235 transitions. [2018-11-18 09:46:36,124 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 235 transitions. Word has length 94 [2018-11-18 09:46:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:36,124 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 235 transitions. [2018-11-18 09:46:36,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 235 transitions. [2018-11-18 09:46:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:36,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:36,125 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:36,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:36,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1258260006, now seen corresponding path program 1 times [2018-11-18 09:46:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:36,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:36,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:36,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:36,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:36,215 INFO L87 Difference]: Start difference. First operand 177 states and 235 transitions. Second operand 5 states. [2018-11-18 09:46:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:36,477 INFO L93 Difference]: Finished difference Result 378 states and 520 transitions. [2018-11-18 09:46:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:36,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 09:46:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:36,479 INFO L225 Difference]: With dead ends: 378 [2018-11-18 09:46:36,479 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 09:46:36,480 INFO L604 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-11-18 09:46:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 09:46:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 177. [2018-11-18 09:46:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 09:46:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2018-11-18 09:46:36,498 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 94 [2018-11-18 09:46:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:36,498 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2018-11-18 09:46:36,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2018-11-18 09:46:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:36,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:36,499 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:36,499 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:36,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1820553564, now seen corresponding path program 1 times [2018-11-18 09:46:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:36,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:36,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:36,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:46:36,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:36,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:46:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:46:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:36,652 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 4 states. [2018-11-18 09:46:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:36,824 INFO L93 Difference]: Finished difference Result 475 states and 654 transitions. [2018-11-18 09:46:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:46:36,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-18 09:46:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:36,827 INFO L225 Difference]: With dead ends: 475 [2018-11-18 09:46:36,827 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 09:46:36,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 09:46:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2018-11-18 09:46:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-18 09:46:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 417 transitions. [2018-11-18 09:46:36,864 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 417 transitions. Word has length 94 [2018-11-18 09:46:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 417 transitions. [2018-11-18 09:46:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:46:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 417 transitions. [2018-11-18 09:46:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:46:36,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:36,867 INFO L375 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, 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] [2018-11-18 09:46:36,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:36,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1782973877, now seen corresponding path program 1 times [2018-11-18 09:46:36,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:36,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:36,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:36,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 09:46:36,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:36,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:46:36,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-18 09:46:36,941 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [40], [43], [48], [51], [55], [57], [88], [91], [105], [106], [109], [115], [121], [129], [133], [139], [143], [144], [147], [150], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [313], [326], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:46:36,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:46:36,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:46:37,106 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:46:37,107 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 387 root evaluator evaluations with a maximum evaluation depth of 3. Performed 387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-18 09:46:37,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:37,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:46:37,230 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 69.09% of their original sizes. [2018-11-18 09:46:37,230 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:46:37,300 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-18 09:46:37,300 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:46:37,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 09:46:37,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:37,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:46:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:46:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:46:37,302 INFO L87 Difference]: Start difference. First operand 318 states and 417 transitions. Second operand 10 states. [2018-11-18 09:46:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:38,277 INFO L93 Difference]: Finished difference Result 731 states and 975 transitions. [2018-11-18 09:46:38,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:46:38,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 151 [2018-11-18 09:46:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:38,279 INFO L225 Difference]: With dead ends: 731 [2018-11-18 09:46:38,279 INFO L226 Difference]: Without dead ends: 428 [2018-11-18 09:46:38,280 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:46:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-18 09:46:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 417. [2018-11-18 09:46:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 09:46:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2018-11-18 09:46:38,303 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 151 [2018-11-18 09:46:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2018-11-18 09:46:38,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:46:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2018-11-18 09:46:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:46:38,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:38,306 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:38,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:38,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1629468248, now seen corresponding path program 1 times [2018-11-18 09:46:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:46:38,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:38,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:46:38,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-18 09:46:38,367 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [48], [51], [55], [57], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [313], [326], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:46:38,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:46:38,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:46:38,390 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:46:38,390 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Performed 439 root evaluator evaluations with a maximum evaluation depth of 3. Performed 439 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-18 09:46:38,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,392 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:46:38,437 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 67.8% of their original sizes. [2018-11-18 09:46:38,437 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:46:38,532 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-18 09:46:38,532 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:46:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:38,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-18 09:46:38,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:38,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 09:46:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 09:46:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:46:38,533 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand 15 states. [2018-11-18 09:46:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:40,170 INFO L93 Difference]: Finished difference Result 822 states and 1063 transitions. [2018-11-18 09:46:40,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 09:46:40,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 151 [2018-11-18 09:46:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:40,172 INFO L225 Difference]: With dead ends: 822 [2018-11-18 09:46:40,172 INFO L226 Difference]: Without dead ends: 426 [2018-11-18 09:46:40,173 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-11-18 09:46:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-18 09:46:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 415. [2018-11-18 09:46:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-18 09:46:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 528 transitions. [2018-11-18 09:46:40,197 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 528 transitions. Word has length 151 [2018-11-18 09:46:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:40,198 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 528 transitions. [2018-11-18 09:46:40,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 09:46:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 528 transitions. [2018-11-18 09:46:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:46:40,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:40,200 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:40,200 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:40,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash -237240426, now seen corresponding path program 1 times [2018-11-18 09:46:40,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:40,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 09:46:40,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:40,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:46:40,260 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-18 09:46:40,260 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [45], [48], [51], [55], [57], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [313], [326], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:46:40,263 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:46:40,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:46:40,283 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:46:40,283 INFO L272 AbstractInterpreter]: Visited 62 different actions 62 times. Never merged. Never widened. Performed 488 root evaluator evaluations with a maximum evaluation depth of 3. Performed 488 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-18 09:46:40,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:40,284 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:46:40,324 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 68.18% of their original sizes. [2018-11-18 09:46:40,325 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:46:40,473 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-18 09:46:40,473 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:46:40,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:40,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-18 09:46:40,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:40,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 09:46:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 09:46:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:46:40,475 INFO L87 Difference]: Start difference. First operand 415 states and 528 transitions. Second operand 19 states. [2018-11-18 09:46:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:42,157 INFO L93 Difference]: Finished difference Result 820 states and 1046 transitions. [2018-11-18 09:46:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 09:46:42,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-11-18 09:46:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:42,159 INFO L225 Difference]: With dead ends: 820 [2018-11-18 09:46:42,159 INFO L226 Difference]: Without dead ends: 426 [2018-11-18 09:46:42,160 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2018-11-18 09:46:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-18 09:46:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 415. [2018-11-18 09:46:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-18 09:46:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 527 transitions. [2018-11-18 09:46:42,181 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 527 transitions. Word has length 151 [2018-11-18 09:46:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:42,181 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 527 transitions. [2018-11-18 09:46:42,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 09:46:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 527 transitions. [2018-11-18 09:46:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:46:42,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:42,183 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:42,183 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:42,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1120749416, now seen corresponding path program 1 times [2018-11-18 09:46:42,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:42,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 09:46:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:46:42,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:42,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:46:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:46:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:46:42,233 INFO L87 Difference]: Start difference. First operand 415 states and 527 transitions. Second operand 6 states. [2018-11-18 09:46:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:42,279 INFO L93 Difference]: Finished difference Result 724 states and 960 transitions. [2018-11-18 09:46:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:46:42,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-18 09:46:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:42,282 INFO L225 Difference]: With dead ends: 724 [2018-11-18 09:46:42,282 INFO L226 Difference]: Without dead ends: 428 [2018-11-18 09:46:42,283 INFO L604 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-11-18 09:46:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-18 09:46:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2018-11-18 09:46:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-18 09:46:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 531 transitions. [2018-11-18 09:46:42,313 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 531 transitions. Word has length 151 [2018-11-18 09:46:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:42,314 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 531 transitions. [2018-11-18 09:46:42,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:46:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 531 transitions. [2018-11-18 09:46:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:46:42,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:42,316 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:42,316 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:42,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1473837798, now seen corresponding path program 1 times [2018-11-18 09:46:42,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 09:46:42,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:42,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:46:42,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-18 09:46:42,362 INFO L202 CegarAbsIntRunner]: [30], [32], [37], [40], [43], [45], [48], [51], [53], [55], [57], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [313], [326], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:46:42,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:46:42,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:46:42,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:46:42,410 INFO L272 AbstractInterpreter]: Visited 106 different actions 138 times. Never merged. Never widened. Performed 906 root evaluator evaluations with a maximum evaluation depth of 3. Performed 906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-18 09:46:42,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:42,412 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:46:42,513 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 80.26% of their original sizes. [2018-11-18 09:46:42,513 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:46:43,082 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-18 09:46:43,082 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:46:43,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:43,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [4] total 56 [2018-11-18 09:46:43,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:43,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-18 09:46:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-18 09:46:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 09:46:43,084 INFO L87 Difference]: Start difference. First operand 420 states and 531 transitions. Second operand 54 states. [2018-11-18 09:46:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:55,361 INFO L93 Difference]: Finished difference Result 1909 states and 2664 transitions. [2018-11-18 09:46:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-18 09:46:55,361 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 151 [2018-11-18 09:46:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:55,365 INFO L225 Difference]: With dead ends: 1909 [2018-11-18 09:46:55,365 INFO L226 Difference]: Without dead ends: 1511 [2018-11-18 09:46:55,368 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1662, Invalid=16970, Unknown=0, NotChecked=0, Total=18632 [2018-11-18 09:46:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2018-11-18 09:46:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1431. [2018-11-18 09:46:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-11-18 09:46:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1901 transitions. [2018-11-18 09:46:55,470 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1901 transitions. Word has length 151 [2018-11-18 09:46:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:55,471 INFO L480 AbstractCegarLoop]: Abstraction has 1431 states and 1901 transitions. [2018-11-18 09:46:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-18 09:46:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1901 transitions. [2018-11-18 09:46:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 09:46:55,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:55,473 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:55,473 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:55,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1137789348, now seen corresponding path program 1 times [2018-11-18 09:46:55,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:55,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:55,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:46:55,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:55,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:55,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:55,529 INFO L87 Difference]: Start difference. First operand 1431 states and 1901 transitions. Second operand 5 states. [2018-11-18 09:46:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:55,930 INFO L93 Difference]: Finished difference Result 3416 states and 4830 transitions. [2018-11-18 09:46:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:46:55,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-18 09:46:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:55,938 INFO L225 Difference]: With dead ends: 3416 [2018-11-18 09:46:55,939 INFO L226 Difference]: Without dead ends: 2199 [2018-11-18 09:46:55,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:46:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2018-11-18 09:46:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2132. [2018-11-18 09:46:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-11-18 09:46:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2877 transitions. [2018-11-18 09:46:56,098 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2877 transitions. Word has length 159 [2018-11-18 09:46:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:56,098 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2877 transitions. [2018-11-18 09:46:56,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2877 transitions. [2018-11-18 09:46:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 09:46:56,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:56,103 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:56,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:46:56,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1811191423, now seen corresponding path program 1 times [2018-11-18 09:46:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:46:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:56,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:46:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 09:46:56,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:56,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:46:56,191 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-18 09:46:56,191 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [304], [307], [317], [320], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:46:56,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:46:56,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:46:56,241 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:46:56,241 INFO L272 AbstractInterpreter]: Visited 119 different actions 152 times. Never merged. Never widened. Performed 1010 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1010 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-18 09:46:56,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:56,243 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:46:56,344 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 76.55% of their original sizes. [2018-11-18 09:46:56,344 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:46:56,954 INFO L415 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2018-11-18 09:46:56,954 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:46:56,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2018-11-18 09:46:56,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:46:56,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-18 09:46:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-18 09:46:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 09:46:56,956 INFO L87 Difference]: Start difference. First operand 2132 states and 2877 transitions. Second operand 54 states. [2018-11-18 09:47:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:05,210 INFO L93 Difference]: Finished difference Result 4444 states and 6323 transitions. [2018-11-18 09:47:05,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 09:47:05,210 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 204 [2018-11-18 09:47:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:05,222 INFO L225 Difference]: With dead ends: 4444 [2018-11-18 09:47:05,222 INFO L226 Difference]: Without dead ends: 3034 [2018-11-18 09:47:05,230 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4417 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1185, Invalid=12387, Unknown=0, NotChecked=0, Total=13572 [2018-11-18 09:47:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-11-18 09:47:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2894. [2018-11-18 09:47:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2018-11-18 09:47:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3905 transitions. [2018-11-18 09:47:05,446 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3905 transitions. Word has length 204 [2018-11-18 09:47:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:05,447 INFO L480 AbstractCegarLoop]: Abstraction has 2894 states and 3905 transitions. [2018-11-18 09:47:05,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-18 09:47:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3905 transitions. [2018-11-18 09:47:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 09:47:05,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:05,453 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-11-18 09:47:05,453 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:05,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1834665576, now seen corresponding path program 1 times [2018-11-18 09:47:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:05,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 09:47:05,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:05,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:05,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-11-18 09:47:05,536 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [45], [48], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [310], [317], [320], [332], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:05,538 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:05,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:05,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:05,750 INFO L272 AbstractInterpreter]: Visited 127 different actions 400 times. Merged at 24 different actions 42 times. Never widened. Performed 4513 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4513 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 09:47:05,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:05,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:05,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:05,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:05,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:05,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:05,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 09:47:05,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 37 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-18 09:47:06,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:06,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-11-18 09:47:06,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:47:06,312 INFO L87 Difference]: Start difference. First operand 2894 states and 3905 transitions. Second operand 3 states. [2018-11-18 09:47:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:06,608 INFO L93 Difference]: Finished difference Result 6120 states and 9107 transitions. [2018-11-18 09:47:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:06,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-18 09:47:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:06,633 INFO L225 Difference]: With dead ends: 6120 [2018-11-18 09:47:06,633 INFO L226 Difference]: Without dead ends: 4444 [2018-11-18 09:47:06,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:47:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2018-11-18 09:47:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4410. [2018-11-18 09:47:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-11-18 09:47:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 6273 transitions. [2018-11-18 09:47:06,990 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 6273 transitions. Word has length 220 [2018-11-18 09:47:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:06,990 INFO L480 AbstractCegarLoop]: Abstraction has 4410 states and 6273 transitions. [2018-11-18 09:47:06,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 6273 transitions. [2018-11-18 09:47:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 09:47:06,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:06,999 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:06,999 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:06,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -28573190, now seen corresponding path program 1 times [2018-11-18 09:47:06,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:07,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:07,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 09:47:07,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:07,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:07,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-18 09:47:07,068 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [310], [317], [320], [326], [332], [335], [338], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:07,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:07,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:07,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:47:07,109 INFO L272 AbstractInterpreter]: Visited 124 different actions 179 times. Merged at 7 different actions 9 times. Never widened. Performed 1416 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 09:47:07,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:07,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:47:07,197 INFO L227 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 76.76% of their original sizes. [2018-11-18 09:47:07,198 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:47:07,982 INFO L415 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2018-11-18 09:47:07,982 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:47:07,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:47:07,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [4] total 68 [2018-11-18 09:47:07,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:07,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-18 09:47:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-18 09:47:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=3768, Unknown=0, NotChecked=0, Total=4290 [2018-11-18 09:47:07,984 INFO L87 Difference]: Start difference. First operand 4410 states and 6273 transitions. Second operand 66 states. [2018-11-18 09:47:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:18,103 INFO L93 Difference]: Finished difference Result 9529 states and 13600 transitions. [2018-11-18 09:47:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-18 09:47:18,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 219 [2018-11-18 09:47:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:18,116 INFO L225 Difference]: With dead ends: 9529 [2018-11-18 09:47:18,116 INFO L226 Difference]: Without dead ends: 5254 [2018-11-18 09:47:18,126 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8745 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2267, Invalid=22539, Unknown=0, NotChecked=0, Total=24806 [2018-11-18 09:47:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2018-11-18 09:47:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5105. [2018-11-18 09:47:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2018-11-18 09:47:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 7235 transitions. [2018-11-18 09:47:18,358 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 7235 transitions. Word has length 219 [2018-11-18 09:47:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:18,358 INFO L480 AbstractCegarLoop]: Abstraction has 5105 states and 7235 transitions. [2018-11-18 09:47:18,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-18 09:47:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 7235 transitions. [2018-11-18 09:47:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 09:47:18,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:18,363 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:18,363 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:18,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1221908512, now seen corresponding path program 1 times [2018-11-18 09:47:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:18,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:18,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:18,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-18 09:47:18,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:18,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:18,438 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-18 09:47:18,439 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [313], [317], [320], [323], [332], [335], [338], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:18,440 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:18,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:18,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:18,575 INFO L272 AbstractInterpreter]: Visited 129 different actions 546 times. Merged at 32 different actions 127 times. Never widened. Performed 5351 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5351 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-18 09:47:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:18,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:18,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:18,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:18,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:18,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:18,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 09:47:18,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 09:47:18,901 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:47:18,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-18 09:47:18,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:18,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:18,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:18,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:47:18,902 INFO L87 Difference]: Start difference. First operand 5105 states and 7235 transitions. Second operand 3 states. [2018-11-18 09:47:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:19,252 INFO L93 Difference]: Finished difference Result 8556 states and 13059 transitions. [2018-11-18 09:47:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:19,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-18 09:47:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:19,267 INFO L225 Difference]: With dead ends: 8556 [2018-11-18 09:47:19,267 INFO L226 Difference]: Without dead ends: 5506 [2018-11-18 09:47:19,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 433 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:47:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2018-11-18 09:47:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5347. [2018-11-18 09:47:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5347 states. [2018-11-18 09:47:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 7431 transitions. [2018-11-18 09:47:19,528 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 7431 transitions. Word has length 219 [2018-11-18 09:47:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:19,528 INFO L480 AbstractCegarLoop]: Abstraction has 5347 states and 7431 transitions. [2018-11-18 09:47:19,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 7431 transitions. [2018-11-18 09:47:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 09:47:19,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:19,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:19,533 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:19,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1769755307, now seen corresponding path program 1 times [2018-11-18 09:47:19,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:19,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:19,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-18 09:47:19,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:19,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:19,577 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-11-18 09:47:19,577 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [93], [96], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [300], [304], [310], [317], [320], [332], [335], [338], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:19,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:19,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:19,610 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:47:19,610 INFO L272 AbstractInterpreter]: Visited 122 different actions 175 times. Merged at 12 different actions 12 times. Never widened. Performed 1193 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 09:47:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:19,618 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:47:19,701 INFO L227 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 75.74% of their original sizes. [2018-11-18 09:47:19,701 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:47:20,482 INFO L415 sIntCurrentIteration]: We unified 219 AI predicates to 219 [2018-11-18 09:47:20,482 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:47:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:47:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [3] total 64 [2018-11-18 09:47:20,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:20,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-18 09:47:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-18 09:47:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=3541, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 09:47:20,484 INFO L87 Difference]: Start difference. First operand 5347 states and 7431 transitions. Second operand 63 states. [2018-11-18 09:47:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:30,860 INFO L93 Difference]: Finished difference Result 8058 states and 11274 transitions. [2018-11-18 09:47:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-18 09:47:30,860 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 220 [2018-11-18 09:47:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:30,870 INFO L225 Difference]: With dead ends: 8058 [2018-11-18 09:47:30,871 INFO L226 Difference]: Without dead ends: 3933 [2018-11-18 09:47:30,878 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 280 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5233 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1345, Invalid=13907, Unknown=0, NotChecked=0, Total=15252 [2018-11-18 09:47:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2018-11-18 09:47:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3721. [2018-11-18 09:47:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2018-11-18 09:47:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4985 transitions. [2018-11-18 09:47:31,129 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4985 transitions. Word has length 220 [2018-11-18 09:47:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:31,129 INFO L480 AbstractCegarLoop]: Abstraction has 3721 states and 4985 transitions. [2018-11-18 09:47:31,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-18 09:47:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4985 transitions. [2018-11-18 09:47:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 09:47:31,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:31,133 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:31,133 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:31,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 534725326, now seen corresponding path program 1 times [2018-11-18 09:47:31,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:31,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:31,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:31,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:31,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 09:47:31,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:31,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:31,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-11-18 09:47:31,202 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [310], [317], [320], [323], [332], [335], [338], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:31,204 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:31,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:31,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:31,303 INFO L272 AbstractInterpreter]: Visited 129 different actions 421 times. Merged at 32 different actions 85 times. Never widened. Performed 3824 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3824 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-18 09:47:31,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:31,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:31,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:31,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:31,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:31,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 09:47:31,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 09:47:31,550 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:47:31,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-11-18 09:47:31,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:31,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:31,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:47:31,551 INFO L87 Difference]: Start difference. First operand 3721 states and 4985 transitions. Second operand 3 states. [2018-11-18 09:47:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:31,737 INFO L93 Difference]: Finished difference Result 7633 states and 10941 transitions. [2018-11-18 09:47:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:31,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-18 09:47:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:31,750 INFO L225 Difference]: With dead ends: 7633 [2018-11-18 09:47:31,750 INFO L226 Difference]: Without dead ends: 4646 [2018-11-18 09:47:31,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:47:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2018-11-18 09:47:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4607. [2018-11-18 09:47:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2018-11-18 09:47:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6134 transitions. [2018-11-18 09:47:31,953 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6134 transitions. Word has length 220 [2018-11-18 09:47:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:31,954 INFO L480 AbstractCegarLoop]: Abstraction has 4607 states and 6134 transitions. [2018-11-18 09:47:31,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6134 transitions. [2018-11-18 09:47:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 09:47:31,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:31,959 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:31,959 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:31,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 389567211, now seen corresponding path program 1 times [2018-11-18 09:47:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:31,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 09:47:32,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:32,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:32,027 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-18 09:47:32,027 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [310], [317], [320], [323], [332], [335], [338], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:32,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:32,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:32,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:32,114 INFO L272 AbstractInterpreter]: Visited 130 different actions 403 times. Merged at 32 different actions 79 times. Never widened. Performed 3623 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 09:47:32,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:32,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:32,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:32,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:32,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:32,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-18 09:47:32,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 09:47:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:47:32,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [6] total 10 [2018-11-18 09:47:32,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:32,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:47:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:47:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:47:32,693 INFO L87 Difference]: Start difference. First operand 4607 states and 6134 transitions. Second operand 4 states. [2018-11-18 09:47:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:33,080 INFO L93 Difference]: Finished difference Result 9588 states and 14011 transitions. [2018-11-18 09:47:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:47:33,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-11-18 09:47:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:33,100 INFO L225 Difference]: With dead ends: 9588 [2018-11-18 09:47:33,100 INFO L226 Difference]: Without dead ends: 5473 [2018-11-18 09:47:33,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 428 SyntacticMatches, 12 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:47:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2018-11-18 09:47:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 4957. [2018-11-18 09:47:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4957 states. [2018-11-18 09:47:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 6437 transitions. [2018-11-18 09:47:33,491 INFO L78 Accepts]: Start accepts. Automaton has 4957 states and 6437 transitions. Word has length 221 [2018-11-18 09:47:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:33,491 INFO L480 AbstractCegarLoop]: Abstraction has 4957 states and 6437 transitions. [2018-11-18 09:47:33,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:47:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4957 states and 6437 transitions. [2018-11-18 09:47:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 09:47:33,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:33,497 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:33,497 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:33,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash 891626516, now seen corresponding path program 1 times [2018-11-18 09:47:33,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:33,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:33,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-18 09:47:33,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:47:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:47:33,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:33,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:47:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:47:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:33,568 INFO L87 Difference]: Start difference. First operand 4957 states and 6437 transitions. Second operand 4 states. [2018-11-18 09:47:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:33,850 INFO L93 Difference]: Finished difference Result 8585 states and 11419 transitions. [2018-11-18 09:47:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:47:33,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-11-18 09:47:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:33,863 INFO L225 Difference]: With dead ends: 8585 [2018-11-18 09:47:33,863 INFO L226 Difference]: Without dead ends: 3984 [2018-11-18 09:47:33,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2018-11-18 09:47:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3984. [2018-11-18 09:47:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2018-11-18 09:47:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4973 transitions. [2018-11-18 09:47:34,112 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4973 transitions. Word has length 220 [2018-11-18 09:47:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 3984 states and 4973 transitions. [2018-11-18 09:47:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:47:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4973 transitions. [2018-11-18 09:47:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-18 09:47:34,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:34,118 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:34,118 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:34,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1345924723, now seen corresponding path program 1 times [2018-11-18 09:47:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:34,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-18 09:47:34,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:34,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:34,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-18 09:47:34,199 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [313], [317], [320], [323], [326], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:34,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:34,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:34,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:34,342 INFO L272 AbstractInterpreter]: Visited 138 different actions 461 times. Merged at 34 different actions 82 times. Never widened. Performed 4333 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-18 09:47:34,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:34,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:34,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:34,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:34,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:34,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 09:47:34,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-18 09:47:34,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:34,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2018-11-18 09:47:34,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:34,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:34,578 INFO L87 Difference]: Start difference. First operand 3984 states and 4973 transitions. Second operand 3 states. [2018-11-18 09:47:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:34,789 INFO L93 Difference]: Finished difference Result 6183 states and 7783 transitions. [2018-11-18 09:47:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:34,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-11-18 09:47:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:34,795 INFO L225 Difference]: With dead ends: 6183 [2018-11-18 09:47:34,795 INFO L226 Difference]: Without dead ends: 3333 [2018-11-18 09:47:34,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-11-18 09:47:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3327. [2018-11-18 09:47:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3327 states. [2018-11-18 09:47:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 4086 transitions. [2018-11-18 09:47:34,975 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 4086 transitions. Word has length 282 [2018-11-18 09:47:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:34,976 INFO L480 AbstractCegarLoop]: Abstraction has 3327 states and 4086 transitions. [2018-11-18 09:47:34,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 4086 transitions. [2018-11-18 09:47:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 09:47:34,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:34,978 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:34,978 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:34,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 740810879, now seen corresponding path program 1 times [2018-11-18 09:47:34,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:34,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:34,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:34,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:34,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 09:47:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:35,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:35,080 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-11-18 09:47:35,080 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [45], [48], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [310], [317], [320], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:35,081 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:35,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:35,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:35,211 INFO L272 AbstractInterpreter]: Visited 131 different actions 453 times. Merged at 41 different actions 94 times. Never widened. Performed 4303 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4303 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 09:47:35,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:35,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:35,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:35,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:35,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 09:47:35,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 49 proven. 13 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:47:35,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:35,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2018-11-18 09:47:35,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:35,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:47:35,448 INFO L87 Difference]: Start difference. First operand 3327 states and 4086 transitions. Second operand 3 states. [2018-11-18 09:47:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:35,600 INFO L93 Difference]: Finished difference Result 5122 states and 6274 transitions. [2018-11-18 09:47:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:35,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-18 09:47:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:35,605 INFO L225 Difference]: With dead ends: 5122 [2018-11-18 09:47:35,605 INFO L226 Difference]: Without dead ends: 3331 [2018-11-18 09:47:35,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:47:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2018-11-18 09:47:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3327. [2018-11-18 09:47:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3327 states. [2018-11-18 09:47:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 4019 transitions. [2018-11-18 09:47:35,757 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 4019 transitions. Word has length 223 [2018-11-18 09:47:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:35,757 INFO L480 AbstractCegarLoop]: Abstraction has 3327 states and 4019 transitions. [2018-11-18 09:47:35,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 4019 transitions. [2018-11-18 09:47:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-18 09:47:35,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:35,759 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:35,759 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:35,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash -4038807, now seen corresponding path program 1 times [2018-11-18 09:47:35,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:35,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 09:47:35,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:35,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:35,864 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-11-18 09:47:35,864 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [313], [317], [320], [323], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:35,865 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:35,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:35,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:35,980 INFO L272 AbstractInterpreter]: Visited 130 different actions 407 times. Merged at 31 different actions 79 times. Never widened. Performed 4081 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-18 09:47:35,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:35,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:35,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:35,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:35,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:36,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 09:47:36,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 11 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 09:47:36,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 4] total 12 [2018-11-18 09:47:36,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:36,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:47:36,220 INFO L87 Difference]: Start difference. First operand 3327 states and 4019 transitions. Second operand 3 states. [2018-11-18 09:47:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:36,357 INFO L93 Difference]: Finished difference Result 4536 states and 5498 transitions. [2018-11-18 09:47:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:36,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-11-18 09:47:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:36,364 INFO L225 Difference]: With dead ends: 4536 [2018-11-18 09:47:36,364 INFO L226 Difference]: Without dead ends: 3333 [2018-11-18 09:47:36,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 436 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:47:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-11-18 09:47:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3327. [2018-11-18 09:47:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3327 states. [2018-11-18 09:47:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 3975 transitions. [2018-11-18 09:47:36,521 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 3975 transitions. Word has length 222 [2018-11-18 09:47:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:36,521 INFO L480 AbstractCegarLoop]: Abstraction has 3327 states and 3975 transitions. [2018-11-18 09:47:36,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 3975 transitions. [2018-11-18 09:47:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-18 09:47:36,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:36,523 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-18 09:47:36,523 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411124, now seen corresponding path program 1 times [2018-11-18 09:47:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:36,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 09:47:36,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:36,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:36,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-11-18 09:47:36,586 INFO L202 CegarAbsIntRunner]: [30], [32], [35], [37], [40], [43], [45], [48], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [310], [317], [320], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:36,587 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:36,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:36,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:36,693 INFO L272 AbstractInterpreter]: Visited 124 different actions 327 times. Merged at 27 different actions 56 times. Never widened. Performed 3582 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3582 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 09:47:36,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:36,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:36,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:36,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:36,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:36,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 09:47:36,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 41 proven. 17 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 09:47:37,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:37,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2018-11-18 09:47:37,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:37,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:47:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:47:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:47:37,048 INFO L87 Difference]: Start difference. First operand 3327 states and 3975 transitions. Second operand 4 states. [2018-11-18 09:47:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:37,348 INFO L93 Difference]: Finished difference Result 5618 states and 6877 transitions. [2018-11-18 09:47:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:47:37,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-11-18 09:47:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:37,354 INFO L225 Difference]: With dead ends: 5618 [2018-11-18 09:47:37,354 INFO L226 Difference]: Without dead ends: 2941 [2018-11-18 09:47:37,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:47:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2018-11-18 09:47:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2857. [2018-11-18 09:47:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2018-11-18 09:47:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3436 transitions. [2018-11-18 09:47:37,489 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3436 transitions. Word has length 222 [2018-11-18 09:47:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:37,489 INFO L480 AbstractCegarLoop]: Abstraction has 2857 states and 3436 transitions. [2018-11-18 09:47:37,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:47:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3436 transitions. [2018-11-18 09:47:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 09:47:37,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:37,491 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:37,491 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:37,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1328465881, now seen corresponding path program 1 times [2018-11-18 09:47:37,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:37,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:37,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 20 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-18 09:47:37,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:37,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:37,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-18 09:47:37,598 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [313], [317], [320], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:37,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:37,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:37,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:37,794 INFO L272 AbstractInterpreter]: Visited 142 different actions 948 times. Merged at 49 different actions 207 times. Never widened. Performed 8442 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8442 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 41 fixpoints after 12 different actions. Largest state had 42 variables. [2018-11-18 09:47:37,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:37,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:37,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:37,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:37,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:37,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 09:47:37,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-18 09:47:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-11-18 09:47:38,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:47:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:47:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:47:38,065 INFO L87 Difference]: Start difference. First operand 2857 states and 3436 transitions. Second operand 6 states. [2018-11-18 09:47:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:38,212 INFO L93 Difference]: Finished difference Result 5316 states and 6542 transitions. [2018-11-18 09:47:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:47:38,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2018-11-18 09:47:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:38,218 INFO L225 Difference]: With dead ends: 5316 [2018-11-18 09:47:38,218 INFO L226 Difference]: Without dead ends: 2917 [2018-11-18 09:47:38,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 453 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:47:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2018-11-18 09:47:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2888. [2018-11-18 09:47:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-11-18 09:47:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3467 transitions. [2018-11-18 09:47:38,351 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3467 transitions. Word has length 229 [2018-11-18 09:47:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:38,351 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 3467 transitions. [2018-11-18 09:47:38,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:47:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3467 transitions. [2018-11-18 09:47:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 09:47:38,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:38,353 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:38,353 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:38,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1087297131, now seen corresponding path program 1 times [2018-11-18 09:47:38,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:38,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:38,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-18 09:47:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:38,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:38,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-18 09:47:38,405 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [313], [317], [320], [332], [335], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [443], [445], [447], [448], [489], [490], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:38,406 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:38,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:38,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:38,476 INFO L272 AbstractInterpreter]: Visited 134 different actions 322 times. Merged at 16 different actions 26 times. Never widened. Performed 3362 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 09:47:38,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:38,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:38,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:38,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:38,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:38,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:38,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:47:38,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-18 09:47:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:38,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 09:47:38,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:38,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:38,681 INFO L87 Difference]: Start difference. First operand 2888 states and 3467 transitions. Second operand 3 states. [2018-11-18 09:47:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:38,848 INFO L93 Difference]: Finished difference Result 5217 states and 6407 transitions. [2018-11-18 09:47:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:38,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-18 09:47:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:38,855 INFO L225 Difference]: With dead ends: 5217 [2018-11-18 09:47:38,855 INFO L226 Difference]: Without dead ends: 2722 [2018-11-18 09:47:38,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:47:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2018-11-18 09:47:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2652. [2018-11-18 09:47:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2652 states. [2018-11-18 09:47:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3145 transitions. [2018-11-18 09:47:39,107 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3145 transitions. Word has length 230 [2018-11-18 09:47:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:39,107 INFO L480 AbstractCegarLoop]: Abstraction has 2652 states and 3145 transitions. [2018-11-18 09:47:39,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3145 transitions. [2018-11-18 09:47:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-18 09:47:39,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:39,110 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:39,110 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:39,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1253434059, now seen corresponding path program 1 times [2018-11-18 09:47:39,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:39,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:39,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:39,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:39,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-18 09:47:39,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:39,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:47:39,205 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-11-18 09:47:39,205 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [30], [32], [35], [37], [40], [43], [45], [48], [51], [53], [55], [57], [60], [62], [65], [71], [77], [79], [81], [83], [87], [88], [91], [105], [106], [111], [117], [123], [129], [135], [141], [143], [144], [147], [150], [152], [154], [156], [158], [159], [162], [168], [174], [178], [179], [184], [187], [190], [192], [195], [201], [207], [209], [211], [215], [253], [256], [257], [269], [273], [279], [282], [285], [291], [294], [297], [304], [307], [317], [320], [332], [335], [338], [340], [342], [344], [346], [347], [352], [358], [364], [370], [376], [382], [384], [385], [394], [400], [402], [432], [433], [436], [439], [441], [443], [445], [447], [448], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [507], [508], [509], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [553], [554], [555] [2018-11-18 09:47:39,206 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:47:39,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:47:39,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:47:39,355 INFO L272 AbstractInterpreter]: Visited 149 different actions 624 times. Merged at 51 different actions 129 times. Never widened. Performed 5146 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5146 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 19 fixpoints after 10 different actions. Largest state had 42 variables. [2018-11-18 09:47:39,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:39,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:47:39,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:47:39,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:47:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:39,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:47:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:39,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:47:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 09:47:39,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:47:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-18 09:47:39,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:47:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-18 09:47:39,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:39,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:47:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:47:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:47:39,652 INFO L87 Difference]: Start difference. First operand 2652 states and 3145 transitions. Second operand 6 states. [2018-11-18 09:47:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:39,749 INFO L93 Difference]: Finished difference Result 4110 states and 4938 transitions. [2018-11-18 09:47:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:47:39,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-11-18 09:47:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:39,752 INFO L225 Difference]: With dead ends: 4110 [2018-11-18 09:47:39,752 INFO L226 Difference]: Without dead ends: 1862 [2018-11-18 09:47:39,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:47:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-11-18 09:47:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1860. [2018-11-18 09:47:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2018-11-18 09:47:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2114 transitions. [2018-11-18 09:47:39,844 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2114 transitions. Word has length 276 [2018-11-18 09:47:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:39,844 INFO L480 AbstractCegarLoop]: Abstraction has 1860 states and 2114 transitions. [2018-11-18 09:47:39,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:47:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2114 transitions. [2018-11-18 09:47:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-18 09:47:39,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:39,845 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:39,845 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:39,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash -727281715, now seen corresponding path program 2 times [2018-11-18 09:47:39,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:39,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:39,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-11-18 09:47:39,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:47:39,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:47:39,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:39,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:47:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:47:39,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:47:39,926 INFO L87 Difference]: Start difference. First operand 1860 states and 2114 transitions. Second operand 6 states. [2018-11-18 09:47:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:40,020 INFO L93 Difference]: Finished difference Result 2612 states and 3011 transitions. [2018-11-18 09:47:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:47:40,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-11-18 09:47:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:40,022 INFO L225 Difference]: With dead ends: 2612 [2018-11-18 09:47:40,023 INFO L226 Difference]: Without dead ends: 714 [2018-11-18 09:47:40,024 INFO L604 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-11-18 09:47:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-18 09:47:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2018-11-18 09:47:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-18 09:47:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 768 transitions. [2018-11-18 09:47:40,067 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 768 transitions. Word has length 276 [2018-11-18 09:47:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:40,067 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 768 transitions. [2018-11-18 09:47:40,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:47:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 768 transitions. [2018-11-18 09:47:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-18 09:47:40,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:40,068 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:40,069 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:40,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash -704649461, now seen corresponding path program 3 times [2018-11-18 09:47:40,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:47:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-11-18 09:47:40,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:47:40,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:47:40,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:40,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:47:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:47:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:47:40,192 INFO L87 Difference]: Start difference. First operand 703 states and 768 transitions. Second operand 7 states. [2018-11-18 09:47:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:40,710 INFO L93 Difference]: Finished difference Result 707 states and 773 transitions. [2018-11-18 09:47:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:47:40,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 276 [2018-11-18 09:47:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:40,712 INFO L225 Difference]: With dead ends: 707 [2018-11-18 09:47:40,712 INFO L226 Difference]: Without dead ends: 704 [2018-11-18 09:47:40,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:47:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-11-18 09:47:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 702. [2018-11-18 09:47:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-11-18 09:47:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 766 transitions. [2018-11-18 09:47:40,747 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 766 transitions. Word has length 276 [2018-11-18 09:47:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:40,747 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 766 transitions. [2018-11-18 09:47:40,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:47:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 766 transitions. [2018-11-18 09:47:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-18 09:47:40,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:40,749 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:40,749 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:40,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 978760819, now seen corresponding path program 1 times [2018-11-18 09:47:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:47:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-18 09:47:40,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:47:40,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:47:40,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:47:40,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:47:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:47:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:47:40,807 INFO L87 Difference]: Start difference. First operand 702 states and 766 transitions. Second operand 3 states. [2018-11-18 09:47:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:47:40,857 INFO L93 Difference]: Finished difference Result 1125 states and 1249 transitions. [2018-11-18 09:47:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:47:40,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2018-11-18 09:47:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:47:40,859 INFO L225 Difference]: With dead ends: 1125 [2018-11-18 09:47:40,860 INFO L226 Difference]: Without dead ends: 710 [2018-11-18 09:47:40,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:47:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-11-18 09:47:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2018-11-18 09:47:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-11-18 09:47:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 775 transitions. [2018-11-18 09:47:40,897 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 775 transitions. Word has length 280 [2018-11-18 09:47:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:47:40,898 INFO L480 AbstractCegarLoop]: Abstraction has 710 states and 775 transitions. [2018-11-18 09:47:40,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:47:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 775 transitions. [2018-11-18 09:47:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-18 09:47:40,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:47:40,900 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:47:40,900 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:47:40,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:47:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1505946095, now seen corresponding path program 1 times [2018-11-18 09:47:40,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:47:40,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:47:40,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:47:40,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:47:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:47:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:47:40,972 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:47:41,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:47:41 BoogieIcfgContainer [2018-11-18 09:47:41,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:47:41,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:47:41,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:47:41,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:47:41,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:34" (3/4) ... [2018-11-18 09:47:41,074 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:47:41,161 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8c61e85e-1698-4dec-8bf3-48d0fd024713/bin-2019/utaipan/witness.graphml [2018-11-18 09:47:41,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:47:41,162 INFO L168 Benchmark]: Toolchain (without parser) took 67744.37 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,164 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:47:41,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 941.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,164 INFO L168 Benchmark]: Boogie Preprocessor took 30.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:47:41,164 INFO L168 Benchmark]: RCFGBuilder took 426.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,165 INFO L168 Benchmark]: TraceAbstraction took 66911.91 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,165 INFO L168 Benchmark]: Witness Printer took 89.10 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:47:41,166 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 941.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 426.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66911.91 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 89.10 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=18, \old(E_2)=5, \old(E_M)=13, \old(local)=17, \old(M_E)=14, \old(m_i)=7, \old(m_pc)=11, \old(m_st)=12, \old(T1_E)=3, \old(t1_i)=16, \old(t1_pc)=8, \old(t1_st)=4, \old(T2_E)=15, \old(t2_i)=6, \old(t2_pc)=9, \old(t2_st)=10, \old(token)=19, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] RET t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] RET t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE, RET !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE, RET !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE, RET !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 [L146] RET t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L327] transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE, RET !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L57] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L58] E_1 = 2 [L59] m_pc = 1 [L60] RET m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L299] master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L115] token += 1 [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L433] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L441] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] RET t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L117] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] t1_pc = 1 [L110] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L313] transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L151] token += 1 [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L433] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L441] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE, RET !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] t2_pc = 1 [L146] RET t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L327] transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L274] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L286] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 186 locations, 1 error locations. UNSAFE Result, 66.8s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 51.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9353 SDtfs, 12108 SDslu, 43933 SDs, 0 SdLazy, 19415 SolverSat, 3695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 6874 GetRequests, 6106 SyntacticMatches, 48 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5347occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 18 AbstIntIterations, 7 AbstIntStrong, 0.9907151618805572 AbsIntWeakeningRatio, 0.5919354838709677 AbsIntAvgWeakeningVarsNumRemoved, 14.959677419354838 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 1845 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 8676 NumberOfCodeBlocks, 8676 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 10906 ConstructedInterpolants, 0 QuantifiedInterpolants, 3258849 SizeOfPredicates, 11 NumberOfNonLiveVariables, 10826 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 53 InterpolantComputations, 27 PerfectInterpolantSequences, 6406/6754 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...