/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-3af5e1f [2020-09-04 13:49:06,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:49:06,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:49:06,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:49:06,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:49:06,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:49:06,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:49:06,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:49:06,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:49:06,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:49:06,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:49:06,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:49:06,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:49:06,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:49:06,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:49:06,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:49:06,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:49:06,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:49:06,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:49:06,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:49:06,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:49:06,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:49:06,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:49:06,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:49:06,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:49:06,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:49:06,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:49:06,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:49:06,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:49:06,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:49:06,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:49:06,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:49:06,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:49:06,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:49:06,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:49:06,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:49:06,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:49:06,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:49:06,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:49:06,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:49:06,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:49:06,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:49:06,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:49:06,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:49:06,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:49:06,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:49:06,855 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:49:06,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:49:06,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:49:06,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:49:06,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:49:06,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:49:06,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:49:06,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:49:06,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:49:06,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:49:06,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:49:06,857 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:49:06,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:49:06,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:49:06,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:49:06,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:49:06,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:49:06,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:49:06,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:49:06,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:49:06,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:49:06,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:49:06,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:49:06,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:49:06,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:49:06,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:49:07,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:49:07,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:49:07,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:49:07,384 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:49:07,384 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:49:07,385 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-09-04 13:49:07,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ec65030a/a510df70892a4f968a1095d9935ed2ea/FLAG3a763f3f1 [2020-09-04 13:49:07,990 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:49:07,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-09-04 13:49:08,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ec65030a/a510df70892a4f968a1095d9935ed2ea/FLAG3a763f3f1 [2020-09-04 13:49:08,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ec65030a/a510df70892a4f968a1095d9935ed2ea [2020-09-04 13:49:08,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:49:08,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:49:08,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:49:08,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:49:08,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:49:08,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1265c732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08, skipping insertion in model container [2020-09-04 13:49:08,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:49:08,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:49:08,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:49:08,661 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:49:08,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:49:08,729 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:49:08,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08 WrapperNode [2020-09-04 13:49:08,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:49:08,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:49:08,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:49:08,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:49:08,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... [2020-09-04 13:49:08,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:49:08,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:49:08,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:49:08,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:49:08,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:49:08,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:49:08,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:49:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:49:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 13:49:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 13:49:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 13:49:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 13:49:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 13:49:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 13:49:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 13:49:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 13:49:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 13:49:08,958 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:49:08,958 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:49:08,958 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:49:08,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:49:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:49:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:49:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:49:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 13:49:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 13:49:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 13:49:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 13:49:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 13:49:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 13:49:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 13:49:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:49:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:49:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:49:09,477 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:49:09,477 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-09-04 13:49:09,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:49:09 BoogieIcfgContainer [2020-09-04 13:49:09,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:49:09,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:49:09,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:49:09,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:49:09,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:49:08" (1/3) ... [2020-09-04 13:49:09,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d349d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:49:09, skipping insertion in model container [2020-09-04 13:49:09,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:49:08" (2/3) ... [2020-09-04 13:49:09,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d349d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:49:09, skipping insertion in model container [2020-09-04 13:49:09,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:49:09" (3/3) ... [2020-09-04 13:49:09,493 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-09-04 13:49:09,502 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:49:09,510 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:49:09,530 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:49:09,561 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:49:09,561 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:49:09,562 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:49:09,562 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:49:09,562 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:49:09,562 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:49:09,562 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:49:09,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:49:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-09-04 13:49:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 13:49:09,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:09,600 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-09-04 13:49:09,600 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2020-09-04 13:49:09,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:09,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487454822] [2020-09-04 13:49:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:09,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:49:10,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487454822] [2020-09-04 13:49:10,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:10,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:49:10,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506569958] [2020-09-04 13:49:10,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:49:10,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:49:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:49:10,180 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 9 states. [2020-09-04 13:49:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:12,115 INFO L93 Difference]: Finished difference Result 479 states and 724 transitions. [2020-09-04 13:49:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:49:12,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-09-04 13:49:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:12,150 INFO L225 Difference]: With dead ends: 479 [2020-09-04 13:49:12,150 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 13:49:12,157 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-09-04 13:49:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 13:49:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2020-09-04 13:49:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-09-04 13:49:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2020-09-04 13:49:12,274 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 75 [2020-09-04 13:49:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:12,275 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2020-09-04 13:49:12,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:49:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2020-09-04 13:49:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 13:49:12,279 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:12,279 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-09-04 13:49:12,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:49:12,280 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1022106246, now seen corresponding path program 1 times [2020-09-04 13:49:12,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:12,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110486218] [2020-09-04 13:49:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:49:12,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110486218] [2020-09-04 13:49:12,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:12,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:12,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624503684] [2020-09-04 13:49:12,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:12,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:12,500 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand 10 states. [2020-09-04 13:49:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:13,578 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2020-09-04 13:49:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:49:13,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-09-04 13:49:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:13,584 INFO L225 Difference]: With dead ends: 545 [2020-09-04 13:49:13,584 INFO L226 Difference]: Without dead ends: 331 [2020-09-04 13:49:13,587 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-09-04 13:49:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-09-04 13:49:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2020-09-04 13:49:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-09-04 13:49:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2020-09-04 13:49:13,631 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 75 [2020-09-04 13:49:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:13,631 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2020-09-04 13:49:13,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2020-09-04 13:49:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 13:49:13,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:13,634 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-09-04 13:49:13,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:49:13,635 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -437656962, now seen corresponding path program 1 times [2020-09-04 13:49:13,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:13,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109332420] [2020-09-04 13:49:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:49:13,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109332420] [2020-09-04 13:49:13,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:13,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:13,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858750090] [2020-09-04 13:49:13,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:13,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:13,829 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand 10 states. [2020-09-04 13:49:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:15,227 INFO L93 Difference]: Finished difference Result 548 states and 738 transitions. [2020-09-04 13:49:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:49:15,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-09-04 13:49:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:15,232 INFO L225 Difference]: With dead ends: 548 [2020-09-04 13:49:15,232 INFO L226 Difference]: Without dead ends: 335 [2020-09-04 13:49:15,234 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-09-04 13:49:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-09-04 13:49:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 238. [2020-09-04 13:49:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-09-04 13:49:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2020-09-04 13:49:15,268 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 75 [2020-09-04 13:49:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:15,269 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2020-09-04 13:49:15,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2020-09-04 13:49:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 13:49:15,271 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:15,272 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-09-04 13:49:15,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:49:15,272 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2011943168, now seen corresponding path program 1 times [2020-09-04 13:49:15,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:15,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912825270] [2020-09-04 13:49:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:49:15,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912825270] [2020-09-04 13:49:15,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:15,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:49:15,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658323443] [2020-09-04 13:49:15,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:49:15,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:49:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:49:15,482 INFO L87 Difference]: Start difference. First operand 238 states and 297 transitions. Second operand 9 states. [2020-09-04 13:49:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:17,261 INFO L93 Difference]: Finished difference Result 848 states and 1162 transitions. [2020-09-04 13:49:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:49:17,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-09-04 13:49:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:17,269 INFO L225 Difference]: With dead ends: 848 [2020-09-04 13:49:17,270 INFO L226 Difference]: Without dead ends: 630 [2020-09-04 13:49:17,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:49:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-09-04 13:49:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 459. [2020-09-04 13:49:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-09-04 13:49:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 573 transitions. [2020-09-04 13:49:17,342 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 573 transitions. Word has length 75 [2020-09-04 13:49:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:17,343 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 573 transitions. [2020-09-04 13:49:17,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:49:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 573 transitions. [2020-09-04 13:49:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-09-04 13:49:17,352 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:17,353 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-09-04 13:49:17,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:49:17,353 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:17,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash -3480132, now seen corresponding path program 1 times [2020-09-04 13:49:17,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:17,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599165084] [2020-09-04 13:49:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:49:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 13:49:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 13:49:17,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599165084] [2020-09-04 13:49:17,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:17,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:49:17,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588036032] [2020-09-04 13:49:17,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:49:17,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:49:17,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:49:17,624 INFO L87 Difference]: Start difference. First operand 459 states and 573 transitions. Second operand 11 states. [2020-09-04 13:49:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:19,139 INFO L93 Difference]: Finished difference Result 1125 states and 1520 transitions. [2020-09-04 13:49:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:49:19,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-09-04 13:49:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:19,145 INFO L225 Difference]: With dead ends: 1125 [2020-09-04 13:49:19,145 INFO L226 Difference]: Without dead ends: 686 [2020-09-04 13:49:19,148 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-09-04 13:49:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-09-04 13:49:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-09-04 13:49:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-09-04 13:49:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2020-09-04 13:49:19,200 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 93 [2020-09-04 13:49:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:19,200 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2020-09-04 13:49:19,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:49:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2020-09-04 13:49:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-09-04 13:49:19,202 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:19,202 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-09-04 13:49:19,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:49:19,203 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2020-09-04 13:49:19,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:19,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815161126] [2020-09-04 13:49:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:49:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 13:49:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 13:49:19,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815161126] [2020-09-04 13:49:19,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:19,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:49:19,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401768057] [2020-09-04 13:49:19,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:49:19,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:49:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:49:19,379 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 11 states. [2020-09-04 13:49:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:21,144 INFO L93 Difference]: Finished difference Result 1387 states and 1883 transitions. [2020-09-04 13:49:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 13:49:21,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-09-04 13:49:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:21,151 INFO L225 Difference]: With dead ends: 1387 [2020-09-04 13:49:21,151 INFO L226 Difference]: Without dead ends: 859 [2020-09-04 13:49:21,154 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-09-04 13:49:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-09-04 13:49:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2020-09-04 13:49:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-09-04 13:49:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 788 transitions. [2020-09-04 13:49:21,222 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 788 transitions. Word has length 93 [2020-09-04 13:49:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:21,223 INFO L479 AbstractCegarLoop]: Abstraction has 647 states and 788 transitions. [2020-09-04 13:49:21,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:49:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 788 transitions. [2020-09-04 13:49:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-09-04 13:49:21,224 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:21,224 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-09-04 13:49:21,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:49:21,225 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2020-09-04 13:49:21,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:21,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103842700] [2020-09-04 13:49:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:49:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 13:49:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:49:21,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103842700] [2020-09-04 13:49:21,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258879845] [2020-09-04 13:49:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:49:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:21,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:49:21,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:49:21,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:21,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-09-04 13:49:21,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434132332] [2020-09-04 13:49:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:21,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:49:21,537 INFO L87 Difference]: Start difference. First operand 647 states and 788 transitions. Second operand 3 states. [2020-09-04 13:49:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:21,669 INFO L93 Difference]: Finished difference Result 1832 states and 2257 transitions. [2020-09-04 13:49:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:21,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-09-04 13:49:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:21,676 INFO L225 Difference]: With dead ends: 1832 [2020-09-04 13:49:21,676 INFO L226 Difference]: Without dead ends: 932 [2020-09-04 13:49:21,679 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-09-04 13:49:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-09-04 13:49:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 868. [2020-09-04 13:49:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-09-04 13:49:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2020-09-04 13:49:21,757 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 93 [2020-09-04 13:49:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:21,758 INFO L479 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2020-09-04 13:49:21,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2020-09-04 13:49:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 13:49:21,760 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:21,760 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-09-04 13:49:21,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:49:21,973 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash 785362142, now seen corresponding path program 1 times [2020-09-04 13:49:21,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:21,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066672937] [2020-09-04 13:49:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:49:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 13:49:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-04 13:49:22,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066672937] [2020-09-04 13:49:22,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447677676] [2020-09-04 13:49:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:49:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:49:22,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:49:22,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:22,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-09-04 13:49:22,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065676678] [2020-09-04 13:49:22,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:22,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:22,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:49:22,349 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 3 states. [2020-09-04 13:49:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:22,475 INFO L93 Difference]: Finished difference Result 2342 states and 2870 transitions. [2020-09-04 13:49:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:22,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-09-04 13:49:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:22,485 INFO L225 Difference]: With dead ends: 2342 [2020-09-04 13:49:22,485 INFO L226 Difference]: Without dead ends: 1495 [2020-09-04 13:49:22,490 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-09-04 13:49:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2020-09-04 13:49:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1422. [2020-09-04 13:49:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2020-09-04 13:49:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1721 transitions. [2020-09-04 13:49:22,630 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1721 transitions. Word has length 128 [2020-09-04 13:49:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:22,631 INFO L479 AbstractCegarLoop]: Abstraction has 1422 states and 1721 transitions. [2020-09-04 13:49:22,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1721 transitions. [2020-09-04 13:49:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-04 13:49:22,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:22,634 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-09-04 13:49:22,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:22,847 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2094315367, now seen corresponding path program 1 times [2020-09-04 13:49:22,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:22,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486119186] [2020-09-04 13:49:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:49:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:49:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:49:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:49:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 13:49:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 13:49:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:22,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:23,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:23,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:23,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-09-04 13:49:23,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486119186] [2020-09-04 13:49:23,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:23,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:23,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430096968] [2020-09-04 13:49:23,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:23,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:23,026 INFO L87 Difference]: Start difference. First operand 1422 states and 1721 transitions. Second operand 10 states. [2020-09-04 13:49:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:24,274 INFO L93 Difference]: Finished difference Result 3221 states and 4080 transitions. [2020-09-04 13:49:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:49:24,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-09-04 13:49:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:24,287 INFO L225 Difference]: With dead ends: 3221 [2020-09-04 13:49:24,288 INFO L226 Difference]: Without dead ends: 1820 [2020-09-04 13:49:24,292 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-09-04 13:49:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-09-04 13:49:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1483. [2020-09-04 13:49:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-09-04 13:49:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1816 transitions. [2020-09-04 13:49:24,426 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1816 transitions. Word has length 129 [2020-09-04 13:49:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:24,426 INFO L479 AbstractCegarLoop]: Abstraction has 1483 states and 1816 transitions. [2020-09-04 13:49:24,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1816 transitions. [2020-09-04 13:49:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-04 13:49:24,429 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:24,429 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-09-04 13:49:24,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:49:24,430 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2020-09-04 13:49:24,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:24,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599201099] [2020-09-04 13:49:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:49:24,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:49:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:49:24,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:49:24,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:49:24,526 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:49:24,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:49:24,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:49:24 BoogieIcfgContainer [2020-09-04 13:49:24,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:49:24,642 INFO L168 Benchmark]: Toolchain (without parser) took 16344.03 ms. Allocated memory was 140.0 MB in the beginning and 392.2 MB in the end (delta: 252.2 MB). Free memory was 103.9 MB in the beginning and 253.4 MB in the end (delta: -149.5 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,643 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 140.0 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.41 ms. Allocated memory is still 140.0 MB. Free memory was 103.5 MB in the beginning and 90.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,645 INFO L168 Benchmark]: Boogie Preprocessor took 138.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 90.4 MB in the beginning and 177.4 MB in the end (delta: -86.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,645 INFO L168 Benchmark]: RCFGBuilder took 614.40 ms. Allocated memory is still 199.8 MB. Free memory was 177.4 MB in the beginning and 147.5 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,646 INFO L168 Benchmark]: TraceAbstraction took 15154.43 ms. Allocated memory was 199.8 MB in the beginning and 392.2 MB in the end (delta: 192.4 MB). Free memory was 146.8 MB in the beginning and 253.4 MB in the end (delta: -106.6 MB). Peak memory consumption was 85.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:24,650 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 140.0 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 431.41 ms. Allocated memory is still 140.0 MB. Free memory was 103.5 MB in the beginning and 90.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 90.4 MB in the beginning and 177.4 MB in the end (delta: -86.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 614.40 ms. Allocated memory is still 199.8 MB. Free memory was 177.4 MB in the beginning and 147.5 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15154.43 ms. Allocated memory was 199.8 MB in the beginning and 392.2 MB in the end (delta: 192.4 MB). Free memory was 146.8 MB in the beginning and 253.4 MB in the end (delta: -106.6 MB). Peak memory consumption was 85.8 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: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1384 SDtfs, 4230 SDslu, 726 SDs, 0 SdLazy, 6226 SolverSat, 2373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.2s 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.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s 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...