./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:53:52,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:53:52,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:53:52,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:53:52,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:53:52,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:53:52,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:53:52,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:53:52,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:53:52,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:53:52,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:53:52,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:53:52,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:53:52,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:53:52,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:53:52,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:53:52,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:53:52,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:53:52,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:53:52,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:53:52,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:53:52,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:53:52,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:53:52,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:53:52,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:53:52,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:53:52,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:53:52,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:53:52,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:53:52,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:53:52,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:53:52,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:53:52,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:53:52,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:53:52,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:53:52,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:53:52,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:53:52,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:53:52,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:53:52,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:53:52,293 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:53:52,293 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:53:52,294 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:53:52,294 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:53:52,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:53:52,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:53:52,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:53:52,295 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:53:52,295 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:53:52,296 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:53:52,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:53:52,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:53:52,299 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:53:52,299 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:53:52,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:53:52,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:53:52,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:53:52,300 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:53:52,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:53:52,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:53:52,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:53:52,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2018-11-28 18:53:52,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:53:52,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:53:52,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:53:52,358 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:53:52,358 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:53:52,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-28 18:53:52,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa521b9/73814acfbc284c2589ebcaa5fc357b02/FLAGe90b94626 [2018-11-28 18:53:52,943 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:53:52,944 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-28 18:53:52,957 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa521b9/73814acfbc284c2589ebcaa5fc357b02/FLAGe90b94626 [2018-11-28 18:53:53,273 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa521b9/73814acfbc284c2589ebcaa5fc357b02 [2018-11-28 18:53:53,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:53:53,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:53:53,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:53:53,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:53:53,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:53:53,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7108c9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53, skipping insertion in model container [2018-11-28 18:53:53,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:53:53,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:53:53,568 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:53:53,576 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:53:53,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:53:53,642 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:53:53,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53 WrapperNode [2018-11-28 18:53:53,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:53:53,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:53:53,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:53:53,645 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:53:53,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:53:53,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:53:53,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:53:53,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:53:53,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... [2018-11-28 18:53:53,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:53:53,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:53:53,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:53:53,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:53:53,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 18:53:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-28 18:53:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-28 18:53:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-28 18:53:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-28 18:53:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-28 18:53:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-28 18:53:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-28 18:53:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-28 18:53:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-28 18:53:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-28 18:53:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-28 18:53:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-28 18:53:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-28 18:53:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-28 18:53:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:53:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:53:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-28 18:53:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-28 18:53:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-28 18:53:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-28 18:53:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-28 18:53:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-28 18:53:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:53:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:53:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-28 18:53:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-28 18:53:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-28 18:53:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-28 18:53:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-28 18:53:53,876 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-28 18:53:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-28 18:53:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-28 18:53:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-28 18:53:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-28 18:53:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-28 18:53:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-28 18:53:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:53:53,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:53:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-28 18:53:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-28 18:53:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-28 18:53:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-28 18:53:54,736 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:53:54,737 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 18:53:54,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:53:54 BoogieIcfgContainer [2018-11-28 18:53:54,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:53:54,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:53:54,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:53:54,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:53:54,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:53:53" (1/3) ... [2018-11-28 18:53:54,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f089e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:53:54, skipping insertion in model container [2018-11-28 18:53:54,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:53:53" (2/3) ... [2018-11-28 18:53:54,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f089e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:53:54, skipping insertion in model container [2018-11-28 18:53:54,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:53:54" (3/3) ... [2018-11-28 18:53:54,745 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-28 18:53:54,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:53:54,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:53:54,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:53:54,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:53:54,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:53:54,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:53:54,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:53:54,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:53:54,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:53:54,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:53:54,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:53:54,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:53:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-11-28 18:53:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 18:53:54,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:54,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:54,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:54,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash -20311146, now seen corresponding path program 1 times [2018-11-28 18:53:54,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:54,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:54,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:55,280 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-28 18:53:55,396 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-28 18:53:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:53:55,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:53:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:53:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:53:55,423 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2018-11-28 18:53:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:53:56,733 INFO L93 Difference]: Finished difference Result 286 states and 405 transitions. [2018-11-28 18:53:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:53:56,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 18:53:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:53:56,750 INFO L225 Difference]: With dead ends: 286 [2018-11-28 18:53:56,750 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 18:53:56,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:53:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 18:53:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-11-28 18:53:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 18:53:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2018-11-28 18:53:56,830 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 75 [2018-11-28 18:53:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:53:56,830 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2018-11-28 18:53:56,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:53:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2018-11-28 18:53:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 18:53:56,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:56,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:56,836 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:56,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 423589528, now seen corresponding path program 1 times [2018-11-28 18:53:56,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:56,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:57,029 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-28 18:53:57,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:57,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:53:57,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:53:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:53:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:53:57,033 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 5 states. [2018-11-28 18:53:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:53:57,860 INFO L93 Difference]: Finished difference Result 279 states and 374 transitions. [2018-11-28 18:53:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:53:57,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 18:53:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:53:57,865 INFO L225 Difference]: With dead ends: 279 [2018-11-28 18:53:57,865 INFO L226 Difference]: Without dead ends: 168 [2018-11-28 18:53:57,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:53:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-28 18:53:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2018-11-28 18:53:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 18:53:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2018-11-28 18:53:57,906 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 75 [2018-11-28 18:53:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:53:57,907 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2018-11-28 18:53:57,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:53:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2018-11-28 18:53:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 18:53:57,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:57,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:57,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:57,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1961929558, now seen corresponding path program 1 times [2018-11-28 18:53:57,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:57,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:57,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:58,038 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-28 18:53:58,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:58,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:53:58,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:53:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:53:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:53:58,040 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand 4 states. [2018-11-28 18:53:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:53:58,337 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2018-11-28 18:53:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:53:58,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-11-28 18:53:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:53:58,343 INFO L225 Difference]: With dead ends: 339 [2018-11-28 18:53:58,343 INFO L226 Difference]: Without dead ends: 229 [2018-11-28 18:53:58,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:53:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-28 18:53:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2018-11-28 18:53:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 18:53:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2018-11-28 18:53:58,385 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 75 [2018-11-28 18:53:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:53:58,386 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2018-11-28 18:53:58,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:53:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2018-11-28 18:53:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 18:53:58,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:58,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:58,388 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:58,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:58,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1088451863, now seen corresponding path program 1 times [2018-11-28 18:53:58,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:58,530 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-28 18:53:58,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:53:58,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:53:58,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:53:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:53:58,532 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand 6 states. [2018-11-28 18:53:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:53:58,650 INFO L93 Difference]: Finished difference Result 438 states and 566 transitions. [2018-11-28 18:53:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:53:58,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-28 18:53:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:53:58,658 INFO L225 Difference]: With dead ends: 438 [2018-11-28 18:53:58,658 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 18:53:58,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:53:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 18:53:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-11-28 18:53:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-28 18:53:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2018-11-28 18:53:58,693 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 75 [2018-11-28 18:53:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:53:58,694 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2018-11-28 18:53:58,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:53:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2018-11-28 18:53:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 18:53:58,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:58,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:58,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:58,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -756915303, now seen corresponding path program 1 times [2018-11-28 18:53:58,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:58,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:58,833 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-28 18:53:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:53:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:53:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:53:58,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:53:58,835 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand 4 states. [2018-11-28 18:53:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:53:59,722 INFO L93 Difference]: Finished difference Result 633 states and 828 transitions. [2018-11-28 18:53:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:53:59,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-11-28 18:53:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:53:59,726 INFO L225 Difference]: With dead ends: 633 [2018-11-28 18:53:59,726 INFO L226 Difference]: Without dead ends: 424 [2018-11-28 18:53:59,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:53:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-28 18:53:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2018-11-28 18:53:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 18:53:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 525 transitions. [2018-11-28 18:53:59,774 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 525 transitions. Word has length 75 [2018-11-28 18:53:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:53:59,774 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 525 transitions. [2018-11-28 18:53:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:53:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 525 transitions. [2018-11-28 18:53:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 18:53:59,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:53:59,777 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:53:59,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:53:59,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:53:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 4572085, now seen corresponding path program 1 times [2018-11-28 18:53:59,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:53:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:53:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:53:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:53:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:53:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 18:53:59,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:53:59,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:53:59,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:53:59,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:53:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:53:59,930 INFO L87 Difference]: Start difference. First operand 421 states and 525 transitions. Second operand 6 states. [2018-11-28 18:54:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:54:00,082 INFO L93 Difference]: Finished difference Result 836 states and 1062 transitions. [2018-11-28 18:54:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:54:00,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 18:54:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:54:00,096 INFO L225 Difference]: With dead ends: 836 [2018-11-28 18:54:00,096 INFO L226 Difference]: Without dead ends: 435 [2018-11-28 18:54:00,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:54:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-11-28 18:54:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-11-28 18:54:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-28 18:54:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 533 transitions. [2018-11-28 18:54:00,158 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 533 transitions. Word has length 93 [2018-11-28 18:54:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:54:00,159 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 533 transitions. [2018-11-28 18:54:00,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:54:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 533 transitions. [2018-11-28 18:54:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 18:54:00,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:54:00,163 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:54:00,163 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:54:00,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:54:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1943734131, now seen corresponding path program 1 times [2018-11-28 18:54:00,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:54:00,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:54:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:54:00,394 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-28 18:54:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 18:54:00,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:54:00,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:54:00,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:54:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:54:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:54:00,714 INFO L87 Difference]: Start difference. First operand 431 states and 533 transitions. Second operand 5 states. [2018-11-28 18:54:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:54:02,006 INFO L93 Difference]: Finished difference Result 841 states and 1048 transitions. [2018-11-28 18:54:02,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:54:02,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 18:54:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:54:02,010 INFO L225 Difference]: With dead ends: 841 [2018-11-28 18:54:02,010 INFO L226 Difference]: Without dead ends: 431 [2018-11-28 18:54:02,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:54:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-11-28 18:54:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-11-28 18:54:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-28 18:54:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2018-11-28 18:54:02,048 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 93 [2018-11-28 18:54:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:54:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2018-11-28 18:54:02,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:54:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2018-11-28 18:54:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 18:54:02,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:54:02,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:54:02,053 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:54:02,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:54:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1046340853, now seen corresponding path program 1 times [2018-11-28 18:54:02,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:54:02,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:54:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:54:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 18:54:02,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:54:02,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:54:02,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:54:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:54:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:54:02,263 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand 5 states. [2018-11-28 18:54:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:54:03,226 INFO L93 Difference]: Finished difference Result 908 states and 1116 transitions. [2018-11-28 18:54:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:54:03,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 18:54:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:54:03,235 INFO L225 Difference]: With dead ends: 908 [2018-11-28 18:54:03,235 INFO L226 Difference]: Without dead ends: 498 [2018-11-28 18:54:03,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:54:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-28 18:54:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2018-11-28 18:54:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 18:54:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 589 transitions. [2018-11-28 18:54:03,292 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 589 transitions. Word has length 93 [2018-11-28 18:54:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:54:03,293 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 589 transitions. [2018-11-28 18:54:03,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:54:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 589 transitions. [2018-11-28 18:54:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 18:54:03,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:54:03,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:54:03,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:54:03,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:54:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1294487347, now seen corresponding path program 1 times [2018-11-28 18:54:03,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:54:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:54:03,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:03,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:54:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:54:03,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:54:03,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 18:54:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:54:03,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:54:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:54:03,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:54:03,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-28 18:54:03,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:54:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:54:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:54:03,558 INFO L87 Difference]: Start difference. First operand 494 states and 589 transitions. Second operand 3 states. [2018-11-28 18:54:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:54:03,789 INFO L93 Difference]: Finished difference Result 1350 states and 1682 transitions. [2018-11-28 18:54:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:54:03,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-11-28 18:54:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:54:03,799 INFO L225 Difference]: With dead ends: 1350 [2018-11-28 18:54:03,799 INFO L226 Difference]: Without dead ends: 877 [2018-11-28 18:54:03,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-28 18:54:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-28 18:54:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 871. [2018-11-28 18:54:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-28 18:54:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1069 transitions. [2018-11-28 18:54:03,890 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1069 transitions. Word has length 93 [2018-11-28 18:54:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:54:03,891 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1069 transitions. [2018-11-28 18:54:03,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:54:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1069 transitions. [2018-11-28 18:54:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 18:54:03,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:54:03,893 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:54:03,893 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:54:03,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:54:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 933702169, now seen corresponding path program 1 times [2018-11-28 18:54:03,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:54:03,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:54:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:03,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:54:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:54:03,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:54:03,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:54:03,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:54:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:54:03,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:54:03,991 INFO L87 Difference]: Start difference. First operand 871 states and 1069 transitions. Second operand 3 states. [2018-11-28 18:54:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:54:04,303 INFO L93 Difference]: Finished difference Result 2329 states and 2911 transitions. [2018-11-28 18:54:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:54:04,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-11-28 18:54:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:54:04,310 INFO L225 Difference]: With dead ends: 2329 [2018-11-28 18:54:04,311 INFO L226 Difference]: Without dead ends: 615 [2018-11-28 18:54:04,317 INFO L631 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-28 18:54:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-28 18:54:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2018-11-28 18:54:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-11-28 18:54:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 741 transitions. [2018-11-28 18:54:04,374 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 741 transitions. Word has length 95 [2018-11-28 18:54:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:54:04,376 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 741 transitions. [2018-11-28 18:54:04,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:54:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 741 transitions. [2018-11-28 18:54:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-28 18:54:04,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:54:04,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:54:04,383 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:54:04,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:54:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -249854126, now seen corresponding path program 1 times [2018-11-28 18:54:04,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:54:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:54:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:54:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:54:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:54:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:54:04,490 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:54:04,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:54:04 BoogieIcfgContainer [2018-11-28 18:54:04,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:54:04,645 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:54:04,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:54:04,646 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:54:04,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:53:54" (3/4) ... [2018-11-28 18:54:04,651 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:54:04,783 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:54:04,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:54:04,787 INFO L168 Benchmark]: Toolchain (without parser) took 11506.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -309.2 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:54:04,788 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:54:04,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:54:04,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:54:04,792 INFO L168 Benchmark]: Boogie Preprocessor took 60.22 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:54:04,792 INFO L168 Benchmark]: RCFGBuilder took 996.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:54:04,793 INFO L168 Benchmark]: TraceAbstraction took 9906.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -172.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:54:04,793 INFO L168 Benchmark]: Witness Printer took 137.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:54:04,795 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.22 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 996.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9906.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -172.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Witness Printer took 137.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1957 SDtfs, 1748 SDslu, 2273 SDs, 0 SdLazy, 1097 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 119 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=871occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 89 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 924 ConstructedInterpolants, 0 QuantifiedInterpolants, 108016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 82/85 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...