/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:29:45,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:29:45,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:29:45,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:29:45,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:29:45,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:29:45,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:29:45,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:29:45,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:29:45,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:29:45,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:29:45,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:29:45,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:29:45,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:29:45,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:29:45,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:29:45,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:29:45,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:29:45,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:29:45,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:29:45,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:29:45,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:29:45,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:29:45,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:29:45,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:29:45,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:29:45,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:29:45,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:29:45,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:29:45,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:29:45,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:29:45,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:29:45,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:29:45,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:29:45,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:29:45,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:29:45,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:29:45,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:29:45,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:29:45,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:29:45,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:29:45,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:29:45,671 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:29:45,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:29:45,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:29:45,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:29:45,676 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:29:45,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:29:45,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:29:45,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:29:45,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:29:45,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:29:45,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:29:45,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:29:45,679 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:29:45,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:29:45,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:29:45,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:29:45,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:29:45,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:29:45,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:29:45,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:29:45,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:29:45,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:29:45,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:29:45,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:29:45,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:29:45,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:29:46,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:29:46,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:29:46,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:29:46,168 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:29:46,169 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:29:46,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-01-06 19:29:46,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2912fc843/aae3e73ce7ca4c17a3d9d4b9c948578d/FLAGcc824359c [2021-01-06 19:29:47,031 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:29:47,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-01-06 19:29:47,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2912fc843/aae3e73ce7ca4c17a3d9d4b9c948578d/FLAGcc824359c [2021-01-06 19:29:47,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2912fc843/aae3e73ce7ca4c17a3d9d4b9c948578d [2021-01-06 19:29:47,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:29:47,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:29:47,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:29:47,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:29:47,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:29:47,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40763cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47, skipping insertion in model container [2021-01-06 19:29:47,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:29:47,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:29:47,645 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2021-01-06 19:29:47,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:29:47,710 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:29:47,724 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2021-01-06 19:29:47,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:29:47,800 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:29:47,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47 WrapperNode [2021-01-06 19:29:47,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:29:47,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:29:47,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:29:47,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:29:47,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:29:47,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:29:47,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:29:47,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:29:47,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... [2021-01-06 19:29:47,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:29:47,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:29:47,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:29:47,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:29:47,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:29:48,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:29:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:29:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:29:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:29:48,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:29:48,937 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-01-06 19:29:48,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:48 BoogieIcfgContainer [2021-01-06 19:29:48,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:29:48,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:29:48,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:29:48,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:29:48,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:29:47" (1/3) ... [2021-01-06 19:29:48,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d936d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:29:48, skipping insertion in model container [2021-01-06 19:29:48,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:29:47" (2/3) ... [2021-01-06 19:29:48,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d936d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:29:48, skipping insertion in model container [2021-01-06 19:29:48,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:48" (3/3) ... [2021-01-06 19:29:48,949 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2021-01-06 19:29:48,956 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:29:48,962 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:29:48,983 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:29:49,012 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:29:49,015 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:29:49,015 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:29:49,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:29:49,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:29:49,016 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:29:49,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:29:49,016 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:29:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2021-01-06 19:29:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:49,043 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:49,044 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] [2021-01-06 19:29:49,044 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2021-01-06 19:29:49,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:49,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977028077] [2021-01-06 19:29:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:49,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977028077] [2021-01-06 19:29:49,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:49,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:49,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284232400] [2021-01-06 19:29:49,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:49,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,302 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2021-01-06 19:29:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:49,370 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2021-01-06 19:29:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:49,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 19:29:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:49,385 INFO L225 Difference]: With dead ends: 239 [2021-01-06 19:29:49,385 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 19:29:49,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 19:29:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-01-06 19:29:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 19:29:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2021-01-06 19:29:49,443 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2021-01-06 19:29:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:49,444 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2021-01-06 19:29:49,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2021-01-06 19:29:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:49,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:49,446 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] [2021-01-06 19:29:49,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:29:49,447 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2021-01-06 19:29:49,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:49,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481314028] [2021-01-06 19:29:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:49,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481314028] [2021-01-06 19:29:49,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:49,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:49,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691310927] [2021-01-06 19:29:49,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:49,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:49,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,510 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2021-01-06 19:29:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:49,609 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2021-01-06 19:29:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:49,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 19:29:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:49,613 INFO L225 Difference]: With dead ends: 308 [2021-01-06 19:29:49,614 INFO L226 Difference]: Without dead ends: 196 [2021-01-06 19:29:49,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-06 19:29:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2021-01-06 19:29:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-06 19:29:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2021-01-06 19:29:49,656 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2021-01-06 19:29:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:49,656 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2021-01-06 19:29:49,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2021-01-06 19:29:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:49,660 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:49,661 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] [2021-01-06 19:29:49,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:29:49,661 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2021-01-06 19:29:49,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:49,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635116336] [2021-01-06 19:29:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:49,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635116336] [2021-01-06 19:29:49,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:49,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:49,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932816528] [2021-01-06 19:29:49,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:49,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:49,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:49,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,726 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2021-01-06 19:29:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:49,765 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2021-01-06 19:29:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:49,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 19:29:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:49,768 INFO L225 Difference]: With dead ends: 381 [2021-01-06 19:29:49,768 INFO L226 Difference]: Without dead ends: 194 [2021-01-06 19:29:49,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-06 19:29:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-01-06 19:29:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-06 19:29:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2021-01-06 19:29:49,811 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2021-01-06 19:29:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:49,811 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2021-01-06 19:29:49,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2021-01-06 19:29:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:49,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:49,813 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] [2021-01-06 19:29:49,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:29:49,813 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2021-01-06 19:29:49,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:49,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498960421] [2021-01-06 19:29:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:49,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498960421] [2021-01-06 19:29:49,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:49,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:49,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146116798] [2021-01-06 19:29:49,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:49,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,869 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2021-01-06 19:29:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:49,963 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2021-01-06 19:29:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:49,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 19:29:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:49,966 INFO L225 Difference]: With dead ends: 380 [2021-01-06 19:29:49,966 INFO L226 Difference]: Without dead ends: 194 [2021-01-06 19:29:49,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-06 19:29:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-01-06 19:29:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-06 19:29:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2021-01-06 19:29:50,000 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2021-01-06 19:29:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:50,001 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2021-01-06 19:29:50,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2021-01-06 19:29:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:50,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:50,002 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] [2021-01-06 19:29:50,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:29:50,003 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2021-01-06 19:29:50,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:50,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121617688] [2021-01-06 19:29:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:50,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121617688] [2021-01-06 19:29:50,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:50,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:50,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822761755] [2021-01-06 19:29:50,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:50,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:50,131 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 5 states. [2021-01-06 19:29:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:50,282 INFO L93 Difference]: Finished difference Result 628 states and 846 transitions. [2021-01-06 19:29:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:50,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:29:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:50,287 INFO L225 Difference]: With dead ends: 628 [2021-01-06 19:29:50,287 INFO L226 Difference]: Without dead ends: 449 [2021-01-06 19:29:50,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-01-06 19:29:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 203. [2021-01-06 19:29:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-06 19:29:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 266 transitions. [2021-01-06 19:29:50,319 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 266 transitions. Word has length 37 [2021-01-06 19:29:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:50,319 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 266 transitions. [2021-01-06 19:29:50,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2021-01-06 19:29:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:50,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:50,321 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] [2021-01-06 19:29:50,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:29:50,321 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2056966386, now seen corresponding path program 1 times [2021-01-06 19:29:50,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:50,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607404877] [2021-01-06 19:29:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:50,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607404877] [2021-01-06 19:29:50,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:50,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:50,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206935380] [2021-01-06 19:29:50,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:50,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:50,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:50,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:50,388 INFO L87 Difference]: Start difference. First operand 203 states and 266 transitions. Second operand 5 states. [2021-01-06 19:29:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:50,518 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2021-01-06 19:29:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:50,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:29:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:50,522 INFO L225 Difference]: With dead ends: 540 [2021-01-06 19:29:50,523 INFO L226 Difference]: Without dead ends: 359 [2021-01-06 19:29:50,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-01-06 19:29:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 209. [2021-01-06 19:29:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 19:29:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2021-01-06 19:29:50,555 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 37 [2021-01-06 19:29:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:50,555 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2021-01-06 19:29:50,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2021-01-06 19:29:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:29:50,556 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:50,556 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] [2021-01-06 19:29:50,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:29:50,557 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash 62821680, now seen corresponding path program 1 times [2021-01-06 19:29:50,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:50,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367143643] [2021-01-06 19:29:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:50,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367143643] [2021-01-06 19:29:50,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:50,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:50,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129665252] [2021-01-06 19:29:50,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:50,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:50,621 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand 3 states. [2021-01-06 19:29:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:50,734 INFO L93 Difference]: Finished difference Result 554 states and 708 transitions. [2021-01-06 19:29:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:50,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 19:29:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:50,739 INFO L225 Difference]: With dead ends: 554 [2021-01-06 19:29:50,740 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 19:29:50,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 19:29:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 355. [2021-01-06 19:29:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 19:29:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 443 transitions. [2021-01-06 19:29:50,808 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 443 transitions. Word has length 37 [2021-01-06 19:29:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:50,809 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 443 transitions. [2021-01-06 19:29:50,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 443 transitions. [2021-01-06 19:29:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 19:29:50,814 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:50,815 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] [2021-01-06 19:29:50,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:29:50,815 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1851829351, now seen corresponding path program 1 times [2021-01-06 19:29:50,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:50,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437070900] [2021-01-06 19:29:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:50,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437070900] [2021-01-06 19:29:50,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:50,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:50,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572637838] [2021-01-06 19:29:50,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:50,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:50,920 INFO L87 Difference]: Start difference. First operand 355 states and 443 transitions. Second operand 3 states. [2021-01-06 19:29:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:51,021 INFO L93 Difference]: Finished difference Result 967 states and 1214 transitions. [2021-01-06 19:29:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:51,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 19:29:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:51,025 INFO L225 Difference]: With dead ends: 967 [2021-01-06 19:29:51,026 INFO L226 Difference]: Without dead ends: 642 [2021-01-06 19:29:51,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-01-06 19:29:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2021-01-06 19:29:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2021-01-06 19:29:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 784 transitions. [2021-01-06 19:29:51,078 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 784 transitions. Word has length 38 [2021-01-06 19:29:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:51,079 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 784 transitions. [2021-01-06 19:29:51,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 784 transitions. [2021-01-06 19:29:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:29:51,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:51,080 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:29:51,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:29:51,081 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1992530247, now seen corresponding path program 1 times [2021-01-06 19:29:51,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:51,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944360410] [2021-01-06 19:29:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:51,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944360410] [2021-01-06 19:29:51,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:51,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:29:51,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712240463] [2021-01-06 19:29:51,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:51,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:51,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:51,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:51,134 INFO L87 Difference]: Start difference. First operand 634 states and 784 transitions. Second operand 4 states. [2021-01-06 19:29:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:51,300 INFO L93 Difference]: Finished difference Result 1784 states and 2213 transitions. [2021-01-06 19:29:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:29:51,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 19:29:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:51,306 INFO L225 Difference]: With dead ends: 1784 [2021-01-06 19:29:51,306 INFO L226 Difference]: Without dead ends: 921 [2021-01-06 19:29:51,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-01-06 19:29:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2021-01-06 19:29:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2021-01-06 19:29:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1123 transitions. [2021-01-06 19:29:51,425 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1123 transitions. Word has length 51 [2021-01-06 19:29:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:51,431 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1123 transitions. [2021-01-06 19:29:51,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1123 transitions. [2021-01-06 19:29:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:29:51,434 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:51,434 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:29:51,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:29:51,435 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2021-01-06 19:29:51,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:51,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681523780] [2021-01-06 19:29:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:29:51,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:29:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:29:51,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:29:51,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:29:51,582 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:29:51,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:29:51,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:29:51 BoogieIcfgContainer [2021-01-06 19:29:51,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:29:51,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:29:51,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:29:51,719 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:29:51,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:29:48" (3/4) ... [2021-01-06 19:29:51,722 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:29:51,840 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/transmitter.01.cil.c-witness.graphml [2021-01-06 19:29:51,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:29:51,847 INFO L168 Benchmark]: Toolchain (without parser) took 4467.98 ms. Allocated memory was 151.0 MB in the beginning and 185.6 MB in the end (delta: 34.6 MB). Free memory was 125.3 MB in the beginning and 139.2 MB in the end (delta: -13.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,848 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:29:51,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.33 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 112.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.24 ms. Allocated memory is still 151.0 MB. Free memory was 112.4 MB in the beginning and 110.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,851 INFO L168 Benchmark]: Boogie Preprocessor took 58.66 ms. Allocated memory is still 151.0 MB. Free memory was 110.0 MB in the beginning and 108.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,851 INFO L168 Benchmark]: RCFGBuilder took 1017.35 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 109.0 MB in the end (delta: -906.8 kB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,852 INFO L168 Benchmark]: TraceAbstraction took 2776.34 ms. Allocated memory was 151.0 MB in the beginning and 185.6 MB in the end (delta: 34.6 MB). Free memory was 108.5 MB in the beginning and 147.7 MB in the end (delta: -39.2 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:29:51,855 INFO L168 Benchmark]: Witness Printer took 122.70 ms. Allocated memory is still 185.6 MB. Free memory was 147.7 MB in the beginning and 139.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:29:51,857 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 422.33 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 112.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 59.24 ms. Allocated memory is still 151.0 MB. Free memory was 112.4 MB in the beginning and 110.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.66 ms. Allocated memory is still 151.0 MB. Free memory was 110.0 MB in the beginning and 108.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1017.35 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 109.0 MB in the end (delta: -906.8 kB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 2776.34 ms. Allocated memory was 151.0 MB in the beginning and 185.6 MB in the end (delta: 34.6 MB). Free memory was 108.5 MB in the beginning and 147.7 MB in the end (delta: -39.2 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 122.70 ms. Allocated memory is still 185.6 MB. Free memory was 147.7 MB in the beginning and 139.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int E_1 = 2; VAL [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] [L441] int __retres1 ; [L356] m_i = 1 [L357] t1_i = 1 VAL [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] [L382] int kernel_st ; [L383] int tmp ; [L384] int tmp___0 ; [L388] kernel_st = 0 VAL [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] [L153] COND TRUE m_i == 1 [L154] m_st = 0 VAL [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] [L158] COND TRUE t1_i == 1 [L159] t1_st = 0 VAL [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] [L242] COND FALSE !(M_E == 0) VAL [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] [L247] COND FALSE !(T1_E == 0) VAL [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] [L252] COND FALSE !(E_1 == 0) VAL [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] [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [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] [L107] COND FALSE !(m_pc == 1) VAL [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] __retres1 = 0 VAL [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] [L119] return (__retres1); VAL [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] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [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] [L123] int __retres1 ; VAL [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] [L126] COND FALSE !(t1_pc == 1) VAL [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] __retres1 = 0 VAL [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] [L138] return (__retres1); VAL [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] [L298] tmp___0 = is_transmit1_triggered() [L300] COND FALSE !(\read(tmp___0)) VAL [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] [L265] COND FALSE !(M_E == 1) VAL [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] [L270] COND FALSE !(T1_E == 1) VAL [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] [L275] COND FALSE !(E_1 == 1) VAL [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] [L396] COND TRUE 1 VAL [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] [L399] kernel_st = 1 [L189] int tmp ; VAL [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] [L193] COND TRUE 1 VAL [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] [L168] int __retres1 ; VAL [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] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [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] [L184] return (__retres1); VAL [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] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [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] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND FALSE !(\read(tmp_ndt_1)) VAL [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] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [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] [L74] COND TRUE t1_pc == 0 VAL [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] COND TRUE 1 VAL [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] [L87] t1_pc = 1 [L88] t1_st = 2 VAL [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] [L193] COND TRUE 1 VAL [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] [L168] int __retres1 ; VAL [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] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [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] [L184] return (__retres1); VAL [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] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [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] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND TRUE \read(tmp_ndt_1) [L208] m_st = 1 VAL [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] [L33] COND TRUE m_pc == 0 VAL [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] [L44] COND TRUE 1 VAL [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] [L47] E_1 = 1 [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [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] [L107] COND FALSE !(m_pc == 1) VAL [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] __retres1 = 0 VAL [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] [L119] return (__retres1); VAL [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] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [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] [L123] int __retres1 ; VAL [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] [L126] COND TRUE t1_pc == 1 VAL [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] [L127] COND TRUE E_1 == 1 [L128] __retres1 = 1 VAL [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] [L138] return (__retres1); VAL [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] [L298] tmp___0 = is_transmit1_triggered() [L300] COND TRUE \read(tmp___0) [L301] t1_st = 0 VAL [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] [L49] E_1 = 2 VAL [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] COND TRUE 1 VAL [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] [L54] m_pc = 1 [L55] m_st = 2 VAL [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] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [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] [L74] COND FALSE !(t1_pc == 0) VAL [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] [L77] COND TRUE t1_pc == 1 VAL [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] [L13] reach_error() VAL [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 1 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1528 SDtfs, 1813 SDslu, 1481 SDs, 0 SdLazy, 175 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 421 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 21541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11/11 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...