/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-86f66a4 [2020-07-07 11:36:03,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:36:03,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:36:03,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:36:03,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:36:03,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:36:03,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:36:03,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:36:03,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:36:03,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:36:03,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:36:03,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:36:03,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:36:03,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:36:03,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:36:03,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:36:03,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:36:03,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:36:03,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:36:03,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:36:03,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:36:03,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:36:03,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:36:03,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:36:03,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:36:03,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:36:03,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:36:03,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:36:03,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:36:03,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:36:03,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:36:03,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:36:03,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:36:03,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:36:03,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:36:03,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:36:03,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:36:03,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:36:03,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:36:03,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:36:03,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:36:03,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:36:03,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:36:03,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:36:03,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:36:03,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:36:03,854 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:36:03,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:36:03,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:36:03,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:36:03,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:36:03,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:36:03,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:36:03,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:36:03,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:36:03,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:36:03,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:36:03,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:36:03,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:36:03,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:36:03,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:36:03,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:36:03,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:36:03,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:36:03,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:36:03,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:36:03,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:36:03,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:36:03,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:36:03,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:36:03,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:36:03,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:36:04,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:36:04,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:36:04,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:36:04,181 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:36:04,182 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:36:04,182 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-07 11:36:04,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1231271f1/6f4d87d40d63463297121123e072de2a/FLAG8d9ae2543 [2020-07-07 11:36:04,722 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:36:04,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-07 11:36:04,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1231271f1/6f4d87d40d63463297121123e072de2a/FLAG8d9ae2543 [2020-07-07 11:36:05,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1231271f1/6f4d87d40d63463297121123e072de2a [2020-07-07 11:36:05,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:36:05,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:36:05,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:05,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:36:05,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:36:05,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c045c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05, skipping insertion in model container [2020-07-07 11:36:05,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:36:05,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:36:05,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:05,474 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:36:05,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:05,646 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:36:05,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05 WrapperNode [2020-07-07 11:36:05,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:05,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:36:05,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:36:05,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:36:05,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:36:05,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:36:05,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:36:05,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:36:05,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:36:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:36:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-07 11:36:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-07 11:36:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 11:36:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 11:36:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:36:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:36:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:36:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 11:36:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-07 11:36:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 11:36:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-07 11:36:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 11:36:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 11:36:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 11:36:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:36:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:36:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:36:06,228 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:36:06,229 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-07 11:36:06,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:06 BoogieIcfgContainer [2020-07-07 11:36:06,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:36:06,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:36:06,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:36:06,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:36:06,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:36:05" (1/3) ... [2020-07-07 11:36:06,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5bdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:06, skipping insertion in model container [2020-07-07 11:36:06,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (2/3) ... [2020-07-07 11:36:06,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5bdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:06, skipping insertion in model container [2020-07-07 11:36:06,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:06" (3/3) ... [2020-07-07 11:36:06,242 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-07-07 11:36:06,249 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:36:06,256 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:36:06,267 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:36:06,290 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:36:06,290 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:36:06,290 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:36:06,290 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:36:06,291 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:36:06,291 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:36:06,291 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:36:06,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:36:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-07-07 11:36:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-07 11:36:06,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:06,326 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-07-07 11:36:06,326 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2020-07-07 11:36:06,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:06,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204115825] [2020-07-07 11:36:06,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:06,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204115825] [2020-07-07 11:36:06,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:06,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:36:06,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562856624] [2020-07-07 11:36:06,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:36:06,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:36:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:06,860 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 9 states. [2020-07-07 11:36:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:08,782 INFO L93 Difference]: Finished difference Result 479 states and 724 transitions. [2020-07-07 11:36:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:36:08,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-07 11:36:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:08,800 INFO L225 Difference]: With dead ends: 479 [2020-07-07 11:36:08,800 INFO L226 Difference]: Without dead ends: 340 [2020-07-07 11:36:08,805 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-07-07 11:36:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-07 11:36:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2020-07-07 11:36:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-07 11:36:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2020-07-07 11:36:08,902 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 75 [2020-07-07 11:36:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:08,903 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2020-07-07 11:36:08,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:36:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2020-07-07 11:36:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-07 11:36:08,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:08,907 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-07-07 11:36:08,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:36:08,908 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1022106246, now seen corresponding path program 1 times [2020-07-07 11:36:08,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:08,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417288541] [2020-07-07 11:36:08,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:09,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417288541] [2020-07-07 11:36:09,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:09,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:09,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104678153] [2020-07-07 11:36:09,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:09,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:09,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:09,143 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand 10 states. [2020-07-07 11:36:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:10,037 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2020-07-07 11:36:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:36:10,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-07 11:36:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:10,044 INFO L225 Difference]: With dead ends: 545 [2020-07-07 11:36:10,044 INFO L226 Difference]: Without dead ends: 331 [2020-07-07 11:36:10,046 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-07-07 11:36:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-07-07 11:36:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2020-07-07 11:36:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-07 11:36:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2020-07-07 11:36:10,088 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 75 [2020-07-07 11:36:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:10,089 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2020-07-07 11:36:10,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2020-07-07 11:36:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-07 11:36:10,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:10,092 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-07-07 11:36:10,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:36:10,092 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash -437656962, now seen corresponding path program 1 times [2020-07-07 11:36:10,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:10,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41006001] [2020-07-07 11:36:10,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:10,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41006001] [2020-07-07 11:36:10,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:10,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:10,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016316196] [2020-07-07 11:36:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:10,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:10,333 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand 10 states. [2020-07-07 11:36:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:11,536 INFO L93 Difference]: Finished difference Result 548 states and 738 transitions. [2020-07-07 11:36:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:36:11,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-07 11:36:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:11,545 INFO L225 Difference]: With dead ends: 548 [2020-07-07 11:36:11,545 INFO L226 Difference]: Without dead ends: 335 [2020-07-07 11:36:11,549 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-07-07 11:36:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-07-07 11:36:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 238. [2020-07-07 11:36:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-07 11:36:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2020-07-07 11:36:11,607 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 75 [2020-07-07 11:36:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:11,609 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2020-07-07 11:36:11,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2020-07-07 11:36:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-07 11:36:11,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:11,620 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-07-07 11:36:11,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:36:11,621 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2011943168, now seen corresponding path program 1 times [2020-07-07 11:36:11,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:11,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002178990] [2020-07-07 11:36:11,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:11,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002178990] [2020-07-07 11:36:11,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:11,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:36:11,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359740922] [2020-07-07 11:36:11,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:36:11,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:36:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:11,853 INFO L87 Difference]: Start difference. First operand 238 states and 297 transitions. Second operand 9 states. [2020-07-07 11:36:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:13,383 INFO L93 Difference]: Finished difference Result 848 states and 1162 transitions. [2020-07-07 11:36:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:36:13,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-07 11:36:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:13,388 INFO L225 Difference]: With dead ends: 848 [2020-07-07 11:36:13,389 INFO L226 Difference]: Without dead ends: 630 [2020-07-07 11:36:13,390 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-07-07 11:36:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-07-07 11:36:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 459. [2020-07-07 11:36:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-07-07 11:36:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 573 transitions. [2020-07-07 11:36:13,451 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 573 transitions. Word has length 75 [2020-07-07 11:36:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:13,451 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 573 transitions. [2020-07-07 11:36:13,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:36:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 573 transitions. [2020-07-07 11:36:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-07 11:36:13,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:13,456 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-07-07 11:36:13,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:36:13,457 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash -3480132, now seen corresponding path program 1 times [2020-07-07 11:36:13,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:13,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896813445] [2020-07-07 11:36:13,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-07 11:36:13,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896813445] [2020-07-07 11:36:13,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:13,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 11:36:13,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903772090] [2020-07-07 11:36:13,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:36:13,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:36:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:13,675 INFO L87 Difference]: Start difference. First operand 459 states and 573 transitions. Second operand 11 states. [2020-07-07 11:36:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:14,984 INFO L93 Difference]: Finished difference Result 1125 states and 1520 transitions. [2020-07-07 11:36:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:36:14,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-07 11:36:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:14,990 INFO L225 Difference]: With dead ends: 1125 [2020-07-07 11:36:14,990 INFO L226 Difference]: Without dead ends: 686 [2020-07-07 11:36:14,993 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-07-07 11:36:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-07-07 11:36:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-07-07 11:36:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-07-07 11:36:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2020-07-07 11:36:15,050 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 93 [2020-07-07 11:36:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:15,051 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2020-07-07 11:36:15,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:36:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2020-07-07 11:36:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-07 11:36:15,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:15,053 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-07-07 11:36:15,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:36:15,054 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2020-07-07 11:36:15,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:15,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101051107] [2020-07-07 11:36:15,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-07 11:36:15,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101051107] [2020-07-07 11:36:15,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:15,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 11:36:15,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100117987] [2020-07-07 11:36:15,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:36:15,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:36:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:15,240 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 11 states. [2020-07-07 11:36:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:16,724 INFO L93 Difference]: Finished difference Result 1387 states and 1883 transitions. [2020-07-07 11:36:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 11:36:16,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-07 11:36:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:16,733 INFO L225 Difference]: With dead ends: 1387 [2020-07-07 11:36:16,734 INFO L226 Difference]: Without dead ends: 859 [2020-07-07 11:36:16,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2020-07-07 11:36:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-07-07 11:36:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2020-07-07 11:36:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-07-07 11:36:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 788 transitions. [2020-07-07 11:36:16,819 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 788 transitions. Word has length 93 [2020-07-07 11:36:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:16,820 INFO L479 AbstractCegarLoop]: Abstraction has 647 states and 788 transitions. [2020-07-07 11:36:16,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:36:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 788 transitions. [2020-07-07 11:36:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-07 11:36:16,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:16,823 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-07-07 11:36:16,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:36:16,824 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2020-07-07 11:36:16,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:16,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381180050] [2020-07-07 11:36:16,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 11:36:16,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381180050] [2020-07-07 11:36:16,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954048414] [2020-07-07 11:36:16,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:17,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:17,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:17,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-07-07 11:36:17,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609993868] [2020-07-07 11:36:17,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:17,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:17,208 INFO L87 Difference]: Start difference. First operand 647 states and 788 transitions. Second operand 3 states. [2020-07-07 11:36:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:17,320 INFO L93 Difference]: Finished difference Result 1832 states and 2257 transitions. [2020-07-07 11:36:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:17,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-07-07 11:36:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:17,327 INFO L225 Difference]: With dead ends: 1832 [2020-07-07 11:36:17,328 INFO L226 Difference]: Without dead ends: 932 [2020-07-07 11:36:17,331 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-07-07 11:36:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-07-07 11:36:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 868. [2020-07-07 11:36:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-07-07 11:36:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2020-07-07 11:36:17,413 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 93 [2020-07-07 11:36:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:17,415 INFO L479 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2020-07-07 11:36:17,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2020-07-07 11:36:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-07 11:36:17,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:17,417 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-07-07 11:36:17,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 11:36:17,631 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 785362142, now seen corresponding path program 1 times [2020-07-07 11:36:17,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:17,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487547098] [2020-07-07 11:36:17,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-07 11:36:17,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487547098] [2020-07-07 11:36:17,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512165089] [2020-07-07 11:36:17,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:36:17,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:36:17,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:17,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-07 11:36:17,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905212338] [2020-07-07 11:36:17,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:17,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:17,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:17,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:17,985 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 3 states. [2020-07-07 11:36:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:18,102 INFO L93 Difference]: Finished difference Result 2342 states and 2870 transitions. [2020-07-07 11:36:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:18,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-07-07 11:36:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:18,111 INFO L225 Difference]: With dead ends: 2342 [2020-07-07 11:36:18,111 INFO L226 Difference]: Without dead ends: 1495 [2020-07-07 11:36:18,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2020-07-07 11:36:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1422. [2020-07-07 11:36:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2020-07-07 11:36:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1721 transitions. [2020-07-07 11:36:18,228 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1721 transitions. Word has length 128 [2020-07-07 11:36:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:18,229 INFO L479 AbstractCegarLoop]: Abstraction has 1422 states and 1721 transitions. [2020-07-07 11:36:18,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1721 transitions. [2020-07-07 11:36:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-07-07 11:36:18,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:18,232 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-07-07 11:36:18,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:18,446 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2094315367, now seen corresponding path program 1 times [2020-07-07 11:36:18,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:18,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122192563] [2020-07-07 11:36:18,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-07 11:36:18,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122192563] [2020-07-07 11:36:18,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:18,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:18,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357568467] [2020-07-07 11:36:18,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:18,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:18,605 INFO L87 Difference]: Start difference. First operand 1422 states and 1721 transitions. Second operand 10 states. [2020-07-07 11:36:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:19,711 INFO L93 Difference]: Finished difference Result 3221 states and 4080 transitions. [2020-07-07 11:36:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:36:19,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-07-07 11:36:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:19,725 INFO L225 Difference]: With dead ends: 3221 [2020-07-07 11:36:19,725 INFO L226 Difference]: Without dead ends: 1820 [2020-07-07 11:36:19,730 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-07-07 11:36:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-07-07 11:36:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1483. [2020-07-07 11:36:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-07-07 11:36:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1816 transitions. [2020-07-07 11:36:19,870 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1816 transitions. Word has length 129 [2020-07-07 11:36:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:19,870 INFO L479 AbstractCegarLoop]: Abstraction has 1483 states and 1816 transitions. [2020-07-07 11:36:19,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1816 transitions. [2020-07-07 11:36:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-07-07 11:36:19,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:19,878 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-07-07 11:36:19,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:36:19,878 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2020-07-07 11:36:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:19,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218559456] [2020-07-07 11:36:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:36:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:36:19,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:36:19,998 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:36:19,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 11:36:20,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:36:20 BoogieIcfgContainer [2020-07-07 11:36:20,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:36:20,139 INFO L168 Benchmark]: Toolchain (without parser) took 14992.37 ms. Allocated memory was 137.9 MB in the beginning and 411.6 MB in the end (delta: 273.7 MB). Free memory was 102.1 MB in the beginning and 102.7 MB in the end (delta: -565.6 kB). Peak memory consumption was 273.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,140 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.84 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 101.9 MB in the beginning and 177.1 MB in the end (delta: -75.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,145 INFO L168 Benchmark]: Boogie Preprocessor took 55.04 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 175.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,146 INFO L168 Benchmark]: RCFGBuilder took 531.37 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 145.2 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,146 INFO L168 Benchmark]: TraceAbstraction took 13901.55 ms. Allocated memory was 199.8 MB in the beginning and 411.6 MB in the end (delta: 211.8 MB). Free memory was 144.6 MB in the beginning and 102.7 MB in the end (delta: 41.9 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:20,155 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 499.84 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 101.9 MB in the beginning and 177.1 MB in the end (delta: -75.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.04 ms. Allocated memory is still 199.8 MB. Free memory was 177.1 MB in the beginning and 175.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.37 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 145.2 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13901.55 ms. Allocated memory was 199.8 MB in the beginning and 411.6 MB in the end (delta: 211.8 MB). Free memory was 144.6 MB in the beginning and 102.7 MB in the end (delta: 41.9 MB). Peak memory consumption was 253.7 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)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1384 SDtfs, 4230 SDslu, 726 SDs, 0 SdLazy, 6226 SolverSat, 2378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1483occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.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, 193427 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...