./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 03:32:39,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:32:39,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:32:39,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:32:39,506 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:32:39,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:32:39,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:32:39,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:32:39,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:32:39,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:32:39,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:32:39,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:32:39,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:32:39,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:32:39,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:32:39,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:32:39,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:32:39,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:32:39,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:32:39,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:32:39,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:32:39,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:32:39,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:32:39,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:32:39,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:32:39,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:32:39,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:32:39,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:32:39,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:32:39,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:32:39,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:32:39,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:32:39,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:32:39,525 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:32:39,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:32:39,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:32:39,527 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:32:39,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:32:39,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:32:39,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:32:39,535 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:32:39,535 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:32:39,536 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:32:39,536 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:32:39,536 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:32:39,536 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:32:39,536 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:32:39,536 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:32:39,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:32:39,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:32:39,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:32:39,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:32:39,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:32:39,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:32:39,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:32:39,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:32:39,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:32:39,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:32:39,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:32:39,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:32:39,540 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_86cbcb48-034f-4626-b313-f66c0b4c0387/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-11-10 03:32:39,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:32:39,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:32:39,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:32:39,577 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:32:39,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:32:39,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 03:32:39,621 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/data/b314ec856/eba81075dfa44e8ea0d8d97a7fd0c498/FLAG10a4741be [2018-11-10 03:32:39,968 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:32:39,968 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 03:32:39,974 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/data/b314ec856/eba81075dfa44e8ea0d8d97a7fd0c498/FLAG10a4741be [2018-11-10 03:32:39,984 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/data/b314ec856/eba81075dfa44e8ea0d8d97a7fd0c498 [2018-11-10 03:32:39,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:32:39,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:32:39,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:32:39,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:32:39,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:32:39,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:39" (1/1) ... [2018-11-10 03:32:39,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d37a3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:39, skipping insertion in model container [2018-11-10 03:32:39,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:39" (1/1) ... [2018-11-10 03:32:40,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:32:40,030 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:32:40,163 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:32:40,166 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:32:40,190 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:32:40,200 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:32:40,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40 WrapperNode [2018-11-10 03:32:40,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:32:40,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:32:40,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:32:40,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:32:40,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:32:40,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:32:40,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:32:40,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:32:40,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... [2018-11-10 03:32:40,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:32:40,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:32:40,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:32:40,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:32:40,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/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-10 03:32:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 03:32:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 03:32:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-10 03:32:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-10 03:32:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 03:32:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 03:32:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 03:32:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 03:32:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-10 03:32:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-10 03:32:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 03:32:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 03:32:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 03:32:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 03:32:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:32:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:32:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 03:32:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 03:32:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-10 03:32:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-10 03:32:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:32:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:32:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 03:32:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 03:32:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 03:32:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 03:32:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 03:32:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 03:32:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 03:32:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 03:32:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 03:32:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 03:32:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 03:32:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 03:32:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:32:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:32:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-10 03:32:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-10 03:32:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 03:32:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 03:32:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 03:32:40,319 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 03:32:40,628 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:32:40,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:32:40 BoogieIcfgContainer [2018-11-10 03:32:40,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:32:40,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:32:40,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:32:40,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:32:40,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:32:39" (1/3) ... [2018-11-10 03:32:40,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d0dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:40, skipping insertion in model container [2018-11-10 03:32:40,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:40" (2/3) ... [2018-11-10 03:32:40,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d0dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:40, skipping insertion in model container [2018-11-10 03:32:40,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:32:40" (3/3) ... [2018-11-10 03:32:40,636 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 03:32:40,642 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:32:40,646 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:32:40,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:32:40,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:32:40,676 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:32:40,677 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:32:40,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:32:40,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:32:40,677 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:32:40,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:32:40,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:32:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-11-10 03:32:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:32:40,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:40,706 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] [2018-11-10 03:32:40,707 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:40,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 14205677, now seen corresponding path program 1 times [2018-11-10 03:32:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:40,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:40,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:40,929 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-10 03:32:40,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:40,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:32:40,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:40,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:32:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:32:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:32:40,945 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2018-11-10 03:32:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:41,333 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2018-11-10 03:32:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:32:41,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 03:32:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:41,342 INFO L225 Difference]: With dead ends: 321 [2018-11-10 03:32:41,342 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 03:32:41,345 INFO L605 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-10 03:32:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 03:32:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-10 03:32:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:32:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2018-11-10 03:32:41,383 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 80 [2018-11-10 03:32:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:41,383 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2018-11-10 03:32:41,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:32:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-11-10 03:32:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:32:41,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:41,385 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] [2018-11-10 03:32:41,386 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:41,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 574905455, now seen corresponding path program 1 times [2018-11-10 03:32:41,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:41,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:41,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:41,472 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-10 03:32:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:32:41,472 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:41,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:32:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:32:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:32:41,474 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand 5 states. [2018-11-10 03:32:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:41,761 INFO L93 Difference]: Finished difference Result 300 states and 409 transitions. [2018-11-10 03:32:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:32:41,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 03:32:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:41,766 INFO L225 Difference]: With dead ends: 300 [2018-11-10 03:32:41,766 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 03:32:41,767 INFO L605 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-10 03:32:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 03:32:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-10 03:32:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:32:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2018-11-10 03:32:41,784 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 80 [2018-11-10 03:32:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:41,785 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2018-11-10 03:32:41,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:32:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2018-11-10 03:32:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:32:41,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:41,788 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] [2018-11-10 03:32:41,788 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:41,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1008634541, now seen corresponding path program 1 times [2018-11-10 03:32:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:41,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:41,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:41,860 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-10 03:32:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:41,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:32:41,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:41,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:32:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:32:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:32:41,861 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand 5 states. [2018-11-10 03:32:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:42,095 INFO L93 Difference]: Finished difference Result 316 states and 431 transitions. [2018-11-10 03:32:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:32:42,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 03:32:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:42,097 INFO L225 Difference]: With dead ends: 316 [2018-11-10 03:32:42,097 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 03:32:42,098 INFO L605 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-10 03:32:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 03:32:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2018-11-10 03:32:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:32:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-11-10 03:32:42,113 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 80 [2018-11-10 03:32:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:42,114 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-11-10 03:32:42,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:32:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-10 03:32:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:32:42,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:42,115 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] [2018-11-10 03:32:42,116 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:42,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2025415505, now seen corresponding path program 1 times [2018-11-10 03:32:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:42,177 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-10 03:32:42,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:42,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:32:42,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:42,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:32:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:32:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:32:42,178 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 5 states. [2018-11-10 03:32:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:42,425 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions. [2018-11-10 03:32:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:32:42,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 03:32:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:42,427 INFO L225 Difference]: With dead ends: 309 [2018-11-10 03:32:42,428 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 03:32:42,428 INFO L605 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-10 03:32:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 03:32:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-11-10 03:32:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:32:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2018-11-10 03:32:42,444 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 80 [2018-11-10 03:32:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:42,445 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2018-11-10 03:32:42,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:32:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2018-11-10 03:32:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:32:42,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:42,446 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] [2018-11-10 03:32:42,447 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:42,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1984740755, now seen corresponding path program 1 times [2018-11-10 03:32:42,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:42,520 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-10 03:32:42,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:42,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:32:42,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:42,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:32:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:32:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:32:42,521 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand 4 states. [2018-11-10 03:32:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:42,641 INFO L93 Difference]: Finished difference Result 384 states and 517 transitions. [2018-11-10 03:32:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:32:42,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 03:32:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:42,643 INFO L225 Difference]: With dead ends: 384 [2018-11-10 03:32:42,644 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 03:32:42,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:32:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 03:32:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-11-10 03:32:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-10 03:32:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 328 transitions. [2018-11-10 03:32:42,668 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 328 transitions. Word has length 80 [2018-11-10 03:32:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:42,668 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 328 transitions. [2018-11-10 03:32:42,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:32:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 328 transitions. [2018-11-10 03:32:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 03:32:42,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:42,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:42,671 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:42,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1044861795, now seen corresponding path program 1 times [2018-11-10 03:32:42,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:42,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 03:32:42,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:32:42,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:32:42,748 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-11-10 03:32:42,749 INFO L202 CegarAbsIntRunner]: [1], [32], [34], [37], [42], [45], [49], [50], [53], [62], [63], [64], [67], [70], [78], [79], [82], [88], [96], [100], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [241], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-10 03:32:42,786 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:32:42,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:32:43,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:32:43,119 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-11-10 03:32:43,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:43,150 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:32:43,552 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 71.29% of their original sizes. [2018-11-10 03:32:43,553 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:32:43,697 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-11-10 03:32:43,698 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:32:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:32:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-10 03:32:43,698 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:43,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:32:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:32:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:32:43,699 INFO L87 Difference]: Start difference. First operand 257 states and 328 transitions. Second operand 9 states. [2018-11-10 03:32:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:45,620 INFO L93 Difference]: Finished difference Result 588 states and 762 transitions. [2018-11-10 03:32:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:32:45,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-10 03:32:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:45,622 INFO L225 Difference]: With dead ends: 588 [2018-11-10 03:32:45,622 INFO L226 Difference]: Without dead ends: 346 [2018-11-10 03:32:45,623 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:32:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-10 03:32:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338. [2018-11-10 03:32:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 03:32:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 423 transitions. [2018-11-10 03:32:45,676 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 423 transitions. Word has length 127 [2018-11-10 03:32:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:45,676 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 423 transitions. [2018-11-10 03:32:45,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:32:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 423 transitions. [2018-11-10 03:32:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 03:32:45,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:45,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:45,679 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:45,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash 273636384, now seen corresponding path program 1 times [2018-11-10 03:32:45,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:45,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 03:32:45,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:32:45,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:32:45,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-11-10 03:32:45,733 INFO L202 CegarAbsIntRunner]: [1], [32], [34], [37], [39], [42], [45], [49], [50], [53], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [241], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-10 03:32:45,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:32:45,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:32:45,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:32:45,909 INFO L272 AbstractInterpreter]: Visited 49 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-11-10 03:32:45,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:45,916 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:32:46,230 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 69.15% of their original sizes. [2018-11-10 03:32:46,230 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:32:46,691 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-11-10 03:32:46,691 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:32:46,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:32:46,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-10 03:32:46,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:46,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:32:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:32:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:32:46,692 INFO L87 Difference]: Start difference. First operand 338 states and 423 transitions. Second operand 14 states. [2018-11-10 03:32:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:50,277 INFO L93 Difference]: Finished difference Result 663 states and 839 transitions. [2018-11-10 03:32:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:32:50,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-11-10 03:32:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:50,279 INFO L225 Difference]: With dead ends: 663 [2018-11-10 03:32:50,279 INFO L226 Difference]: Without dead ends: 345 [2018-11-10 03:32:50,280 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-11-10 03:32:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-10 03:32:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2018-11-10 03:32:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 03:32:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 418 transitions. [2018-11-10 03:32:50,337 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 418 transitions. Word has length 127 [2018-11-10 03:32:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:50,338 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 418 transitions. [2018-11-10 03:32:50,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:32:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 418 transitions. [2018-11-10 03:32:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 03:32:50,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:50,340 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:50,340 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:50,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1971835940, now seen corresponding path program 1 times [2018-11-10 03:32:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 03:32:50,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:50,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:32:50,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:50,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:32:50,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:32:50,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:32:50,405 INFO L87 Difference]: Start difference. First operand 337 states and 418 transitions. Second operand 6 states. [2018-11-10 03:32:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:50,497 INFO L93 Difference]: Finished difference Result 583 states and 754 transitions. [2018-11-10 03:32:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:32:50,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-10 03:32:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:50,499 INFO L225 Difference]: With dead ends: 583 [2018-11-10 03:32:50,500 INFO L226 Difference]: Without dead ends: 347 [2018-11-10 03:32:50,500 INFO L605 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-10 03:32:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-10 03:32:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2018-11-10 03:32:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-10 03:32:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 422 transitions. [2018-11-10 03:32:50,561 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 422 transitions. Word has length 148 [2018-11-10 03:32:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:50,561 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 422 transitions. [2018-11-10 03:32:50,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:32:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 422 transitions. [2018-11-10 03:32:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 03:32:50,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:50,564 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:32:50,564 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:50,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1312304418, now seen corresponding path program 1 times [2018-11-10 03:32:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:50,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:50,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 03:32:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:32:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:32:50,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:50,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:32:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:32:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:32:50,618 INFO L87 Difference]: Start difference. First operand 342 states and 422 transitions. Second operand 3 states. [2018-11-10 03:32:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:32:50,745 INFO L93 Difference]: Finished difference Result 888 states and 1145 transitions. [2018-11-10 03:32:50,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:32:50,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-11-10 03:32:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:32:50,748 INFO L225 Difference]: With dead ends: 888 [2018-11-10 03:32:50,748 INFO L226 Difference]: Without dead ends: 567 [2018-11-10 03:32:50,750 INFO L605 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-10 03:32:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-10 03:32:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2018-11-10 03:32:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-11-10 03:32:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 715 transitions. [2018-11-10 03:32:50,826 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 715 transitions. Word has length 148 [2018-11-10 03:32:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:32:50,826 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 715 transitions. [2018-11-10 03:32:50,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:32:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 715 transitions. [2018-11-10 03:32:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 03:32:50,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:32:50,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:50,828 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:32:50,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 279185127, now seen corresponding path program 1 times [2018-11-10 03:32:50,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:32:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:32:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:32:50,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:32:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:32:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:32:50,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:32:50,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:32:50,907 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-11-10 03:32:50,908 INFO L202 CegarAbsIntRunner]: [1], [32], [34], [39], [42], [45], [47], [49], [50], [53], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [232], [238], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-10 03:32:50,910 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:32:50,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:32:51,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:32:51,641 INFO L272 AbstractInterpreter]: Visited 92 different actions 163 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-10 03:32:51,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:32:51,643 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:32:52,298 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 78.57% of their original sizes. [2018-11-10 03:32:52,298 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:32:54,610 INFO L415 sIntCurrentIteration]: We unified 127 AI predicates to 127 [2018-11-10 03:32:54,610 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:32:54,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:32:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [4] total 48 [2018-11-10 03:32:54,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:32:54,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-10 03:32:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 03:32:54,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 03:32:54,611 INFO L87 Difference]: Start difference. First operand 555 states and 715 transitions. Second operand 46 states. [2018-11-10 03:33:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:26,513 INFO L93 Difference]: Finished difference Result 1832 states and 2465 transitions. [2018-11-10 03:33:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-10 03:33:26,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2018-11-10 03:33:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:33:26,518 INFO L225 Difference]: With dead ends: 1832 [2018-11-10 03:33:26,518 INFO L226 Difference]: Without dead ends: 1274 [2018-11-10 03:33:26,522 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4328 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1193, Invalid=11689, Unknown=0, NotChecked=0, Total=12882 [2018-11-10 03:33:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-10 03:33:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1189. [2018-11-10 03:33:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2018-11-10 03:33:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1519 transitions. [2018-11-10 03:33:26,692 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1519 transitions. Word has length 128 [2018-11-10 03:33:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:33:26,692 INFO L481 AbstractCegarLoop]: Abstraction has 1189 states and 1519 transitions. [2018-11-10 03:33:26,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-10 03:33:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1519 transitions. [2018-11-10 03:33:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 03:33:26,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:33:26,695 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:33:26,695 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:33:26,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1821777508, now seen corresponding path program 1 times [2018-11-10 03:33:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:33:26,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:26,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:33:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 03:33:26,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:33:26,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:33:26,789 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-10 03:33:26,789 INFO L202 CegarAbsIntRunner]: [1], [4], [15], [21], [23], [31], [32], [34], [39], [42], [47], [49], [50], [53], [62], [63], [64], [67], [70], [74], [76], [78], [79], [84], [90], [96], [102], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [193], [194], [197], [201], [207], [210], [213], [219], [222], [225], [232], [235], [241], [258], [263], [269], [275], [281], [283], [284], [293], [299], [301], [334], [344], [346], [348], [349], [375], [376], [377], [378], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [395], [396], [397], [398], [399], [400], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-10 03:33:26,793 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:33:26,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:33:29,603 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:33:29,603 INFO L272 AbstractInterpreter]: Visited 101 different actions 438 times. Merged at 18 different actions 79 times. Widened at 2 different actions 2 times. Found 12 fixpoints after 6 different actions. Largest state had 30 variables. [2018-11-10 03:33:29,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:29,606 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:33:30,605 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 77.07% of their original sizes. [2018-11-10 03:33:30,605 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:33:33,965 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-10 03:33:33,965 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:33:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:33:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [10] total 62 [2018-11-10 03:33:33,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:33:33,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-10 03:33:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-10 03:33:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2544, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 03:33:33,967 INFO L87 Difference]: Start difference. First operand 1189 states and 1519 transitions. Second operand 54 states. [2018-11-10 03:34:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:30,893 INFO L93 Difference]: Finished difference Result 2871 states and 3872 transitions. [2018-11-10 03:34:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-11-10 03:34:30,893 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 148 [2018-11-10 03:34:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:30,898 INFO L225 Difference]: With dead ends: 2871 [2018-11-10 03:34:30,898 INFO L226 Difference]: Without dead ends: 1717 [2018-11-10 03:34:30,903 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7313 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1812, Invalid=19358, Unknown=0, NotChecked=0, Total=21170 [2018-11-10 03:34:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-11-10 03:34:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1653. [2018-11-10 03:34:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2018-11-10 03:34:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2107 transitions. [2018-11-10 03:34:31,098 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2107 transitions. Word has length 148 [2018-11-10 03:34:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:31,098 INFO L481 AbstractCegarLoop]: Abstraction has 1653 states and 2107 transitions. [2018-11-10 03:34:31,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-10 03:34:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2107 transitions. [2018-11-10 03:34:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 03:34:31,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:31,101 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:31,101 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1867983610, now seen corresponding path program 1 times [2018-11-10 03:34:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:31,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 03:34:31,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:34:31,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:34:31,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:34:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:34:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:34:31,151 INFO L87 Difference]: Start difference. First operand 1653 states and 2107 transitions. Second operand 4 states. [2018-11-10 03:34:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:31,438 INFO L93 Difference]: Finished difference Result 3011 states and 4001 transitions. [2018-11-10 03:34:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:34:31,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 03:34:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:31,442 INFO L225 Difference]: With dead ends: 3011 [2018-11-10 03:34:31,443 INFO L226 Difference]: Without dead ends: 1534 [2018-11-10 03:34:31,445 INFO L605 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-10 03:34:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2018-11-10 03:34:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1532. [2018-11-10 03:34:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2018-11-10 03:34:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1897 transitions. [2018-11-10 03:34:31,610 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1897 transitions. Word has length 184 [2018-11-10 03:34:31,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:31,611 INFO L481 AbstractCegarLoop]: Abstraction has 1532 states and 1897 transitions. [2018-11-10 03:34:31,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:34:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1897 transitions. [2018-11-10 03:34:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 03:34:31,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:31,613 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:31,613 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:31,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:31,613 INFO L82 PathProgramCache]: Analyzing trace with hash 103167001, now seen corresponding path program 2 times [2018-11-10 03:34:31,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:31,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:31,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 03:34:31,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:34:31,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:34:31,695 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:34:31,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:34:31,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:34:31,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/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-10 03:34:31,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:34:31,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 03:34:31,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 03:34:31,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:34:31,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:34:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 03:34:31,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:34:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 03:34:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:34:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-10 03:34:32,049 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:34:32,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:34:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:34:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:34:32,050 INFO L87 Difference]: Start difference. First operand 1532 states and 1897 transitions. Second operand 6 states. [2018-11-10 03:34:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:32,396 INFO L93 Difference]: Finished difference Result 2438 states and 3111 transitions. [2018-11-10 03:34:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:34:32,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-11-10 03:34:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:32,403 INFO L225 Difference]: With dead ends: 2438 [2018-11-10 03:34:32,403 INFO L226 Difference]: Without dead ends: 1488 [2018-11-10 03:34:32,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:34:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-11-10 03:34:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2018-11-10 03:34:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-11-10 03:34:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1807 transitions. [2018-11-10 03:34:32,706 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1807 transitions. Word has length 184 [2018-11-10 03:34:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:32,706 INFO L481 AbstractCegarLoop]: Abstraction has 1488 states and 1807 transitions. [2018-11-10 03:34:32,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:34:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1807 transitions. [2018-11-10 03:34:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 03:34:32,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:32,709 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:32,709 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:32,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 125799255, now seen corresponding path program 3 times [2018-11-10 03:34:32,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:32,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:32,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:34:32,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:32,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 03:34:32,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:34:32,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:34:32,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:34:32,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:34:32,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:34:32,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/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-10 03:34:32,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:34:32,797 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 03:34:32,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:34:32,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:34:32,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:34:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 03:34:32,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:34:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 03:34:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:34:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 7 [2018-11-10 03:34:33,037 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:34:33,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:34:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:34:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:34:33,038 INFO L87 Difference]: Start difference. First operand 1488 states and 1807 transitions. Second operand 3 states. [2018-11-10 03:34:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:33,214 INFO L93 Difference]: Finished difference Result 2499 states and 3177 transitions. [2018-11-10 03:34:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:34:33,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-10 03:34:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:33,218 INFO L225 Difference]: With dead ends: 2499 [2018-11-10 03:34:33,218 INFO L226 Difference]: Without dead ends: 1383 [2018-11-10 03:34:33,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 365 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:34:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-11-10 03:34:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1369. [2018-11-10 03:34:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-10 03:34:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1662 transitions. [2018-11-10 03:34:33,359 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1662 transitions. Word has length 184 [2018-11-10 03:34:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:33,360 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 1662 transitions. [2018-11-10 03:34:33,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:34:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1662 transitions. [2018-11-10 03:34:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 03:34:33,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:33,362 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, 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] [2018-11-10 03:34:33,362 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:33,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1352761130, now seen corresponding path program 1 times [2018-11-10 03:34:33,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:33,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:34:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:33,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 03:34:33,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:33,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:34:33,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:34:33,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:34:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:34:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:34:33,457 INFO L87 Difference]: Start difference. First operand 1369 states and 1662 transitions. Second operand 6 states. [2018-11-10 03:34:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:34,019 INFO L93 Difference]: Finished difference Result 2602 states and 3355 transitions. [2018-11-10 03:34:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:34:34,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-11-10 03:34:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:34,024 INFO L225 Difference]: With dead ends: 2602 [2018-11-10 03:34:34,024 INFO L226 Difference]: Without dead ends: 1991 [2018-11-10 03:34:34,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:34:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-11-10 03:34:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1952. [2018-11-10 03:34:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2018-11-10 03:34:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2469 transitions. [2018-11-10 03:34:34,193 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2469 transitions. Word has length 185 [2018-11-10 03:34:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:34,193 INFO L481 AbstractCegarLoop]: Abstraction has 1952 states and 2469 transitions. [2018-11-10 03:34:34,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:34:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2469 transitions. [2018-11-10 03:34:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 03:34:34,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:34,195 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, 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-10 03:34:34,196 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:34,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 219479550, now seen corresponding path program 1 times [2018-11-10 03:34:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:34,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 03:34:34,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:34:34,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:34:34,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:34:34,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:34:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:34:34,246 INFO L87 Difference]: Start difference. First operand 1952 states and 2469 transitions. Second operand 3 states. [2018-11-10 03:34:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:34,440 INFO L93 Difference]: Finished difference Result 3139 states and 4106 transitions. [2018-11-10 03:34:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:34:34,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-10 03:34:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:34,445 INFO L225 Difference]: With dead ends: 3139 [2018-11-10 03:34:34,446 INFO L226 Difference]: Without dead ends: 1968 [2018-11-10 03:34:34,448 INFO L605 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-10 03:34:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-11-10 03:34:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1954. [2018-11-10 03:34:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-11-10 03:34:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2471 transitions. [2018-11-10 03:34:34,615 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2471 transitions. Word has length 189 [2018-11-10 03:34:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:34,616 INFO L481 AbstractCegarLoop]: Abstraction has 1954 states and 2471 transitions. [2018-11-10 03:34:34,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:34:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2471 transitions. [2018-11-10 03:34:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 03:34:34,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:34,620 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, 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-10 03:34:34,620 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:34,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash -556883815, now seen corresponding path program 1 times [2018-11-10 03:34:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:34:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:34,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:34:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:34:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:34:34,673 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 03:34:34,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:34:34 BoogieIcfgContainer [2018-11-10 03:34:34,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:34:34,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:34:34,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:34:34,748 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:34:34,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:32:40" (3/4) ... [2018-11-10 03:34:34,750 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 03:34:34,819 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_86cbcb48-034f-4626-b313-f66c0b4c0387/bin-2019/utaipan/witness.graphml [2018-11-10 03:34:34,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:34:34,820 INFO L168 Benchmark]: Toolchain (without parser) took 114832.71 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 959.2 MB in the beginning and 1.8 GB in the end (delta: -844.2 MB). Peak memory consumption was 365.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,820 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:34:34,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.66 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,821 INFO L168 Benchmark]: Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,821 INFO L168 Benchmark]: RCFGBuilder took 390.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,821 INFO L168 Benchmark]: TraceAbstraction took 114119.00 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -704.7 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,822 INFO L168 Benchmark]: Witness Printer took 70.93 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 2.4 kB). Peak memory consumption was 2.4 kB. Max. memory is 11.5 GB. [2018-11-10 03:34:34,823 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.66 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 114119.00 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -704.7 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.93 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 2.4 kB). Peak memory consumption was 2.4 kB. 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 m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, E_1=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, token=0] [L475] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L479] CALL init_model() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L390] m_i = 1 [L391] RET t1_i = 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L479] init_model() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L424] CALL init_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L177] COND TRUE t1_i == 1 [L178] RET t1_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L424] init_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L276] COND FALSE, RET !(E_1 == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L425] fire_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=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, token=0] [L138] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L319] EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=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, token=0] [L157] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L426] activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L304] COND FALSE, RET !(E_1 == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L427] reset_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L434] CALL eval() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L208] int tmp ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=0] [L203] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L242] transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=0] [L203] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=1, 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, token=0] [L138] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=1, 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, token=0] [L319] EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=1, 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, token=0] [L157] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=1, 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, token=0] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] RET t1_st = 0 VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L51] immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] RET m_st = 2 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L228] master() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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=1, token=1] [L138] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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=1, token=1] [L319] EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=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=1, token=1] [L157] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=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=1, token=1] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=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(token)=0, E_1=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=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L111] immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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=1, token=1] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=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(token)=0, E_1=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, token=1] [L242] transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=1] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=1] [L203] RET return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=1] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 155 locations, 1 error locations. UNSAFE Result, 114.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 97.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4003 SDtfs, 6340 SDslu, 19384 SDs, 0 SdLazy, 14002 SolverSat, 2152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1520 GetRequests, 1161 SyntacticMatches, 22 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11694 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1954occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9847792912621798 AbsIntWeakeningRatio, 0.5532319391634981 AbsIntAvgWeakeningVarsNumRemoved, 693.712927756654 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 385 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2710 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2868 ConstructedInterpolants, 0 QuantifiedInterpolants, 586285 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1242/1278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...