/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/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:30:59,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:30:59,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:30:59,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:30:59,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:30:59,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:30:59,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:30:59,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:30:59,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:30:59,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:30:59,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:30:59,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:30:59,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:30:59,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:30:59,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:30:59,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:30:59,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:30:59,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:30:59,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:30:59,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:30:59,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:30:59,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:30:59,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:30:59,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:31:00,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:31:00,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:31:00,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:31:00,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:31:00,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:31:00,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:31:00,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:31:00,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:31:00,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:31:00,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:31:00,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:31:00,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:31:00,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:31:00,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:31:00,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:31:00,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:31:00,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:31:00,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:31:00,054 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:31:00,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:31:00,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:31:00,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:31:00,056 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:31:00,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:31:00,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:31:00,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:31:00,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:31:00,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:31:00,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:31:00,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:31:00,058 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:31:00,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:31:00,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:31:00,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:31:00,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:31:00,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:31:00,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:31:00,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:31:00,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:31:00,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:31:00,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:31:00,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:31:00,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:31:00,061 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 [2020-12-23 09:31:00,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:31:00,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:31:00,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:31:00,451 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:31:00,451 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:31:00,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-12-23 09:31:00,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb467828f/c87795adc5d544a5a0722f6c80c6aef1/FLAG4c3fbc6e1 [2020-12-23 09:31:01,119 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:31:01,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-12-23 09:31:01,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb467828f/c87795adc5d544a5a0722f6c80c6aef1/FLAG4c3fbc6e1 [2020-12-23 09:31:01,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb467828f/c87795adc5d544a5a0722f6c80c6aef1 [2020-12-23 09:31:01,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:31:01,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:31:01,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:31:01,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:31:01,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:31:01,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f81e8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01, skipping insertion in model container [2020-12-23 09:31:01,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:31:01,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:31:01,709 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/token_ring.01.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] 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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~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_M~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_M~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_M~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,] [2020-12-23 09:31:01,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:31:01,778 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:31:01,791 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/token_ring.01.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] 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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~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_M~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_M~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_M~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,] [2020-12-23 09:31:01,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:31:01,849 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:31:01,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01 WrapperNode [2020-12-23 09:31:01,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:31:01,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:31:01,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:31:01,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:31:01,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:31:01,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:31:01,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:31:01,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:31:01,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (1/1) ... [2020-12-23 09:31:01,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:31:01,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:31:01,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:31:01,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:31:01,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (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 [2020-12-23 09:31:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:31:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:31:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:31:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:31:02,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:31:02,751 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2020-12-23 09:31:02,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:02 BoogieIcfgContainer [2020-12-23 09:31:02,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:31:02,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:31:02,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:31:02,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:31:02,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:31:01" (1/3) ... [2020-12-23 09:31:02,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546b058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:31:02, skipping insertion in model container [2020-12-23 09:31:02,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:01" (2/3) ... [2020-12-23 09:31:02,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546b058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:31:02, skipping insertion in model container [2020-12-23 09:31:02,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:02" (3/3) ... [2020-12-23 09:31:02,762 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-12-23 09:31:02,769 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:31:02,773 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:31:02,792 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:31:02,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:31:02,821 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:31:02,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:31:02,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:31:02,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:31:02,822 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:31:02,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:31:02,822 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:31:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-12-23 09:31:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:02,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:02,851 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] [2020-12-23 09:31:02,851 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-12-23 09:31:02,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:02,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011592103] [2020-12-23 09:31:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:03,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011592103] [2020-12-23 09:31:03,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:03,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:03,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921535575] [2020-12-23 09:31:03,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:03,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:03,108 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2020-12-23 09:31:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:03,185 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2020-12-23 09:31:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:03,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:31:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:03,203 INFO L225 Difference]: With dead ends: 291 [2020-12-23 09:31:03,204 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 09:31:03,208 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 [2020-12-23 09:31:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 09:31:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-12-23 09:31:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-23 09:31:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2020-12-23 09:31:03,262 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2020-12-23 09:31:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:03,263 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2020-12-23 09:31:03,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2020-12-23 09:31:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:03,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:03,265 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] [2020-12-23 09:31:03,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:31:03,266 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-12-23 09:31:03,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:03,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191133903] [2020-12-23 09:31:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:03,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191133903] [2020-12-23 09:31:03,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:03,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:03,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062666116] [2020-12-23 09:31:03,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:03,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:03,344 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2020-12-23 09:31:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:03,451 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2020-12-23 09:31:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:03,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:31:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:03,455 INFO L225 Difference]: With dead ends: 384 [2020-12-23 09:31:03,455 INFO L226 Difference]: Without dead ends: 246 [2020-12-23 09:31:03,457 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 [2020-12-23 09:31:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-12-23 09:31:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2020-12-23 09:31:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 09:31:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2020-12-23 09:31:03,498 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2020-12-23 09:31:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:03,498 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2020-12-23 09:31:03,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2020-12-23 09:31:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:03,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:03,500 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] [2020-12-23 09:31:03,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:31:03,501 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-12-23 09:31:03,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:03,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896234598] [2020-12-23 09:31:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:03,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896234598] [2020-12-23 09:31:03,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:03,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:03,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308638535] [2020-12-23 09:31:03,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:03,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:03,601 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2020-12-23 09:31:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:03,749 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2020-12-23 09:31:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:03,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 09:31:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:03,753 INFO L225 Difference]: With dead ends: 578 [2020-12-23 09:31:03,754 INFO L226 Difference]: Without dead ends: 343 [2020-12-23 09:31:03,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-23 09:31:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2020-12-23 09:31:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 09:31:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2020-12-23 09:31:03,819 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2020-12-23 09:31:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:03,820 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2020-12-23 09:31:03,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2020-12-23 09:31:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:03,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:03,822 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] [2020-12-23 09:31:03,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:31:03,822 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-12-23 09:31:03,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:03,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574119918] [2020-12-23 09:31:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:03,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574119918] [2020-12-23 09:31:03,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:03,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:03,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620454101] [2020-12-23 09:31:03,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:03,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:03,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:03,873 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2020-12-23 09:31:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:03,934 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2020-12-23 09:31:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:03,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:31:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:03,937 INFO L225 Difference]: With dead ends: 476 [2020-12-23 09:31:03,938 INFO L226 Difference]: Without dead ends: 242 [2020-12-23 09:31:03,943 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 [2020-12-23 09:31:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-23 09:31:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-12-23 09:31:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 09:31:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2020-12-23 09:31:04,003 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2020-12-23 09:31:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:04,004 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2020-12-23 09:31:04,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2020-12-23 09:31:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:04,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:04,006 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] [2020-12-23 09:31:04,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:31:04,006 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-12-23 09:31:04,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:04,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593155484] [2020-12-23 09:31:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:04,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593155484] [2020-12-23 09:31:04,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:04,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:04,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124150528] [2020-12-23 09:31:04,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:04,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:04,103 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2020-12-23 09:31:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:04,222 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2020-12-23 09:31:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:04,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 09:31:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:04,227 INFO L225 Difference]: With dead ends: 560 [2020-12-23 09:31:04,227 INFO L226 Difference]: Without dead ends: 327 [2020-12-23 09:31:04,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-23 09:31:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2020-12-23 09:31:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 09:31:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2020-12-23 09:31:04,257 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2020-12-23 09:31:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:04,257 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2020-12-23 09:31:04,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2020-12-23 09:31:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:31:04,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:04,267 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] [2020-12-23 09:31:04,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:31:04,268 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-12-23 09:31:04,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:04,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124082485] [2020-12-23 09:31:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:04,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124082485] [2020-12-23 09:31:04,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:04,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:04,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638811193] [2020-12-23 09:31:04,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:04,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:04,325 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2020-12-23 09:31:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:04,462 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2020-12-23 09:31:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:04,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 09:31:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:04,467 INFO L225 Difference]: With dead ends: 820 [2020-12-23 09:31:04,467 INFO L226 Difference]: Without dead ends: 589 [2020-12-23 09:31:04,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-12-23 09:31:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2020-12-23 09:31:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-12-23 09:31:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2020-12-23 09:31:04,509 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2020-12-23 09:31:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:04,509 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2020-12-23 09:31:04,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2020-12-23 09:31:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 09:31:04,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:04,511 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:04,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:31:04,511 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -251336852, now seen corresponding path program 1 times [2020-12-23 09:31:04,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:04,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92848545] [2020-12-23 09:31:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:31:04,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92848545] [2020-12-23 09:31:04,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:04,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:04,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194804462] [2020-12-23 09:31:04,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:04,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:04,569 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2020-12-23 09:31:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:04,750 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2020-12-23 09:31:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:04,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-12-23 09:31:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:04,755 INFO L225 Difference]: With dead ends: 1379 [2020-12-23 09:31:04,755 INFO L226 Difference]: Without dead ends: 859 [2020-12-23 09:31:04,757 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 [2020-12-23 09:31:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-12-23 09:31:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2020-12-23 09:31:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-12-23 09:31:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2020-12-23 09:31:04,805 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2020-12-23 09:31:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:04,805 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2020-12-23 09:31:04,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2020-12-23 09:31:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 09:31:04,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:04,806 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:04,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:31:04,807 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 450263022, now seen corresponding path program 1 times [2020-12-23 09:31:04,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:04,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366532076] [2020-12-23 09:31:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:31:04,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366532076] [2020-12-23 09:31:04,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:04,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:04,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260987909] [2020-12-23 09:31:04,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:04,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:04,852 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2020-12-23 09:31:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:04,948 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2020-12-23 09:31:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:04,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 09:31:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:04,953 INFO L225 Difference]: With dead ends: 1340 [2020-12-23 09:31:04,953 INFO L226 Difference]: Without dead ends: 801 [2020-12-23 09:31:04,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-12-23 09:31:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2020-12-23 09:31:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-12-23 09:31:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2020-12-23 09:31:05,002 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2020-12-23 09:31:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:05,003 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2020-12-23 09:31:05,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2020-12-23 09:31:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 09:31:05,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:05,004 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:05,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:31:05,004 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2020-12-23 09:31:05,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:05,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677527364] [2020-12-23 09:31:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:05,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677527364] [2020-12-23 09:31:05,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:05,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:05,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328024762] [2020-12-23 09:31:05,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:05,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:05,050 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2020-12-23 09:31:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:05,173 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2020-12-23 09:31:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:05,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-23 09:31:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:05,179 INFO L225 Difference]: With dead ends: 1555 [2020-12-23 09:31:05,180 INFO L226 Difference]: Without dead ends: 1018 [2020-12-23 09:31:05,181 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 [2020-12-23 09:31:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-12-23 09:31:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2020-12-23 09:31:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-12-23 09:31:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2020-12-23 09:31:05,262 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2020-12-23 09:31:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:05,262 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2020-12-23 09:31:05,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2020-12-23 09:31:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:31:05,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:05,264 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:05,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:31:05,264 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2020-12-23 09:31:05,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:05,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803166005] [2020-12-23 09:31:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:31:05,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803166005] [2020-12-23 09:31:05,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:05,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:05,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191336967] [2020-12-23 09:31:05,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:05,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:05,315 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2020-12-23 09:31:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:05,460 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2020-12-23 09:31:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 09:31:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:05,470 INFO L225 Difference]: With dead ends: 2328 [2020-12-23 09:31:05,470 INFO L226 Difference]: Without dead ends: 1624 [2020-12-23 09:31:05,472 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 [2020-12-23 09:31:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-12-23 09:31:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2020-12-23 09:31:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-12-23 09:31:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2020-12-23 09:31:05,607 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2020-12-23 09:31:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:05,608 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2020-12-23 09:31:05,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2020-12-23 09:31:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:31:05,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:05,609 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:05,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:31:05,610 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:05,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2020-12-23 09:31:05,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:05,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782113149] [2020-12-23 09:31:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:05,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782113149] [2020-12-23 09:31:05,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:05,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:05,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229941732] [2020-12-23 09:31:05,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:05,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:05,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:05,657 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2020-12-23 09:31:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:05,859 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2020-12-23 09:31:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:05,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-23 09:31:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:05,870 INFO L225 Difference]: With dead ends: 2606 [2020-12-23 09:31:05,870 INFO L226 Difference]: Without dead ends: 1600 [2020-12-23 09:31:05,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:31:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-12-23 09:31:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2020-12-23 09:31:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-12-23 09:31:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2020-12-23 09:31:06,049 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2020-12-23 09:31:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:06,049 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2020-12-23 09:31:06,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2020-12-23 09:31:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:31:06,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:06,051 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:06,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:31:06,052 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2020-12-23 09:31:06,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:06,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801397949] [2020-12-23 09:31:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:06,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801397949] [2020-12-23 09:31:06,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:06,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:06,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469523221] [2020-12-23 09:31:06,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:06,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:06,166 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2020-12-23 09:31:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:06,396 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2020-12-23 09:31:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:06,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 09:31:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:06,410 INFO L225 Difference]: With dead ends: 3754 [2020-12-23 09:31:06,411 INFO L226 Difference]: Without dead ends: 2454 [2020-12-23 09:31:06,413 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 [2020-12-23 09:31:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2020-12-23 09:31:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2020-12-23 09:31:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-23 09:31:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2020-12-23 09:31:06,643 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2020-12-23 09:31:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:06,645 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2020-12-23 09:31:06,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2020-12-23 09:31:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 09:31:06,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:06,647 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:31:06,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:31:06,647 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2020-12-23 09:31:06,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:06,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090277510] [2020-12-23 09:31:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:06,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090277510] [2020-12-23 09:31:06,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:06,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:06,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004064601] [2020-12-23 09:31:06,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:06,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:06,715 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2020-12-23 09:31:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:06,976 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2020-12-23 09:31:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:06,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-12-23 09:31:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:06,986 INFO L225 Difference]: With dead ends: 4276 [2020-12-23 09:31:06,986 INFO L226 Difference]: Without dead ends: 1875 [2020-12-23 09:31:06,995 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 [2020-12-23 09:31:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-12-23 09:31:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2020-12-23 09:31:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2020-12-23 09:31:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2020-12-23 09:31:07,132 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2020-12-23 09:31:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:07,135 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2020-12-23 09:31:07,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2020-12-23 09:31:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:31:07,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:07,141 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-23 09:31:07,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:31:07,141 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2020-12-23 09:31:07,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:07,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75299056] [2020-12-23 09:31:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:31:07,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75299056] [2020-12-23 09:31:07,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:07,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:07,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224203674] [2020-12-23 09:31:07,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:07,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:07,200 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2020-12-23 09:31:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:07,418 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2020-12-23 09:31:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:07,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 09:31:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:07,426 INFO L225 Difference]: With dead ends: 3747 [2020-12-23 09:31:07,426 INFO L226 Difference]: Without dead ends: 1634 [2020-12-23 09:31:07,433 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 [2020-12-23 09:31:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2020-12-23 09:31:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2020-12-23 09:31:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2020-12-23 09:31:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2020-12-23 09:31:07,561 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2020-12-23 09:31:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:07,561 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2020-12-23 09:31:07,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2020-12-23 09:31:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:31:07,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:07,564 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 09:31:07,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:31:07,564 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2020-12-23 09:31:07,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:07,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015134981] [2020-12-23 09:31:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:31:07,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015134981] [2020-12-23 09:31:07,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:07,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:07,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458671986] [2020-12-23 09:31:07,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:07,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:07,657 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 4 states. [2020-12-23 09:31:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:07,815 INFO L93 Difference]: Finished difference Result 2614 states and 3137 transitions. [2020-12-23 09:31:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:07,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 09:31:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:07,820 INFO L225 Difference]: With dead ends: 2614 [2020-12-23 09:31:07,820 INFO L226 Difference]: Without dead ends: 728 [2020-12-23 09:31:07,825 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 [2020-12-23 09:31:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-12-23 09:31:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 716. [2020-12-23 09:31:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 09:31:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2020-12-23 09:31:07,896 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2020-12-23 09:31:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:07,897 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2020-12-23 09:31:07,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2020-12-23 09:31:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:31:07,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:07,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 09:31:07,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:31:07,900 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2020-12-23 09:31:07,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:07,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472345962] [2020-12-23 09:31:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:07,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472345962] [2020-12-23 09:31:07,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:07,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:07,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398463005] [2020-12-23 09:31:07,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:07,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:07,959 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2020-12-23 09:31:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:08,026 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2020-12-23 09:31:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:08,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 09:31:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:08,029 INFO L225 Difference]: With dead ends: 1048 [2020-12-23 09:31:08,029 INFO L226 Difference]: Without dead ends: 594 [2020-12-23 09:31:08,030 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 [2020-12-23 09:31:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-12-23 09:31:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2020-12-23 09:31:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 09:31:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2020-12-23 09:31:08,075 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2020-12-23 09:31:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:08,076 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2020-12-23 09:31:08,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2020-12-23 09:31:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:31:08,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:08,077 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 09:31:08,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:31:08,078 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2020-12-23 09:31:08,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:08,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37901188] [2020-12-23 09:31:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:31:08,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37901188] [2020-12-23 09:31:08,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:08,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:08,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479627019] [2020-12-23 09:31:08,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:08,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:08,212 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2020-12-23 09:31:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:08,286 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2020-12-23 09:31:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:08,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 09:31:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:08,290 INFO L225 Difference]: With dead ends: 598 [2020-12-23 09:31:08,290 INFO L226 Difference]: Without dead ends: 596 [2020-12-23 09:31:08,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-12-23 09:31:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2020-12-23 09:31:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-12-23 09:31:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2020-12-23 09:31:08,365 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2020-12-23 09:31:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:08,365 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2020-12-23 09:31:08,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2020-12-23 09:31:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 09:31:08,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:08,367 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 09:31:08,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:31:08,367 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2020-12-23 09:31:08,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:08,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438335068] [2020-12-23 09:31:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 09:31:08,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438335068] [2020-12-23 09:31:08,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:08,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:08,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954185482] [2020-12-23 09:31:08,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:08,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:08,434 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2020-12-23 09:31:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:08,536 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2020-12-23 09:31:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:08,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 09:31:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:08,540 INFO L225 Difference]: With dead ends: 1230 [2020-12-23 09:31:08,541 INFO L226 Difference]: Without dead ends: 900 [2020-12-23 09:31:08,542 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 [2020-12-23 09:31:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-12-23 09:31:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2020-12-23 09:31:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 09:31:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2020-12-23 09:31:08,605 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2020-12-23 09:31:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:08,606 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2020-12-23 09:31:08,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2020-12-23 09:31:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:31:08,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:08,608 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-12-23 09:31:08,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:31:08,608 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2020-12-23 09:31:08,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:08,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778530485] [2020-12-23 09:31:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:31:08,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:31:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:31:08,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:31:08,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:31:08,715 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:31:08,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:31:08,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:31:08 BoogieIcfgContainer [2020-12-23 09:31:08,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:31:08,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:31:08,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:31:08,878 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:31:08,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:02" (3/4) ... [2020-12-23 09:31:08,881 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:31:08,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.01.cil-2.c-witness.graphml [2020-12-23 09:31:09,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:31:09,002 INFO L168 Benchmark]: Toolchain (without parser) took 7503.63 ms. Allocated memory was 155.2 MB in the beginning and 292.6 MB in the end (delta: 137.4 MB). Free memory was 131.0 MB in the beginning and 142.9 MB in the end (delta: -11.9 MB). Peak memory consumption was 125.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,002 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 155.2 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:31:09,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.05 ms. Allocated memory is still 155.2 MB. Free memory was 130.8 MB in the beginning and 117.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 155.2 MB. Free memory was 117.3 MB in the beginning and 114.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,003 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 155.2 MB. Free memory was 114.7 MB in the beginning and 112.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,004 INFO L168 Benchmark]: RCFGBuilder took 799.04 ms. Allocated memory is still 155.2 MB. Free memory was 112.7 MB in the beginning and 108.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,004 INFO L168 Benchmark]: TraceAbstraction took 6122.59 ms. Allocated memory was 155.2 MB in the beginning and 292.6 MB in the end (delta: 137.4 MB). Free memory was 107.7 MB in the beginning and 156.0 MB in the end (delta: -48.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,005 INFO L168 Benchmark]: Witness Printer took 121.93 ms. Allocated memory is still 292.6 MB. Free memory was 156.0 MB in the beginning and 142.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:31:09,007 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.21 ms. Allocated memory is still 155.2 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 350.05 ms. Allocated memory is still 155.2 MB. Free memory was 130.8 MB in the beginning and 117.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 155.2 MB. Free memory was 117.3 MB in the beginning and 114.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 155.2 MB. Free memory was 114.7 MB in the beginning and 112.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 799.04 ms. Allocated memory is still 155.2 MB. Free memory was 112.7 MB in the beginning and 108.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6122.59 ms. Allocated memory was 155.2 MB in the beginning and 292.6 MB in the end (delta: 137.4 MB). Free memory was 107.7 MB in the beginning and 156.0 MB in the end (delta: -48.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 8.0 GB. * Witness Printer took 121.93 ms. Allocated memory is still 292.6 MB. Free memory was 156.0 MB in the beginning and 142.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=2, E_M=2, local=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, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=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, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=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, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=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, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=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, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=2, local=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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L138] __retres1 = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L140] return (__retres1); VAL [E_1=2, E_M=2, local=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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=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, token=0] [L144] int __retres1 ; VAL [E_1=2, E_M=2, local=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, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L157] __retres1 = 0 VAL [E_1=2, E_M=2, local=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, token=0] [L159] return (__retres1); VAL [E_1=2, E_M=2, local=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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=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, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=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, token=0] [L432] COND TRUE 1 VAL [E_1=2, E_M=2, local=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, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=2, E_M=2, local=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, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=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, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=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, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=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, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=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, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=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, token=0] [L47] COND TRUE 1 VAL [E_1=2, E_M=2, local=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, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, E_M=2, local=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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=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, token=0] [L138] __retres1 = 0 VAL [E_1=1, E_M=2, local=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, token=0] [L140] return (__retres1); VAL [E_1=1, E_M=2, local=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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=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, token=0] [L144] int __retres1 ; VAL [E_1=1, E_M=2, local=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, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=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, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, E_M=2, local=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, token=0] [L159] return (__retres1); VAL [E_1=1, E_M=2, local=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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3984 SDtfs, 5328 SDslu, 3898 SDs, 0 SdLazy, 453 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 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...