/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 17:04:12,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 17:04:12,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 17:04:12,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 17:04:12,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 17:04:12,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 17:04:12,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 17:04:12,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 17:04:12,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 17:04:12,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 17:04:12,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 17:04:12,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 17:04:12,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 17:04:12,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 17:04:12,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 17:04:12,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 17:04:12,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 17:04:12,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 17:04:12,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 17:04:12,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 17:04:12,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 17:04:12,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 17:04:12,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 17:04:12,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 17:04:12,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 17:04:12,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 17:04:12,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 17:04:12,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 17:04:12,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 17:04:12,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 17:04:12,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 17:04:12,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 17:04:12,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 17:04:12,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 17:04:12,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 17:04:12,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 17:04:12,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 17:04:12,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 17:04:12,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 17:04:12,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 17:04:12,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 17:04:12,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 17:04:12,720 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 17:04:12,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 17:04:12,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 17:04:12,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 17:04:12,722 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 17:04:12,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 17:04:12,723 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 17:04:12,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 17:04:12,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 17:04:12,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 17:04:12,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 17:04:12,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 17:04:12,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 17:04:12,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 17:04:12,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 17:04:12,724 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 17:04:12,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 17:04:12,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 17:04:12,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 17:04:12,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 17:04:12,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 17:04:12,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:04:12,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 17:04:12,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 17:04:12,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 17:04:12,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 17:04:12,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 17:04:12,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 17:04:12,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 17:04:12,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 17:04:13,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 17:04:13,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 17:04:13,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 17:04:13,094 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 17:04:13,094 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 17:04:13,095 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-08-22 17:04:13,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c716a46/fa20591edda84763912b054975d8caba/FLAG12b3e7349 [2020-08-22 17:04:13,650 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 17:04:13,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-08-22 17:04:13,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c716a46/fa20591edda84763912b054975d8caba/FLAG12b3e7349 [2020-08-22 17:04:13,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c716a46/fa20591edda84763912b054975d8caba [2020-08-22 17:04:13,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 17:04:13,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 17:04:13,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 17:04:13,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 17:04:13,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 17:04:13,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:13" (1/1) ... [2020-08-22 17:04:13,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482ef829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:13, skipping insertion in model container [2020-08-22 17:04:13,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:13" (1/1) ... [2020-08-22 17:04:14,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 17:04:14,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 17:04:14,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:04:14,258 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 17:04:14,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:04:14,408 INFO L208 MainTranslator]: Completed translation [2020-08-22 17:04:14,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14 WrapperNode [2020-08-22 17:04:14,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 17:04:14,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 17:04:14,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 17:04:14,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 17:04:14,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 17:04:14,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 17:04:14,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 17:04:14,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 17:04:14,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (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 [2020-08-22 17:04:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 17:04:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 17:04:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 17:04:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 17:04:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 17:04:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 17:04:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 17:04:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 17:04:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 17:04:14,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 17:04:14,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 17:04:14,524 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 17:04:14,524 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 17:04:14,524 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 17:04:14,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 17:04:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 17:04:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 17:04:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 17:04:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 17:04:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 17:04:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 17:04:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 17:04:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 17:04:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 17:04:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 17:04:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 17:04:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 17:04:14,967 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 17:04:14,967 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-08-22 17:04:14,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:14 BoogieIcfgContainer [2020-08-22 17:04:14,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 17:04:14,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 17:04:14,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 17:04:14,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 17:04:14,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:04:13" (1/3) ... [2020-08-22 17:04:14,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d584cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:14, skipping insertion in model container [2020-08-22 17:04:14,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (2/3) ... [2020-08-22 17:04:14,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d584cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:14, skipping insertion in model container [2020-08-22 17:04:14,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:14" (3/3) ... [2020-08-22 17:04:14,991 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-08-22 17:04:15,009 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 17:04:15,017 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 17:04:15,032 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 17:04:15,060 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 17:04:15,060 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 17:04:15,060 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 17:04:15,061 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 17:04:15,061 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 17:04:15,061 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 17:04:15,061 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 17:04:15,062 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 17:04:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-08-22 17:04:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-08-22 17:04:15,099 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:15,100 INFO L422 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] [2020-08-22 17:04:15,100 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2020-08-22 17:04:15,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:15,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521224177] [2020-08-22 17:04:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:15,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521224177] [2020-08-22 17:04:15,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:15,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:04:15,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624718742] [2020-08-22 17:04:15,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:04:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:04:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:15,720 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 9 states. [2020-08-22 17:04:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:17,639 INFO L93 Difference]: Finished difference Result 479 states and 724 transitions. [2020-08-22 17:04:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 17:04:17,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-08-22 17:04:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:17,674 INFO L225 Difference]: With dead ends: 479 [2020-08-22 17:04:17,675 INFO L226 Difference]: Without dead ends: 340 [2020-08-22 17:04:17,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-08-22 17:04:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-08-22 17:04:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2020-08-22 17:04:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-08-22 17:04:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2020-08-22 17:04:17,836 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 75 [2020-08-22 17:04:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:17,837 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2020-08-22 17:04:17,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:04:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2020-08-22 17:04:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-08-22 17:04:17,852 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:17,853 INFO L422 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] [2020-08-22 17:04:17,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 17:04:17,858 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:17,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1022106246, now seen corresponding path program 1 times [2020-08-22 17:04:17,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:17,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281988163] [2020-08-22 17:04:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:17,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:17,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:17,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:18,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281988163] [2020-08-22 17:04:18,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:18,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:18,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302991556] [2020-08-22 17:04:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:18,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:18,086 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand 10 states. [2020-08-22 17:04:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:19,170 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2020-08-22 17:04:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:04:19,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-08-22 17:04:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:19,179 INFO L225 Difference]: With dead ends: 545 [2020-08-22 17:04:19,179 INFO L226 Difference]: Without dead ends: 331 [2020-08-22 17:04:19,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:04:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-08-22 17:04:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2020-08-22 17:04:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-08-22 17:04:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2020-08-22 17:04:19,254 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 75 [2020-08-22 17:04:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:19,254 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2020-08-22 17:04:19,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2020-08-22 17:04:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-08-22 17:04:19,258 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:19,258 INFO L422 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] [2020-08-22 17:04:19,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 17:04:19,258 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:19,259 INFO L82 PathProgramCache]: Analyzing trace with hash -437656962, now seen corresponding path program 1 times [2020-08-22 17:04:19,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:19,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470352864] [2020-08-22 17:04:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:19,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470352864] [2020-08-22 17:04:19,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:19,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:19,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168997413] [2020-08-22 17:04:19,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:19,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:19,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:19,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:19,466 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand 10 states. [2020-08-22 17:04:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:20,842 INFO L93 Difference]: Finished difference Result 548 states and 738 transitions. [2020-08-22 17:04:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:04:20,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-08-22 17:04:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:20,851 INFO L225 Difference]: With dead ends: 548 [2020-08-22 17:04:20,851 INFO L226 Difference]: Without dead ends: 335 [2020-08-22 17:04:20,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:04:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-08-22 17:04:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 238. [2020-08-22 17:04:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-08-22 17:04:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2020-08-22 17:04:20,907 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 75 [2020-08-22 17:04:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:20,909 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2020-08-22 17:04:20,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2020-08-22 17:04:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-08-22 17:04:20,916 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:20,916 INFO L422 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] [2020-08-22 17:04:20,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 17:04:20,917 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2011943168, now seen corresponding path program 1 times [2020-08-22 17:04:20,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:20,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420966569] [2020-08-22 17:04:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:21,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420966569] [2020-08-22 17:04:21,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:21,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:04:21,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601796676] [2020-08-22 17:04:21,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:04:21,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:04:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:21,085 INFO L87 Difference]: Start difference. First operand 238 states and 297 transitions. Second operand 9 states. [2020-08-22 17:04:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:22,795 INFO L93 Difference]: Finished difference Result 848 states and 1162 transitions. [2020-08-22 17:04:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 17:04:22,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-08-22 17:04:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:22,801 INFO L225 Difference]: With dead ends: 848 [2020-08-22 17:04:22,802 INFO L226 Difference]: Without dead ends: 630 [2020-08-22 17:04:22,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:04:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-08-22 17:04:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 459. [2020-08-22 17:04:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-08-22 17:04:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 573 transitions. [2020-08-22 17:04:22,869 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 573 transitions. Word has length 75 [2020-08-22 17:04:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:22,870 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 573 transitions. [2020-08-22 17:04:22,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:04:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 573 transitions. [2020-08-22 17:04:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-08-22 17:04:22,874 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:22,874 INFO L422 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] [2020-08-22 17:04:22,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 17:04:22,875 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -3480132, now seen corresponding path program 1 times [2020-08-22 17:04:22,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:22,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521730293] [2020-08-22 17:04:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 17:04:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-08-22 17:04:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 17:04:23,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521730293] [2020-08-22 17:04:23,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:23,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 17:04:23,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492299438] [2020-08-22 17:04:23,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 17:04:23,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:23,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 17:04:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:04:23,110 INFO L87 Difference]: Start difference. First operand 459 states and 573 transitions. Second operand 11 states. [2020-08-22 17:04:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:24,479 INFO L93 Difference]: Finished difference Result 1125 states and 1520 transitions. [2020-08-22 17:04:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 17:04:24,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-08-22 17:04:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:24,486 INFO L225 Difference]: With dead ends: 1125 [2020-08-22 17:04:24,486 INFO L226 Difference]: Without dead ends: 686 [2020-08-22 17:04:24,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:04:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-08-22 17:04:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-08-22 17:04:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-08-22 17:04:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2020-08-22 17:04:24,553 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 93 [2020-08-22 17:04:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:24,554 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2020-08-22 17:04:24,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 17:04:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2020-08-22 17:04:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-08-22 17:04:24,556 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:24,556 INFO L422 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] [2020-08-22 17:04:24,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 17:04:24,557 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2020-08-22 17:04:24,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:24,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017118578] [2020-08-22 17:04:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 17:04:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-08-22 17:04:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 17:04:24,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017118578] [2020-08-22 17:04:24,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 17:04:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001369681] [2020-08-22 17:04:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 17:04:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 17:04:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:04:24,784 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 11 states. [2020-08-22 17:04:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:26,547 INFO L93 Difference]: Finished difference Result 1387 states and 1883 transitions. [2020-08-22 17:04:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 17:04:26,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-08-22 17:04:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:26,556 INFO L225 Difference]: With dead ends: 1387 [2020-08-22 17:04:26,556 INFO L226 Difference]: Without dead ends: 859 [2020-08-22 17:04:26,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2020-08-22 17:04:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-08-22 17:04:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2020-08-22 17:04:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-08-22 17:04:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 788 transitions. [2020-08-22 17:04:26,629 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 788 transitions. Word has length 93 [2020-08-22 17:04:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:26,631 INFO L479 AbstractCegarLoop]: Abstraction has 647 states and 788 transitions. [2020-08-22 17:04:26,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 17:04:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 788 transitions. [2020-08-22 17:04:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-08-22 17:04:26,634 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:26,634 INFO L422 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] [2020-08-22 17:04:26,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 17:04:26,634 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2020-08-22 17:04:26,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:26,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657227398] [2020-08-22 17:04:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 17:04:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-08-22 17:04:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 17:04:26,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657227398] [2020-08-22 17:04:26,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852372825] [2020-08-22 17:04:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:04:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:26,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2020-08-22 17:04:26,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:04:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:26,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:04:26,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-08-22 17:04:26,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468873490] [2020-08-22 17:04:26,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:04:26,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:04:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:26,939 INFO L87 Difference]: Start difference. First operand 647 states and 788 transitions. Second operand 3 states. [2020-08-22 17:04:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:27,064 INFO L93 Difference]: Finished difference Result 1832 states and 2257 transitions. [2020-08-22 17:04:27,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:04:27,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-08-22 17:04:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:27,072 INFO L225 Difference]: With dead ends: 1832 [2020-08-22 17:04:27,073 INFO L226 Difference]: Without dead ends: 932 [2020-08-22 17:04:27,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-08-22 17:04:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 868. [2020-08-22 17:04:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-08-22 17:04:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2020-08-22 17:04:27,172 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 93 [2020-08-22 17:04:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:27,172 INFO L479 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2020-08-22 17:04:27,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:04:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2020-08-22 17:04:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-22 17:04:27,176 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:27,176 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:27,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-08-22 17:04:27,391 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash 785362142, now seen corresponding path program 1 times [2020-08-22 17:04:27,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:27,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732049785] [2020-08-22 17:04:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 17:04:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-08-22 17:04:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 17:04:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-08-22 17:04:27,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732049785] [2020-08-22 17:04:27,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53865979] [2020-08-22 17:04:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:04:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2020-08-22 17:04:27,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:04:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:04:27,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:04:27,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-08-22 17:04:27,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68501709] [2020-08-22 17:04:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:04:27,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:04:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:27,763 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 3 states. [2020-08-22 17:04:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:27,884 INFO L93 Difference]: Finished difference Result 2342 states and 2870 transitions. [2020-08-22 17:04:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:04:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-08-22 17:04:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:27,896 INFO L225 Difference]: With dead ends: 2342 [2020-08-22 17:04:27,896 INFO L226 Difference]: Without dead ends: 1495 [2020-08-22 17:04:27,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2020-08-22 17:04:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1422. [2020-08-22 17:04:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2020-08-22 17:04:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1721 transitions. [2020-08-22 17:04:28,044 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1721 transitions. Word has length 128 [2020-08-22 17:04:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:28,044 INFO L479 AbstractCegarLoop]: Abstraction has 1422 states and 1721 transitions. [2020-08-22 17:04:28,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:04:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1721 transitions. [2020-08-22 17:04:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-08-22 17:04:28,051 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:28,051 INFO L422 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] [2020-08-22 17:04:28,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:04:28,264 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2094315367, now seen corresponding path program 1 times [2020-08-22 17:04:28,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:28,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010795145] [2020-08-22 17:04:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 17:04:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 17:04:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-08-22 17:04:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:04:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 17:04:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 17:04:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-08-22 17:04:28,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010795145] [2020-08-22 17:04:28,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:28,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:28,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611793189] [2020-08-22 17:04:28,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:28,533 INFO L87 Difference]: Start difference. First operand 1422 states and 1721 transitions. Second operand 10 states. [2020-08-22 17:04:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:29,664 INFO L93 Difference]: Finished difference Result 3221 states and 4080 transitions. [2020-08-22 17:04:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 17:04:29,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-08-22 17:04:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:29,683 INFO L225 Difference]: With dead ends: 3221 [2020-08-22 17:04:29,683 INFO L226 Difference]: Without dead ends: 1820 [2020-08-22 17:04:29,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-08-22 17:04:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-08-22 17:04:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1483. [2020-08-22 17:04:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-08-22 17:04:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1816 transitions. [2020-08-22 17:04:29,890 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1816 transitions. Word has length 129 [2020-08-22 17:04:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:29,890 INFO L479 AbstractCegarLoop]: Abstraction has 1483 states and 1816 transitions. [2020-08-22 17:04:29,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1816 transitions. [2020-08-22 17:04:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-08-22 17:04:29,901 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:29,902 INFO L422 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] [2020-08-22 17:04:29,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 17:04:29,902 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2020-08-22 17:04:29,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:29,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371994376] [2020-08-22 17:04:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:04:29,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:04:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:04:29,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:04:30,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 17:04:30,021 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 17:04:30,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 17:04:30,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:04:30 BoogieIcfgContainer [2020-08-22 17:04:30,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 17:04:30,159 INFO L168 Benchmark]: Toolchain (without parser) took 16173.14 ms. Allocated memory was 138.4 MB in the beginning and 420.5 MB in the end (delta: 282.1 MB). Free memory was 101.2 MB in the beginning and 161.9 MB in the end (delta: -60.7 MB). Peak memory consumption was 221.4 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,159 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.24 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 100.9 MB in the beginning and 178.0 MB in the end (delta: -77.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,162 INFO L168 Benchmark]: Boogie Preprocessor took 49.77 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 175.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,162 INFO L168 Benchmark]: RCFGBuilder took 514.70 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 146.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,165 INFO L168 Benchmark]: TraceAbstraction took 15180.42 ms. Allocated memory was 199.8 MB in the beginning and 420.5 MB in the end (delta: 220.7 MB). Free memory was 145.4 MB in the beginning and 161.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 204.2 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:30,171 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.48 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 423.24 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 100.9 MB in the beginning and 178.0 MB in the end (delta: -77.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.77 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 175.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 514.70 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 146.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15180.42 ms. Allocated memory was 199.8 MB in the beginning and 420.5 MB in the end (delta: 220.7 MB). Free memory was 145.4 MB in the beginning and 161.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 204.2 MB. Max. memory is 7.1 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)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \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=-2] [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. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.9s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1384 SDtfs, 4230 SDslu, 726 SDs, 0 SdLazy, 6232 SolverSat, 2372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1483occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1046 ConstructedInterpolants, 0 QuantifiedInterpolants, 193575 SizeOfPredicates, 1 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 153/159 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...